# 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.021 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t80_newton06, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>![X3]:(v7_ordinal1(X3)=>k5_int_1(k1_newton(X1,X3),X2)=k5_int_1(k1_newton(k5_int_1(X1,X2),X3),X2)))), file('newton06/newton06__t80_newton06', t80_newton06)).
fof(t13_int_5, axiom, ![X1]:(v7_ordinal1(X1)=>![X2]:(v1_int_1(X2)=>![X3]:(v1_int_1(X3)=>![X4]:(v1_int_1(X4)=>(k5_int_1(X2,X4)=k5_int_1(X3,X4)=>k5_int_1(k1_newton(X2,X1),X4)=k5_int_1(k1_newton(X3,X1),X4)))))), file('newton06/newton06__t80_newton06', t13_int_5)).
fof(dt_k5_int_1, axiom, ![X1, X2]:((v1_int_1(X1)&v1_int_1(X2))=>v1_int_1(k5_int_1(X1,X2))), file('newton06/newton06__t80_newton06', dt_k5_int_1)).
fof(rd5_newton02, axiom, ![X1, X2]:((v1_int_1(X1)&v1_int_1(X2))=>k5_int_1(k5_int_1(X1,X2),X2)=k5_int_1(X1,X2)), file('newton06/newton06__t80_newton06', rd5_newton02)).
fof(c_0_4, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>![X3]:(v7_ordinal1(X3)=>k5_int_1(k1_newton(X1,X3),X2)=k5_int_1(k1_newton(k5_int_1(X1,X2),X3),X2))))), inference(assume_negation,[status(cth)],[t80_newton06])).
fof(c_0_5, plain, ![X23, X24, X25, X26]:(~v7_ordinal1(X23)|(~v1_int_1(X24)|(~v1_int_1(X25)|(~v1_int_1(X26)|(k5_int_1(X24,X26)!=k5_int_1(X25,X26)|k5_int_1(k1_newton(X24,X23),X26)=k5_int_1(k1_newton(X25,X23),X26)))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t13_int_5])])])).
fof(c_0_6, negated_conjecture, (v1_int_1(esk1_0)&(v1_int_1(esk2_0)&(v7_ordinal1(esk3_0)&k5_int_1(k1_newton(esk1_0,esk3_0),esk2_0)!=k5_int_1(k1_newton(k5_int_1(esk1_0,esk2_0),esk3_0),esk2_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
cnf(c_0_7, plain, (k5_int_1(k1_newton(X2,X1),X4)=k5_int_1(k1_newton(X3,X1),X4)|~v7_ordinal1(X1)|~v1_int_1(X2)|~v1_int_1(X3)|~v1_int_1(X4)|k5_int_1(X2,X4)!=k5_int_1(X3,X4)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_8, negated_conjecture, (v7_ordinal1(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_9, negated_conjecture, (k5_int_1(k1_newton(X1,esk3_0),X2)=k5_int_1(k1_newton(X3,esk3_0),X2)|k5_int_1(X1,X2)!=k5_int_1(X3,X2)|~v1_int_1(X2)|~v1_int_1(X3)|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_7, c_0_8])).
cnf(c_0_10, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_11, negated_conjecture, (k5_int_1(k1_newton(X1,esk3_0),esk2_0)=k5_int_1(k1_newton(X2,esk3_0),esk2_0)|k5_int_1(X1,esk2_0)!=k5_int_1(X2,esk2_0)|~v1_int_1(X2)|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_9, c_0_10])).
cnf(c_0_12, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_13, negated_conjecture, (k5_int_1(k1_newton(esk1_0,esk3_0),esk2_0)!=k5_int_1(k1_newton(k5_int_1(esk1_0,esk2_0),esk3_0),esk2_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_14, negated_conjecture, (k5_int_1(k1_newton(X1,esk3_0),esk2_0)=k5_int_1(k1_newton(esk1_0,esk3_0),esk2_0)|k5_int_1(X1,esk2_0)!=k5_int_1(esk1_0,esk2_0)|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
fof(c_0_15, plain, ![X19, X20]:(~v1_int_1(X19)|~v1_int_1(X20)|v1_int_1(k5_int_1(X19,X20))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_int_1])])).
cnf(c_0_16, negated_conjecture, (k5_int_1(k5_int_1(esk1_0,esk2_0),esk2_0)!=k5_int_1(esk1_0,esk2_0)|~v1_int_1(k5_int_1(esk1_0,esk2_0))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
cnf(c_0_17, plain, (v1_int_1(k5_int_1(X1,X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_15])).
fof(c_0_18, plain, ![X21, X22]:(~v1_int_1(X21)|~v1_int_1(X22)|k5_int_1(k5_int_1(X21,X22),X22)=k5_int_1(X21,X22)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rd5_newton02])])).
cnf(c_0_19, negated_conjecture, (k5_int_1(k5_int_1(esk1_0,esk2_0),esk2_0)!=k5_int_1(esk1_0,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_10]), c_0_12])])).
cnf(c_0_20, plain, (k5_int_1(k5_int_1(X1,X2),X2)=k5_int_1(X1,X2)|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_21, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_10]), c_0_12])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 22
# Proof object clause steps            : 13
# Proof object formula steps           : 9
# Proof object conjectures             : 13
# Proof object clause conjectures      : 10
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 7
# Proof object initial formulas used   : 4
# Proof object generating inferences   : 6
# Proof object simplifying inferences  : 6
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 4
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 7
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 7
# Processed clauses                    : 31
# ...of these trivial                  : 0
# ...subsumed                          : 2
# ...remaining for further processing  : 29
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 0
# Generated clauses                    : 44
# ...of the previous two non-trivial   : 42
# Contextual simplify-reflections      : 0
# Paramodulations                      : 44
# 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  : 21
#    Positive orientable unit clauses  : 3
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 15
# Current number of unprocessed clauses: 25
# ...number of literals in the above   : 109
# Current number of archived formulas  : 0
# Current number of archived clauses   : 8
# Clause-clause subsumption calls (NU) : 39
# Rec. Clause-clause subsumption calls : 22
# Non-unit clause-clause subsumptions  : 3
# Unit Clause-clause subsumption calls : 7
# 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          : 1741

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.004 s
# Total time               : 0.025 s
# Maximum resident set size: 2892 pages
