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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t26_newton06, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:((v1_int_1(X2)&~(v1_abian(X2)))=>(~(r1_int_1(X2,X1))=>(~(v1_abian(k5_int_1(X1,X2)))<=>v1_abian(k5_int_1(k4_xcmplx_0(X1),X2)))))), file('newton06/newton06__t26_newton06', t26_newton06)).
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__t26_newton06', dt_k5_int_1)).
fof(fc3_int_1, axiom, ![X1]:(v1_int_1(X1)=>(v1_xcmplx_0(k4_xcmplx_0(X1))&v1_int_1(k4_xcmplx_0(X1)))), file('newton06/newton06__t26_newton06', fc3_int_1)).
fof(t22_newton06, axiom, ![X1]:(v1_int_1(X1)=>![X2]:((~(v8_ordinal1(X2))&v1_int_1(X2))=>(~(r1_int_1(X2,X1))<=>k2_xcmplx_0(k5_int_1(X1,X2),k5_int_1(k4_xcmplx_0(X1),X2))=X2))), file('newton06/newton06__t26_newton06', t22_newton06)).
fof(cc2_abian, axiom, ![X1]:((v1_int_1(X1)&~(v1_abian(X1)))=>(~(v8_ordinal1(X1))&v1_int_1(X1))), file('newton06/newton06__t26_newton06', cc2_abian)).
fof(fc12_abian, axiom, ![X1, X2]:((((v1_int_1(X1)&~(v1_abian(X1)))&v1_int_1(X2))&~(v1_abian(X2)))=>v1_abian(k2_xcmplx_0(X1,X2))), file('newton06/newton06__t26_newton06', fc12_abian)).
fof(fc9_abian, axiom, ![X1, X2]:((((v1_int_1(X1)&v1_abian(X1))&v1_int_1(X2))&v1_abian(X2))=>v1_abian(k2_xcmplx_0(X1,X2))), file('newton06/newton06__t26_newton06', fc9_abian)).
fof(c_0_7, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:((v1_int_1(X2)&~v1_abian(X2))=>(~r1_int_1(X2,X1)=>(~v1_abian(k5_int_1(X1,X2))<=>v1_abian(k5_int_1(k4_xcmplx_0(X1),X2))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t26_newton06])])).
fof(c_0_8, plain, ![X18, X19]:(~v1_int_1(X18)|~v1_int_1(X19)|v1_int_1(k5_int_1(X18,X19))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_int_1])])).
fof(c_0_9, negated_conjecture, (v1_int_1(esk1_0)&((v1_int_1(esk2_0)&~v1_abian(esk2_0))&(~r1_int_1(esk2_0,esk1_0)&((v1_abian(k5_int_1(esk1_0,esk2_0))|~v1_abian(k5_int_1(k4_xcmplx_0(esk1_0),esk2_0)))&(~v1_abian(k5_int_1(esk1_0,esk2_0))|v1_abian(k5_int_1(k4_xcmplx_0(esk1_0),esk2_0))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
fof(c_0_10, plain, ![X22]:((v1_xcmplx_0(k4_xcmplx_0(X22))|~v1_int_1(X22))&(v1_int_1(k4_xcmplx_0(X22))|~v1_int_1(X22))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc3_int_1])])])).
fof(c_0_11, plain, ![X1]:(v1_int_1(X1)=>![X2]:((~v8_ordinal1(X2)&v1_int_1(X2))=>(~r1_int_1(X2,X1)<=>k2_xcmplx_0(k5_int_1(X1,X2),k5_int_1(k4_xcmplx_0(X1),X2))=X2))), inference(fof_simplification,[status(thm)],[t22_newton06])).
fof(c_0_12, plain, ![X1]:((v1_int_1(X1)&~v1_abian(X1))=>(~v8_ordinal1(X1)&v1_int_1(X1))), inference(fof_simplification,[status(thm)],[cc2_abian])).
fof(c_0_13, plain, ![X1, X2]:((((v1_int_1(X1)&~v1_abian(X1))&v1_int_1(X2))&~v1_abian(X2))=>v1_abian(k2_xcmplx_0(X1,X2))), inference(fof_simplification,[status(thm)],[fc12_abian])).
cnf(c_0_14, plain, (v1_int_1(k5_int_1(X1,X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_15, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_16, plain, (v1_int_1(k4_xcmplx_0(X1))|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_17, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
fof(c_0_18, plain, ![X25, X26]:((r1_int_1(X26,X25)|k2_xcmplx_0(k5_int_1(X25,X26),k5_int_1(k4_xcmplx_0(X25),X26))=X26|(v8_ordinal1(X26)|~v1_int_1(X26))|~v1_int_1(X25))&(k2_xcmplx_0(k5_int_1(X25,X26),k5_int_1(k4_xcmplx_0(X25),X26))!=X26|~r1_int_1(X26,X25)|(v8_ordinal1(X26)|~v1_int_1(X26))|~v1_int_1(X25))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])).
fof(c_0_19, plain, ![X17]:((~v8_ordinal1(X17)|(~v1_int_1(X17)|v1_abian(X17)))&(v1_int_1(X17)|(~v1_int_1(X17)|v1_abian(X17)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])).
fof(c_0_20, plain, ![X20, X21]:(~v1_int_1(X20)|v1_abian(X20)|~v1_int_1(X21)|v1_abian(X21)|v1_abian(k2_xcmplx_0(X20,X21))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])).
cnf(c_0_21, negated_conjecture, (v1_int_1(k5_int_1(X1,esk2_0))|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
cnf(c_0_22, negated_conjecture, (v1_int_1(k4_xcmplx_0(esk1_0))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
cnf(c_0_23, plain, (r1_int_1(X1,X2)|k2_xcmplx_0(k5_int_1(X2,X1),k5_int_1(k4_xcmplx_0(X2),X1))=X1|v8_ordinal1(X1)|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_24, plain, (v1_abian(X1)|~v8_ordinal1(X1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_19])).
cnf(c_0_25, negated_conjecture, (~v1_abian(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_26, plain, (v1_abian(X1)|v1_abian(X2)|v1_abian(k2_xcmplx_0(X1,X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_27, negated_conjecture, (v1_int_1(k5_int_1(k4_xcmplx_0(esk1_0),esk2_0))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
cnf(c_0_28, negated_conjecture, (k2_xcmplx_0(k5_int_1(esk1_0,X1),k5_int_1(k4_xcmplx_0(esk1_0),X1))=X1|v8_ordinal1(X1)|r1_int_1(X1,esk1_0)|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_23, c_0_17])).
cnf(c_0_29, negated_conjecture, (~v8_ordinal1(esk2_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_15]), c_0_25])).
cnf(c_0_30, negated_conjecture, (~r1_int_1(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
fof(c_0_31, plain, ![X23, X24]:(~v1_int_1(X23)|~v1_abian(X23)|~v1_int_1(X24)|~v1_abian(X24)|v1_abian(k2_xcmplx_0(X23,X24))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc9_abian])])).
cnf(c_0_32, negated_conjecture, (v1_abian(k2_xcmplx_0(X1,k5_int_1(k4_xcmplx_0(esk1_0),esk2_0)))|v1_abian(k5_int_1(k4_xcmplx_0(esk1_0),esk2_0))|v1_abian(X1)|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
cnf(c_0_33, negated_conjecture, (v1_int_1(k5_int_1(esk1_0,esk2_0))), inference(spm,[status(thm)],[c_0_21, c_0_17])).
cnf(c_0_34, negated_conjecture, (k2_xcmplx_0(k5_int_1(esk1_0,esk2_0),k5_int_1(k4_xcmplx_0(esk1_0),esk2_0))=esk2_0), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_15]), c_0_29]), c_0_30])).
cnf(c_0_35, negated_conjecture, (v1_abian(k5_int_1(k4_xcmplx_0(esk1_0),esk2_0))|~v1_abian(k5_int_1(esk1_0,esk2_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_36, plain, (v1_abian(k2_xcmplx_0(X1,X2))|~v1_int_1(X1)|~v1_abian(X1)|~v1_int_1(X2)|~v1_abian(X2)), inference(split_conjunct,[status(thm)],[c_0_31])).
cnf(c_0_37, negated_conjecture, (v1_abian(k5_int_1(k4_xcmplx_0(esk1_0),esk2_0))), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_34]), c_0_25]), c_0_35])).
cnf(c_0_38, negated_conjecture, (v1_abian(k5_int_1(esk1_0,esk2_0))|~v1_abian(k5_int_1(k4_xcmplx_0(esk1_0),esk2_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_39, negated_conjecture, (v1_abian(k2_xcmplx_0(X1,k5_int_1(k4_xcmplx_0(esk1_0),esk2_0)))|~v1_abian(X1)|~v1_int_1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_27])])).
cnf(c_0_40, negated_conjecture, (v1_abian(k5_int_1(esk1_0,esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38, c_0_37])])).
cnf(c_0_41, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_40]), c_0_34]), c_0_33])]), c_0_25]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 42
# Proof object clause steps            : 24
# Proof object formula steps           : 18
# Proof object conjectures             : 21
# Proof object clause conjectures      : 18
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 12
# Proof object initial formulas used   : 7
# Proof object generating inferences   : 11
# Proof object simplifying inferences  : 14
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 7
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 15
# Removed in clause preprocessing      : 1
# Initial clauses in saturation        : 14
# Processed clauses                    : 1990
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 1989
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 33
# Generated clauses                    : 159412
# ...of the previous two non-trivial   : 159404
# Contextual simplify-reflections      : 1
# Paramodulations                      : 159412
# 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  : 1942
#    Positive orientable unit clauses  : 903
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 1036
# Current number of unprocessed clauses: 156901
# ...number of literals in the above   : 574690
# Current number of archived formulas  : 0
# Current number of archived clauses   : 47
# Clause-clause subsumption calls (NU) : 119678
# Rec. Clause-clause subsumption calls : 51560
# Non-unit clause-clause subsumptions  : 1
# Unit Clause-clause subsumption calls : 19592
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 34135
# BW rewrite match successes           : 2
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 6512128

# -------------------------------------------------
# User time                : 2.041 s
# System time              : 0.114 s
# Total time               : 2.155 s
# Maximum resident set size: 3020 pages
