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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t24_nat_d, axiom, ![X1]:(v7_ordinal1(X1)=>![X2]:(v7_ordinal1(X2)=>(~(r1_xxreal_0(X2,X1))=>k2_nat_d(X1,X2)=X1))), file('number14/number14__l5_number14', t24_nat_d)).
fof(cc8_ordinal1, axiom, ![X1]:(m1_subset_1(X1,k4_ordinal1)=>v7_ordinal1(X1)), file('number14/number14__l5_number14', cc8_ordinal1)).
fof(spc3_numerals, axiom, (v2_xxreal_0(np__3)&m1_subset_1(np__3,k4_ordinal1)), file('number14/number14__l5_number14', spc3_numerals)).
fof(spc1_numerals, axiom, (v2_xxreal_0(np__1)&m1_subset_1(np__1,k4_ordinal1)), file('number14/number14__l5_number14', spc1_numerals)).
fof(rqLessOrEqual__r1_xxreal_0__r3_r1, axiom, ~(r1_xxreal_0(np__3,np__1)), file('number14/number14__l5_number14', rqLessOrEqual__r1_xxreal_0__r3_r1)).
fof(redefinition_k2_nat_d, axiom, ![X1, X2]:((v7_ordinal1(X1)&v7_ordinal1(X2))=>k2_nat_d(X1,X2)=k5_int_1(X1,X2)), file('number14/number14__l5_number14', redefinition_k2_nat_d)).
fof(l5_number14, conjecture, k5_int_1(np__1,np__3)=np__1, file('number14/number14__l5_number14', l5_number14)).
fof(c_0_7, plain, ![X1]:(v7_ordinal1(X1)=>![X2]:(v7_ordinal1(X2)=>(~r1_xxreal_0(X2,X1)=>k2_nat_d(X1,X2)=X1))), inference(fof_simplification,[status(thm)],[t24_nat_d])).
fof(c_0_8, plain, ![X8]:(~m1_subset_1(X8,k4_ordinal1)|v7_ordinal1(X8)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
fof(c_0_9, plain, ![X11, X12]:(~v7_ordinal1(X11)|(~v7_ordinal1(X12)|(r1_xxreal_0(X12,X11)|k2_nat_d(X11,X12)=X11))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
cnf(c_0_10, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_11, plain, (m1_subset_1(np__3,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc3_numerals])).
cnf(c_0_12, plain, (r1_xxreal_0(X2,X1)|k2_nat_d(X1,X2)=X1|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_13, plain, (v7_ordinal1(np__3)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
cnf(c_0_14, plain, (m1_subset_1(np__1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc1_numerals])).
fof(c_0_15, plain, ~r1_xxreal_0(np__3,np__1), inference(fof_simplification,[status(thm)],[rqLessOrEqual__r1_xxreal_0__r3_r1])).
fof(c_0_16, plain, ![X9, X10]:(~v7_ordinal1(X9)|~v7_ordinal1(X10)|k2_nat_d(X9,X10)=k5_int_1(X9,X10)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k2_nat_d])])).
cnf(c_0_17, plain, (k2_nat_d(X1,np__3)=X1|r1_xxreal_0(np__3,X1)|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
cnf(c_0_18, plain, (v7_ordinal1(np__1)), inference(spm,[status(thm)],[c_0_10, c_0_14])).
cnf(c_0_19, plain, (~r1_xxreal_0(np__3,np__1)), inference(split_conjunct,[status(thm)],[c_0_15])).
fof(c_0_20, negated_conjecture, k5_int_1(np__1,np__3)!=np__1, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l5_number14])])).
cnf(c_0_21, plain, (k2_nat_d(X1,X2)=k5_int_1(X1,X2)|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_22, plain, (k2_nat_d(np__1,np__3)=np__1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])).
cnf(c_0_23, negated_conjecture, (k5_int_1(np__1,np__3)!=np__1), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_24, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_13]), c_0_18])]), c_0_23]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 25
# Proof object clause steps            : 12
# Proof object formula steps           : 13
# Proof object conjectures             : 3
# Proof object clause conjectures      : 1
# Proof object formula conjectures     : 2
# Proof object initial clauses used    : 7
# Proof object initial formulas used   : 7
# Proof object generating inferences   : 5
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 7
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 9
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 9
# Processed clauses                    : 22
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 22
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 7
# ...of the previous two non-trivial   : 6
# Contextual simplify-reflections      : 0
# Paramodulations                      : 7
# Factorizations                       : 0
# 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  : 13
#    Positive orientable unit clauses  : 7
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 4
# Current number of unprocessed clauses: 2
# ...number of literals in the above   : 5
# Current number of archived formulas  : 0
# Current number of archived clauses   : 9
# Clause-clause subsumption calls (NU) : 8
# Rec. Clause-clause subsumption calls : 4
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 0
# BW rewrite match successes           : 0
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 572

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.002 s
# Total time               : 0.023 s
# Maximum resident set size: 3032 pages
