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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(cc4_nat_1, axiom, ![X1]:((v7_ordinal1(X1)&v8_ordinal1(X1))=>(v7_ordinal1(X1)&~(v2_xxreal_0(X1)))), file('newton06/newton06__t62_newton06', cc4_nat_1)).
fof(cc8_ordinal1, axiom, ![X1]:(m1_subset_1(X1,k4_ordinal1)=>v7_ordinal1(X1)), file('newton06/newton06__t62_newton06', cc8_ordinal1)).
fof(spc4_numerals, axiom, (v2_xxreal_0(np__4)&m1_subset_1(np__4,k4_ordinal1)), file('newton06/newton06__t62_newton06', spc4_numerals)).
fof(t6_newton06, axiom, ![X1]:(v1_int_1(X1)=>![X2]:((~(v8_ordinal1(X2))&v1_int_1(X2))=>(r1_int_1(X2,X1)<=>k5_int_1(X1,X2)=k5_numbers))), file('newton06/newton06__t62_newton06', t6_newton06)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('newton06/newton06__t62_newton06', cc2_int_1)).
fof(t73_newton03, axiom, ![X1]:((v1_int_1(X1)&~(v1_abian(X1)))=>![X2]:((v1_int_1(X2)&~(v1_abian(X2)))=>(r1_int_1(np__4,k6_xcmplx_0(X1,X2))<=>~(r1_int_1(np__4,k2_xcmplx_0(X1,X2)))))), file('newton06/newton06__t62_newton06', t73_newton03)).
fof(fc4_int_1, axiom, ![X1, X2]:((v1_int_1(X1)&v1_int_1(X2))=>v1_int_1(k6_xcmplx_0(X1,X2))), file('newton06/newton06__t62_newton06', fc4_int_1)).
fof(fc1_int_1, axiom, ![X1, X2]:((v1_int_1(X1)&v1_int_1(X2))=>v1_int_1(k2_xcmplx_0(X1,X2))), file('newton06/newton06__t62_newton06', fc1_int_1)).
fof(t62_newton06, conjecture, ![X1]:((v1_int_1(X1)&~(v1_abian(X1)))=>![X2]:((v1_int_1(X2)&~(v1_abian(X2)))=>(k5_int_1(k2_xcmplx_0(X1,X2),np__4)=k5_numbers|k5_int_1(k6_xcmplx_0(X1,X2),np__4)=k5_numbers))), file('newton06/newton06__t62_newton06', t62_newton06)).
fof(c_0_9, plain, ![X1]:((v7_ordinal1(X1)&v8_ordinal1(X1))=>(v7_ordinal1(X1)&~v2_xxreal_0(X1))), inference(fof_simplification,[status(thm)],[cc4_nat_1])).
fof(c_0_10, plain, ![X19]:((v7_ordinal1(X19)|(~v7_ordinal1(X19)|~v8_ordinal1(X19)))&(~v2_xxreal_0(X19)|(~v7_ordinal1(X19)|~v8_ordinal1(X19)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
fof(c_0_11, plain, ![X20]:(~m1_subset_1(X20,k4_ordinal1)|v7_ordinal1(X20)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
cnf(c_0_12, plain, (~v2_xxreal_0(X1)|~v7_ordinal1(X1)|~v8_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_13, plain, (v2_xxreal_0(np__4)), inference(split_conjunct,[status(thm)],[spc4_numerals])).
cnf(c_0_14, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_15, plain, (m1_subset_1(np__4,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc4_numerals])).
fof(c_0_16, plain, ![X1]:(v1_int_1(X1)=>![X2]:((~v8_ordinal1(X2)&v1_int_1(X2))=>(r1_int_1(X2,X1)<=>k5_int_1(X1,X2)=k5_numbers))), inference(fof_simplification,[status(thm)],[t6_newton06])).
fof(c_0_17, plain, ![X18]:(~v7_ordinal1(X18)|v1_int_1(X18)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_int_1])])).
cnf(c_0_18, plain, (~v8_ordinal1(np__4)|~v7_ordinal1(np__4)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
cnf(c_0_19, plain, (v7_ordinal1(np__4)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
fof(c_0_20, plain, ![X25, X26]:((~r1_int_1(X26,X25)|k5_int_1(X25,X26)=k5_numbers|(v8_ordinal1(X26)|~v1_int_1(X26))|~v1_int_1(X25))&(k5_int_1(X25,X26)!=k5_numbers|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_16])])])])).
cnf(c_0_21, plain, (v1_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_17])).
fof(c_0_22, plain, ![X1]:((v1_int_1(X1)&~v1_abian(X1))=>![X2]:((v1_int_1(X2)&~v1_abian(X2))=>(r1_int_1(np__4,k6_xcmplx_0(X1,X2))<=>~r1_int_1(np__4,k2_xcmplx_0(X1,X2))))), inference(fof_simplification,[status(thm)],[t73_newton03])).
cnf(c_0_23, plain, (~v8_ordinal1(np__4)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19])])).
cnf(c_0_24, plain, (k5_int_1(X2,X1)=k5_numbers|v8_ordinal1(X1)|~r1_int_1(X1,X2)|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_25, plain, (v1_int_1(np__4)), inference(spm,[status(thm)],[c_0_21, c_0_19])).
fof(c_0_26, plain, ![X27, X28]:((~r1_int_1(np__4,k6_xcmplx_0(X27,X28))|~r1_int_1(np__4,k2_xcmplx_0(X27,X28))|(~v1_int_1(X28)|v1_abian(X28))|(~v1_int_1(X27)|v1_abian(X27)))&(r1_int_1(np__4,k2_xcmplx_0(X27,X28))|r1_int_1(np__4,k6_xcmplx_0(X27,X28))|(~v1_int_1(X28)|v1_abian(X28))|(~v1_int_1(X27)|v1_abian(X27)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])])).
fof(c_0_27, plain, ![X23, X24]:(~v1_int_1(X23)|~v1_int_1(X24)|v1_int_1(k6_xcmplx_0(X23,X24))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc4_int_1])])).
cnf(c_0_28, plain, (k5_int_1(X1,np__4)=k5_numbers|~r1_int_1(np__4,X1)|~v1_int_1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])])).
cnf(c_0_29, plain, (r1_int_1(np__4,k2_xcmplx_0(X1,X2))|r1_int_1(np__4,k6_xcmplx_0(X1,X2))|v1_abian(X2)|v1_abian(X1)|~v1_int_1(X2)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_30, plain, (v1_int_1(k6_xcmplx_0(X1,X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_27])).
fof(c_0_31, plain, ![X21, X22]:(~v1_int_1(X21)|~v1_int_1(X22)|v1_int_1(k2_xcmplx_0(X21,X22))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_int_1])])).
fof(c_0_32, negated_conjecture, ~(![X1]:((v1_int_1(X1)&~v1_abian(X1))=>![X2]:((v1_int_1(X2)&~v1_abian(X2))=>(k5_int_1(k2_xcmplx_0(X1,X2),np__4)=k5_numbers|k5_int_1(k6_xcmplx_0(X1,X2),np__4)=k5_numbers)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t62_newton06])])).
cnf(c_0_33, plain, (k5_int_1(k6_xcmplx_0(X1,X2),np__4)=k5_numbers|r1_int_1(np__4,k2_xcmplx_0(X1,X2))|v1_abian(X1)|v1_abian(X2)|~v1_int_1(X2)|~v1_int_1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30])).
cnf(c_0_34, plain, (v1_int_1(k2_xcmplx_0(X1,X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_31])).
fof(c_0_35, negated_conjecture, ((v1_int_1(esk1_0)&~v1_abian(esk1_0))&((v1_int_1(esk2_0)&~v1_abian(esk2_0))&(k5_int_1(k2_xcmplx_0(esk1_0,esk2_0),np__4)!=k5_numbers&k5_int_1(k6_xcmplx_0(esk1_0,esk2_0),np__4)!=k5_numbers))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])).
cnf(c_0_36, plain, (k5_int_1(k6_xcmplx_0(X1,X2),np__4)=k5_numbers|k5_int_1(k2_xcmplx_0(X1,X2),np__4)=k5_numbers|v1_abian(X2)|v1_abian(X1)|~v1_int_1(X2)|~v1_int_1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_33]), c_0_34])).
cnf(c_0_37, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_35])).
cnf(c_0_38, negated_conjecture, (~v1_abian(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_35])).
cnf(c_0_39, negated_conjecture, (~v1_abian(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_35])).
cnf(c_0_40, negated_conjecture, (k5_int_1(k2_xcmplx_0(X1,esk2_0),np__4)=k5_numbers|k5_int_1(k6_xcmplx_0(X1,esk2_0),np__4)=k5_numbers|v1_abian(X1)|~v1_int_1(X1)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_38])).
cnf(c_0_41, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_35])).
cnf(c_0_42, negated_conjecture, (k5_int_1(k2_xcmplx_0(esk1_0,esk2_0),np__4)!=k5_numbers), inference(split_conjunct,[status(thm)],[c_0_35])).
cnf(c_0_43, negated_conjecture, (k5_int_1(k6_xcmplx_0(esk1_0,esk2_0),np__4)!=k5_numbers), inference(split_conjunct,[status(thm)],[c_0_35])).
cnf(c_0_44, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_40]), c_0_41])]), c_0_42]), c_0_43]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 45
# Proof object clause steps            : 24
# Proof object formula steps           : 21
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 15
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 8
# Proof object simplifying inferences  : 11
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 10
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 19
# Removed in clause preprocessing      : 1
# Initial clauses in saturation        : 18
# Processed clauses                    : 51
# ...of these trivial                  : 0
# ...subsumed                          : 3
# ...remaining for further processing  : 48
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 26
# ...of the previous two non-trivial   : 25
# Contextual simplify-reflections      : 3
# Paramodulations                      : 20
# Factorizations                       : 6
# 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  : 29
#    Positive orientable unit clauses  : 7
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 5
#    Non-unit-clauses                  : 17
# Current number of unprocessed clauses: 8
# ...number of literals in the above   : 41
# Current number of archived formulas  : 0
# Current number of archived clauses   : 19
# Clause-clause subsumption calls (NU) : 231
# Rec. Clause-clause subsumption calls : 51
# Non-unit clause-clause subsumptions  : 6
# Unit Clause-clause subsumption calls : 4
# 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          : 1972

# -------------------------------------------------
# User time                : 0.025 s
# System time              : 0.002 s
# Total time               : 0.027 s
# Maximum resident set size: 3624 pages
