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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t75_newton06, conjecture, ![X1]:(v1_int_1(X1)=>(v1_zfmisc_1(k5_int_1(k1_newton(X1,np__4),np__8))&v7_ordinal1(k5_int_1(k1_newton(X1,np__4),np__8)))), file('newton06/newton06__t75_newton06', t75_newton06)).
fof(d1_nat_2, axiom, ![X1]:(v7_ordinal1(X1)=>(v1_zfmisc_1(X1)<=>(X1=k5_numbers|X1=np__1))), file('newton06/newton06__t75_newton06', d1_nat_2)).
fof(fc8_ordinal1, axiom, v7_ordinal1(k5_ordinal1), file('newton06/newton06__t75_newton06', fc8_ordinal1)).
fof(redefinition_k5_numbers, axiom, k5_numbers=k5_ordinal1, file('newton06/newton06__t75_newton06', redefinition_k5_numbers)).
fof(cc8_ordinal1, axiom, ![X1]:(m1_subset_1(X1,k4_ordinal1)=>v7_ordinal1(X1)), file('newton06/newton06__t75_newton06', cc8_ordinal1)).
fof(t60_newton06, axiom, ![X1]:(v1_int_1(X1)=>(k5_int_1(k1_newton(X1,np__4),np__8)=k5_numbers|k5_int_1(k1_newton(X1,np__4),np__8)=np__1)), file('newton06/newton06__t75_newton06', t60_newton06)).
fof(spc1_numerals, axiom, (v2_xxreal_0(np__1)&m1_subset_1(np__1,k4_ordinal1)), file('newton06/newton06__t75_newton06', spc1_numerals)).
fof(c_0_7, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>(v1_zfmisc_1(k5_int_1(k1_newton(X1,np__4),np__8))&v7_ordinal1(k5_int_1(k1_newton(X1,np__4),np__8))))), inference(assume_negation,[status(cth)],[t75_newton06])).
fof(c_0_8, plain, ![X21]:((~v1_zfmisc_1(X21)|(X21=k5_numbers|X21=np__1)|~v7_ordinal1(X21))&((X21!=k5_numbers|v1_zfmisc_1(X21)|~v7_ordinal1(X21))&(X21!=np__1|v1_zfmisc_1(X21)|~v7_ordinal1(X21)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_nat_2])])])).
cnf(c_0_9, plain, (v7_ordinal1(k5_ordinal1)), inference(split_conjunct,[status(thm)],[fc8_ordinal1])).
cnf(c_0_10, plain, (k5_numbers=k5_ordinal1), inference(split_conjunct,[status(thm)],[redefinition_k5_numbers])).
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])])).
fof(c_0_12, negated_conjecture, (v1_int_1(esk1_0)&(~v1_zfmisc_1(k5_int_1(k1_newton(esk1_0,np__4),np__8))|~v7_ordinal1(k5_int_1(k1_newton(esk1_0,np__4),np__8)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
fof(c_0_13, plain, ![X30]:(~v1_int_1(X30)|(k5_int_1(k1_newton(X30,np__4),np__8)=k5_numbers|k5_int_1(k1_newton(X30,np__4),np__8)=np__1)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t60_newton06])])).
cnf(c_0_14, plain, (v1_zfmisc_1(X1)|X1!=k5_numbers|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_15, plain, (v7_ordinal1(k5_numbers)), inference(rw,[status(thm)],[c_0_9, c_0_10])).
cnf(c_0_16, plain, (v1_zfmisc_1(X1)|X1!=np__1|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_17, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_18, plain, (m1_subset_1(np__1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc1_numerals])).
cnf(c_0_19, negated_conjecture, (~v1_zfmisc_1(k5_int_1(k1_newton(esk1_0,np__4),np__8))|~v7_ordinal1(k5_int_1(k1_newton(esk1_0,np__4),np__8))), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_20, plain, (k5_int_1(k1_newton(X1,np__4),np__8)=k5_numbers|k5_int_1(k1_newton(X1,np__4),np__8)=np__1|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_21, plain, (v1_zfmisc_1(k5_numbers)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_14]), c_0_15])])).
cnf(c_0_22, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_23, plain, (v1_zfmisc_1(np__1)|~v7_ordinal1(np__1)), inference(er,[status(thm)],[c_0_16])).
cnf(c_0_24, plain, (v7_ordinal1(np__1)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
cnf(c_0_25, negated_conjecture, (k5_int_1(k1_newton(esk1_0,np__4),np__8)=np__1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_15]), c_0_21]), c_0_22])])).
cnf(c_0_26, plain, (v1_zfmisc_1(np__1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_24])])).
cnf(c_0_27, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_25]), c_0_24]), c_0_25]), c_0_26])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 28
# Proof object clause steps            : 16
# Proof object formula steps           : 12
# Proof object conjectures             : 7
# Proof object clause conjectures      : 4
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 9
# Proof object initial formulas used   : 7
# Proof object generating inferences   : 2
# Proof object simplifying inferences  : 16
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 18
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 27
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 27
# Processed clauses                    : 68
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 68
# Other redundant clauses eliminated   : 2
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 3
# Generated clauses                    : 52
# ...of the previous two non-trivial   : 42
# Contextual simplify-reflections      : 0
# Paramodulations                      : 47
# Factorizations                       : 3
# NegExts                              : 0
# Equation resolutions                 : 2
# 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  : 36
#    Positive orientable unit clauses  : 20
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 0
#    Non-unit-clauses                  : 16
# Current number of unprocessed clauses: 28
# ...number of literals in the above   : 118
# Current number of archived formulas  : 0
# Current number of archived clauses   : 30
# Clause-clause subsumption calls (NU) : 169
# Rec. Clause-clause subsumption calls : 138
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 17
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 3
# BW rewrite match successes           : 3
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 2273

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.006 s
# Total time               : 0.027 s
# Maximum resident set size: 3572 pages
