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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(redefinition_k9_aofa_a00, axiom, ![X1, X2, X3, X4, X5, X6, X7, X8, X9]:(((((((((~(v1_xboole_0(X1))&m1_subset_1(X2,X1))&m1_subset_1(X3,X1))&m1_subset_1(X4,X1))&m1_subset_1(X5,X1))&m1_subset_1(X6,X1))&m1_subset_1(X7,X1))&m1_subset_1(X8,X1))&m1_subset_1(X9,X1))=>k9_aofa_a00(X1,X2,X3,X4,X5,X6,X7,X8,X9)=k8_aofa_a00(X2,X3,X4,X5,X6,X7,X8,X9)), file('newton07/newton07__t98_newton07', redefinition_k9_aofa_a00)).
fof(fc6_ordinal1, axiom, (~(v1_xboole_0(k4_ordinal1))&v3_ordinal1(k4_ordinal1)), file('newton07/newton07__t98_newton07', fc6_ordinal1)).
fof(rd17_aofa_a00, axiom, ![X1, X2, X3, X4, X5, X6, X7, X8]:k1_funct_1(k8_aofa_a00(X1,X2,X3,X4,X5,X6,X7,X8),np__4)=X4, file('newton07/newton07__t98_newton07', rd17_aofa_a00)).
fof(t97_newton07, axiom, k3_newton07(np__7)=k9_aofa_a00(k4_ordinal1,np__1,np__7,np__11,np__13,np__13,np__11,np__7,np__1), file('newton07/newton07__t98_newton07', t97_newton07)).
fof(spc1_numerals, axiom, (v2_xxreal_0(np__1)&m1_subset_1(np__1,k4_ordinal1)), file('newton07/newton07__t98_newton07', spc1_numerals)).
fof(spc7_numerals, axiom, (v2_xxreal_0(np__7)&m1_subset_1(np__7,k4_ordinal1)), file('newton07/newton07__t98_newton07', spc7_numerals)).
fof(spc11_numerals, axiom, (v2_xxreal_0(np__11)&m1_subset_1(np__11,k4_ordinal1)), file('newton07/newton07__t98_newton07', spc11_numerals)).
fof(spc13_numerals, axiom, (v2_xxreal_0(np__13)&m1_subset_1(np__13,k4_ordinal1)), file('newton07/newton07__t98_newton07', spc13_numerals)).
fof(t98_newton07, conjecture, k1_funct_1(k3_newton07(np__7),np__4)=np__13, file('newton07/newton07__t98_newton07', t98_newton07)).
fof(c_0_9, plain, ![X1, X2, X3, X4, X5, X6, X7, X8, X9]:(((((((((~v1_xboole_0(X1)&m1_subset_1(X2,X1))&m1_subset_1(X3,X1))&m1_subset_1(X4,X1))&m1_subset_1(X5,X1))&m1_subset_1(X6,X1))&m1_subset_1(X7,X1))&m1_subset_1(X8,X1))&m1_subset_1(X9,X1))=>k9_aofa_a00(X1,X2,X3,X4,X5,X6,X7,X8,X9)=k8_aofa_a00(X2,X3,X4,X5,X6,X7,X8,X9)), inference(fof_simplification,[status(thm)],[redefinition_k9_aofa_a00])).
fof(c_0_10, plain, ![X35, X36, X37, X38, X39, X40, X41, X42, X43]:(v1_xboole_0(X35)|~m1_subset_1(X36,X35)|~m1_subset_1(X37,X35)|~m1_subset_1(X38,X35)|~m1_subset_1(X39,X35)|~m1_subset_1(X40,X35)|~m1_subset_1(X41,X35)|~m1_subset_1(X42,X35)|~m1_subset_1(X43,X35)|k9_aofa_a00(X35,X36,X37,X38,X39,X40,X41,X42,X43)=k8_aofa_a00(X36,X37,X38,X39,X40,X41,X42,X43)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])).
fof(c_0_11, plain, (~v1_xboole_0(k4_ordinal1)&v3_ordinal1(k4_ordinal1)), inference(fof_simplification,[status(thm)],[fc6_ordinal1])).
fof(c_0_12, plain, ![X27, X28, X29, X30, X31, X32, X33, X34]:k1_funct_1(k8_aofa_a00(X27,X28,X29,X30,X31,X32,X33,X34),np__4)=X30, inference(variable_rename,[status(thm)],[rd17_aofa_a00])).
cnf(c_0_13, plain, (k3_newton07(np__7)=k9_aofa_a00(k4_ordinal1,np__1,np__7,np__11,np__13,np__13,np__11,np__7,np__1)), inference(split_conjunct,[status(thm)],[t97_newton07])).
cnf(c_0_14, plain, (v1_xboole_0(X1)|k9_aofa_a00(X1,X2,X3,X4,X5,X6,X7,X8,X9)=k8_aofa_a00(X2,X3,X4,X5,X6,X7,X8,X9)|~m1_subset_1(X2,X1)|~m1_subset_1(X3,X1)|~m1_subset_1(X4,X1)|~m1_subset_1(X5,X1)|~m1_subset_1(X6,X1)|~m1_subset_1(X7,X1)|~m1_subset_1(X8,X1)|~m1_subset_1(X9,X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_15, plain, (m1_subset_1(np__1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc1_numerals])).
cnf(c_0_16, plain, (m1_subset_1(np__7,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc7_numerals])).
cnf(c_0_17, plain, (m1_subset_1(np__11,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc11_numerals])).
cnf(c_0_18, plain, (m1_subset_1(np__13,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc13_numerals])).
cnf(c_0_19, plain, (~v1_xboole_0(k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_20, negated_conjecture, k1_funct_1(k3_newton07(np__7),np__4)!=np__13, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t98_newton07])])).
cnf(c_0_21, plain, (k1_funct_1(k8_aofa_a00(X1,X2,X3,X4,X5,X6,X7,X8),np__4)=X4), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_22, plain, (k8_aofa_a00(np__1,np__7,np__11,np__13,np__13,np__11,np__7,np__1)=k3_newton07(np__7)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15]), c_0_16]), c_0_17]), c_0_18])]), c_0_19])).
cnf(c_0_23, negated_conjecture, (k1_funct_1(k3_newton07(np__7),np__4)!=np__13), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_24, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 25
# Proof object clause steps            : 11
# Proof object formula steps           : 14
# Proof object conjectures             : 3
# Proof object clause conjectures      : 1
# Proof object formula conjectures     : 2
# Proof object initial clauses used    : 9
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 2
# Proof object simplifying inferences  : 7
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 9
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 14
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 14
# Processed clauses                    : 29
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 29
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 2
# ...of the previous two non-trivial   : 1
# Contextual simplify-reflections      : 0
# Paramodulations                      : 2
# 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  : 12
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 1
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 14
# Clause-clause subsumption calls (NU) : 0
# Rec. Clause-clause subsumption calls : 0
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# 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          : 951

# -------------------------------------------------
# User time                : 0.020 s
# System time              : 0.002 s
# Total time               : 0.022 s
# Maximum resident set size: 3580 pages
