# 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(t27_newton06, conjecture, ![X1]:((~(v8_ordinal1(X1))&v1_int_1(X1))=>![X2]:(v1_int_1(X2)=>(r1_int_1(X1,X2)<=>r1_int_1(X1,k5_int_1(X2,X1))))), file('newton06/newton06__t27_newton06', t27_newton06)).
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__t27_newton06', t6_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__t27_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__t27_newton06', rd5_newton02)).
fof(c_0_4, negated_conjecture, ~(![X1]:((~v8_ordinal1(X1)&v1_int_1(X1))=>![X2]:(v1_int_1(X2)=>(r1_int_1(X1,X2)<=>r1_int_1(X1,k5_int_1(X2,X1)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t27_newton06])])).
fof(c_0_5, 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_6, negated_conjecture, ((~v8_ordinal1(esk1_0)&v1_int_1(esk1_0))&(v1_int_1(esk2_0)&((~r1_int_1(esk1_0,esk2_0)|~r1_int_1(esk1_0,k5_int_1(esk2_0,esk1_0)))&(r1_int_1(esk1_0,esk2_0)|r1_int_1(esk1_0,k5_int_1(esk2_0,esk1_0)))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
fof(c_0_7, plain, ![X17, X18]:((~r1_int_1(X18,X17)|k5_int_1(X17,X18)=k5_numbers|(v8_ordinal1(X18)|~v1_int_1(X18))|~v1_int_1(X17))&(k5_int_1(X17,X18)!=k5_numbers|r1_int_1(X18,X17)|(v8_ordinal1(X18)|~v1_int_1(X18))|~v1_int_1(X17))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
cnf(c_0_8, negated_conjecture, (~v8_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_9, 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_7])).
cnf(c_0_10, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_11, negated_conjecture, (k5_int_1(X1,esk1_0)=k5_numbers|~r1_int_1(esk1_0,X1)|~v1_int_1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])])).
cnf(c_0_12, negated_conjecture, (r1_int_1(esk1_0,esk2_0)|r1_int_1(esk1_0,k5_int_1(esk2_0,esk1_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_13, negated_conjecture, (k5_int_1(k5_int_1(esk2_0,esk1_0),esk1_0)=k5_numbers|r1_int_1(esk1_0,esk2_0)|~v1_int_1(k5_int_1(esk2_0,esk1_0))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
cnf(c_0_14, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
fof(c_0_15, plain, ![X13, X14]:(~v1_int_1(X13)|~v1_int_1(X14)|v1_int_1(k5_int_1(X13,X14))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_int_1])])).
fof(c_0_16, plain, ![X15, X16]:(~v1_int_1(X15)|~v1_int_1(X16)|k5_int_1(k5_int_1(X15,X16),X16)=k5_int_1(X15,X16)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rd5_newton02])])).
cnf(c_0_17, negated_conjecture, (k5_int_1(k5_int_1(esk2_0,esk1_0),esk1_0)=k5_numbers|k5_int_1(esk2_0,esk1_0)=k5_numbers|~v1_int_1(k5_int_1(esk2_0,esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_13]), c_0_14])])).
cnf(c_0_18, 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])).
cnf(c_0_19, 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_16])).
cnf(c_0_20, negated_conjecture, (k5_int_1(k5_int_1(esk2_0,esk1_0),esk1_0)=k5_numbers|k5_int_1(esk2_0,esk1_0)=k5_numbers), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_10]), c_0_14])])).
cnf(c_0_21, negated_conjecture, (~r1_int_1(esk1_0,esk2_0)|~r1_int_1(esk1_0,k5_int_1(esk2_0,esk1_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_22, negated_conjecture, (k5_int_1(esk2_0,esk1_0)=k5_numbers), 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_14])])).
cnf(c_0_23, plain, (r1_int_1(X2,X1)|v8_ordinal1(X2)|k5_int_1(X1,X2)!=k5_numbers|~v1_int_1(X2)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_24, negated_conjecture, (~r1_int_1(esk1_0,k5_numbers)|~r1_int_1(esk1_0,esk2_0)), inference(rw,[status(thm)],[c_0_21, c_0_22])).
cnf(c_0_25, negated_conjecture, (r1_int_1(esk1_0,X1)|k5_int_1(X1,esk1_0)!=k5_numbers|~v1_int_1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_23]), c_0_10])])).
cnf(c_0_26, negated_conjecture, (v1_int_1(k5_numbers)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_22]), c_0_10]), c_0_14])])).
cnf(c_0_27, negated_conjecture, (k5_int_1(k5_numbers,esk1_0)!=k5_numbers|~r1_int_1(esk1_0,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26])])).
cnf(c_0_28, negated_conjecture, (k5_int_1(k5_numbers,esk1_0)=k5_numbers), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_22]), c_0_10]), c_0_14])])).
cnf(c_0_29, negated_conjecture, (~r1_int_1(esk1_0,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_28])])).
cnf(c_0_30, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_25]), c_0_22]), c_0_14])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 31
# Proof object clause steps            : 21
# Proof object formula steps           : 10
# Proof object conjectures             : 20
# Proof object clause conjectures      : 17
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 9
# Proof object initial formulas used   : 4
# Proof object generating inferences   : 10
# Proof object simplifying inferences  : 26
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 5
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 10
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 10
# Processed clauses                    : 34
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 33
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 7
# Generated clauses                    : 23
# ...of the previous two non-trivial   : 23
# Contextual simplify-reflections      : 0
# Paramodulations                      : 23
# 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  : 15
#    Positive orientable unit clauses  : 6
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 7
# Current number of unprocessed clauses: 9
# ...number of literals in the above   : 23
# Current number of archived formulas  : 0
# Current number of archived clauses   : 18
# Clause-clause subsumption calls (NU) : 7
# Rec. Clause-clause subsumption calls : 7
# Non-unit clause-clause subsumptions  : 2
# Unit Clause-clause subsumption calls : 1
# 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          : 1080

# -------------------------------------------------
# User time                : 0.026 s
# System time              : 0.000 s
# Total time               : 0.026 s
# Maximum resident set size: 3076 pages
