# No SInE strategy applied
# Trying AutoSched0 for 161 seconds
# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S035N
# and selection function PSelectUnlessPosMax.
#
# Preprocessing time       : 0.019 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(redefinition_k9_domain_1, axiom, ![X1, X2, X3, X4, X5]:(((((~(v1_xboole_0(X1))&m1_subset_1(X2,X1))&m1_subset_1(X3,X1))&m1_subset_1(X4,X1))&m1_subset_1(X5,X1))=>k9_domain_1(X1,X2,X3,X4,X5)=k2_enumset1(X2,X3,X4,X5)), file('number14/number14__t86_number14', redefinition_k9_domain_1)).
fof(fc6_ordinal1, axiom, (~(v1_xboole_0(k4_ordinal1))&v3_ordinal1(k4_ordinal1)), file('number14/number14__t86_number14', fc6_ordinal1)).
fof(t59_card_2, axiom, ![X1, X2, X3, X4]:~(((((((X1!=X2&X1!=X3)&X1!=X4)&X2!=X3)&X2!=X4)&X3!=X4)&k4_card_1(k2_enumset1(X1,X2,X3,X4))!=np__4)), file('number14/number14__t86_number14', t59_card_2)).
fof(t69_number14, axiom, k8_number14(k5_numbers,np__10)=k9_domain_1(k4_ordinal1,np__2,np__3,np__5,np__7), file('number14/number14__t86_number14', t69_number14)).
fof(spc7_numerals, axiom, (v2_xxreal_0(np__7)&m1_subset_1(np__7,k4_ordinal1)), file('number14/number14__t86_number14', spc7_numerals)).
fof(spc5_numerals, axiom, (v2_xxreal_0(np__5)&m1_subset_1(np__5,k4_ordinal1)), file('number14/number14__t86_number14', spc5_numerals)).
fof(spc3_numerals, axiom, (v2_xxreal_0(np__3)&m1_subset_1(np__3,k4_ordinal1)), file('number14/number14__t86_number14', spc3_numerals)).
fof(spc2_numerals, axiom, (v2_xxreal_0(np__2)&m1_subset_1(np__2,k4_ordinal1)), file('number14/number14__t86_number14', spc2_numerals)).
fof(t86_number14, conjecture, k4_card_1(k8_number14(k5_numbers,np__10))=np__4, file('number14/number14__t86_number14', t86_number14)).
fof(rqLessOrEqual__r1_xxreal_0__r7_r3, axiom, ~(r1_xxreal_0(np__7,np__3)), file('number14/number14__t86_number14', rqLessOrEqual__r1_xxreal_0__r7_r3)).
fof(rqLessOrEqual__r1_xxreal_0__r7_r5, axiom, ~(r1_xxreal_0(np__7,np__5)), file('number14/number14__t86_number14', rqLessOrEqual__r1_xxreal_0__r7_r5)).
fof(rqLessOrEqual__r1_xxreal_0__r2_r3, axiom, r1_xxreal_0(np__2,np__3), file('number14/number14__t86_number14', rqLessOrEqual__r1_xxreal_0__r2_r3)).
fof(rqLessOrEqual__r1_xxreal_0__r5_r5, axiom, r1_xxreal_0(np__5,np__5), file('number14/number14__t86_number14', rqLessOrEqual__r1_xxreal_0__r5_r5)).
fof(rqLessOrEqual__r1_xxreal_0__r3_r3, axiom, r1_xxreal_0(np__3,np__3), file('number14/number14__t86_number14', rqLessOrEqual__r1_xxreal_0__r3_r3)).
fof(rqLessOrEqual__r1_xxreal_0__r5_r3, axiom, ~(r1_xxreal_0(np__5,np__3)), file('number14/number14__t86_number14', rqLessOrEqual__r1_xxreal_0__r5_r3)).
fof(rqLessOrEqual__r1_xxreal_0__r3_r2, axiom, ~(r1_xxreal_0(np__3,np__2)), file('number14/number14__t86_number14', rqLessOrEqual__r1_xxreal_0__r3_r2)).
fof(c_0_16, plain, ![X1, X2, X3, X4, X5]:(((((~v1_xboole_0(X1)&m1_subset_1(X2,X1))&m1_subset_1(X3,X1))&m1_subset_1(X4,X1))&m1_subset_1(X5,X1))=>k9_domain_1(X1,X2,X3,X4,X5)=k2_enumset1(X2,X3,X4,X5)), inference(fof_simplification,[status(thm)],[redefinition_k9_domain_1])).
fof(c_0_17, plain, ![X15, X16, X17, X18, X19]:(v1_xboole_0(X15)|~m1_subset_1(X16,X15)|~m1_subset_1(X17,X15)|~m1_subset_1(X18,X15)|~m1_subset_1(X19,X15)|k9_domain_1(X15,X16,X17,X18,X19)=k2_enumset1(X16,X17,X18,X19)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])).
fof(c_0_18, plain, (~v1_xboole_0(k4_ordinal1)&v3_ordinal1(k4_ordinal1)), inference(fof_simplification,[status(thm)],[fc6_ordinal1])).
fof(c_0_19, plain, ![X20, X21, X22, X23]:(X20=X21|X20=X22|X20=X23|X21=X22|X21=X23|X22=X23|k4_card_1(k2_enumset1(X20,X21,X22,X23))=np__4), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t59_card_2])])).
cnf(c_0_20, plain, (k8_number14(k5_numbers,np__10)=k9_domain_1(k4_ordinal1,np__2,np__3,np__5,np__7)), inference(split_conjunct,[status(thm)],[t69_number14])).
cnf(c_0_21, plain, (v1_xboole_0(X1)|k9_domain_1(X1,X2,X3,X4,X5)=k2_enumset1(X2,X3,X4,X5)|~m1_subset_1(X2,X1)|~m1_subset_1(X3,X1)|~m1_subset_1(X4,X1)|~m1_subset_1(X5,X1)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_22, plain, (m1_subset_1(np__7,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc7_numerals])).
cnf(c_0_23, plain, (m1_subset_1(np__5,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc5_numerals])).
cnf(c_0_24, plain, (m1_subset_1(np__3,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc3_numerals])).
cnf(c_0_25, plain, (m1_subset_1(np__2,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc2_numerals])).
cnf(c_0_26, plain, (~v1_xboole_0(k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_18])).
fof(c_0_27, negated_conjecture, k4_card_1(k8_number14(k5_numbers,np__10))!=np__4, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t86_number14])])).
fof(c_0_28, plain, ~r1_xxreal_0(np__7,np__3), inference(fof_simplification,[status(thm)],[rqLessOrEqual__r1_xxreal_0__r7_r3])).
cnf(c_0_29, plain, (X1=X2|X1=X3|X1=X4|X2=X3|X2=X4|X3=X4|k4_card_1(k2_enumset1(X1,X2,X3,X4))=np__4), inference(split_conjunct,[status(thm)],[c_0_19])).
cnf(c_0_30, plain, (k2_enumset1(np__2,np__3,np__5,np__7)=k8_number14(k5_numbers,np__10)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22]), c_0_23]), c_0_24]), c_0_25])]), c_0_26])).
cnf(c_0_31, negated_conjecture, (k4_card_1(k8_number14(k5_numbers,np__10))!=np__4), inference(split_conjunct,[status(thm)],[c_0_27])).
fof(c_0_32, plain, ~r1_xxreal_0(np__7,np__5), inference(fof_simplification,[status(thm)],[rqLessOrEqual__r1_xxreal_0__r7_r5])).
cnf(c_0_33, plain, (~r1_xxreal_0(np__7,np__3)), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_34, plain, (np__2=np__3|np__2=np__5|np__7=np__2|np__5=np__3|np__7=np__3|np__7=np__5), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31])).
cnf(c_0_35, plain, (r1_xxreal_0(np__2,np__3)), inference(split_conjunct,[status(thm)],[rqLessOrEqual__r1_xxreal_0__r2_r3])).
cnf(c_0_36, plain, (~r1_xxreal_0(np__7,np__5)), inference(split_conjunct,[status(thm)],[c_0_32])).
cnf(c_0_37, plain, (np__7=np__5|np__7=np__3|np__5=np__3|np__2=np__5|np__2=np__3), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35])])).
cnf(c_0_38, plain, (r1_xxreal_0(np__5,np__5)), inference(split_conjunct,[status(thm)],[rqLessOrEqual__r1_xxreal_0__r5_r5])).
cnf(c_0_39, plain, (np__2=np__3|np__2=np__5|np__5=np__3|np__7=np__3), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_38])])).
cnf(c_0_40, plain, (r1_xxreal_0(np__3,np__3)), inference(split_conjunct,[status(thm)],[rqLessOrEqual__r1_xxreal_0__r3_r3])).
fof(c_0_41, plain, ~r1_xxreal_0(np__5,np__3), inference(fof_simplification,[status(thm)],[rqLessOrEqual__r1_xxreal_0__r5_r3])).
fof(c_0_42, plain, ~r1_xxreal_0(np__3,np__2), inference(fof_simplification,[status(thm)],[rqLessOrEqual__r1_xxreal_0__r3_r2])).
cnf(c_0_43, plain, (np__5=np__3|np__2=np__5|np__2=np__3), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_39]), c_0_40])])).
cnf(c_0_44, plain, (~r1_xxreal_0(np__5,np__3)), inference(split_conjunct,[status(thm)],[c_0_41])).
cnf(c_0_45, plain, (~r1_xxreal_0(np__3,np__2)), inference(split_conjunct,[status(thm)],[c_0_42])).
cnf(c_0_46, plain, (np__2=np__3|np__5=np__3), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_43]), c_0_44])).
cnf(c_0_47, plain, (np__5=np__3), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_40])])).
cnf(c_0_48, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44, c_0_47]), c_0_40])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 49
# Proof object clause steps            : 24
# Proof object formula steps           : 25
# Proof object conjectures             : 3
# Proof object clause conjectures      : 1
# Proof object formula conjectures     : 2
# Proof object initial clauses used    : 16
# Proof object initial formulas used   : 16
# Proof object generating inferences   : 7
# Proof object simplifying inferences  : 19
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 17
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 22
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 22
# Processed clauses                    : 51
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 51
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 4
# Backward-rewritten                   : 8
# Generated clauses                    : 36
# ...of the previous two non-trivial   : 23
# Contextual simplify-reflections      : 0
# Paramodulations                      : 32
# Factorizations                       : 4
# NegExts                              : 0
# Equation resolutions                 : 0
# Propositional unsat checks           : 0
#    Propositional check models        : 0
#    Propositional check unsatisfiable : 0
#    Propositional clauses             : 0
#    Propositional clauses after purity: 0
#    Propositional unsat core size     : 0
#    Propositional preprocessing time  : 0.000
#    Propositional encoding time       : 0.000
#    Propositional solver time         : 0.000
#    Success case prop preproc time    : 0.000
#    Success case prop encoding time   : 0.000
#    Success case prop solver time     : 0.000
# Current number of processed clauses  : 17
#    Positive orientable unit clauses  : 11
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 4
#    Non-unit-clauses                  : 2
# Current number of unprocessed clauses: 5
# ...number of literals in the above   : 13
# Current number of archived formulas  : 0
# Current number of archived clauses   : 34
# Clause-clause subsumption calls (NU) : 4
# Rec. Clause-clause subsumption calls : 4
# Non-unit clause-clause subsumptions  : 4
# Unit Clause-clause subsumption calls : 6
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 1
# BW rewrite match successes           : 1
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 1263

# -------------------------------------------------
# User time                : 0.016 s
# System time              : 0.006 s
# Total time               : 0.022 s
# Maximum resident set size: 3572 pages
