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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(cc8_ordinal1, axiom, ![X1]:(m1_subset_1(X1,k4_ordinal1)=>v7_ordinal1(X1)), file('number14/number14__t9_number14', cc8_ordinal1)).
fof(dt_k1_int_2, axiom, ![X1]:(v1_int_1(X1)=>m1_subset_1(k1_int_2(X1),k4_ordinal1)), file('number14/number14__t9_number14', dt_k1_int_2)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('number14/number14__t9_number14', cc2_int_1)).
fof(t9_number14, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r1_int_2(X1,X2)<=>r1_int_2(k1_int_2(X1),k1_int_2(X2))))), file('number14/number14__t9_number14', t9_number14)).
fof(d3_int_2, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r1_int_2(X1,X2)<=>k3_int_2(X1,X2)=np__1))), file('number14/number14__t9_number14', d3_int_2)).
fof(t34_int_2, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>k3_int_2(X1,X2)=k3_int_2(k1_int_2(X1),k1_int_2(X2)))), file('number14/number14__t9_number14', t34_int_2)).
fof(c_0_6, plain, ![X15]:(~m1_subset_1(X15,k4_ordinal1)|v7_ordinal1(X15)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
fof(c_0_7, plain, ![X16]:(~v1_int_1(X16)|m1_subset_1(k1_int_2(X16),k4_ordinal1)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_int_2])])).
fof(c_0_8, plain, ![X14]:(~v7_ordinal1(X14)|v1_int_1(X14)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_int_1])])).
cnf(c_0_9, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_10, plain, (m1_subset_1(k1_int_2(X1),k4_ordinal1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
fof(c_0_11, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r1_int_2(X1,X2)<=>r1_int_2(k1_int_2(X1),k1_int_2(X2)))))), inference(assume_negation,[status(cth)],[t9_number14])).
fof(c_0_12, plain, ![X17, X18]:((~r1_int_2(X17,X18)|k3_int_2(X17,X18)=np__1|~v1_int_1(X18)|~v1_int_1(X17))&(k3_int_2(X17,X18)!=np__1|r1_int_2(X17,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)],[d3_int_2])])])])).
fof(c_0_13, plain, ![X19, X20]:(~v1_int_1(X19)|(~v1_int_1(X20)|k3_int_2(X19,X20)=k3_int_2(k1_int_2(X19),k1_int_2(X20)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t34_int_2])])])).
cnf(c_0_14, plain, (v1_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_15, plain, (v7_ordinal1(k1_int_2(X1))|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_9, c_0_10])).
fof(c_0_16, negated_conjecture, (v1_int_1(esk1_0)&(v1_int_1(esk2_0)&((~r1_int_2(esk1_0,esk2_0)|~r1_int_2(k1_int_2(esk1_0),k1_int_2(esk2_0)))&(r1_int_2(esk1_0,esk2_0)|r1_int_2(k1_int_2(esk1_0),k1_int_2(esk2_0)))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])).
cnf(c_0_17, plain, (r1_int_2(X1,X2)|k3_int_2(X1,X2)!=np__1|~v1_int_1(X2)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_18, plain, (k3_int_2(X1,X2)=k3_int_2(k1_int_2(X1),k1_int_2(X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_19, plain, (v1_int_1(k1_int_2(X1))|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
cnf(c_0_20, negated_conjecture, (~r1_int_2(esk1_0,esk2_0)|~r1_int_2(k1_int_2(esk1_0),k1_int_2(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_21, plain, (r1_int_2(k1_int_2(X1),k1_int_2(X2))|k3_int_2(X1,X2)!=np__1|~v1_int_1(X2)|~v1_int_1(X1)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19]), c_0_19])).
cnf(c_0_22, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_23, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_24, negated_conjecture, (k3_int_2(esk1_0,esk2_0)!=np__1|~r1_int_2(esk1_0,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22]), c_0_23])])).
cnf(c_0_25, plain, (k3_int_2(X1,X2)=np__1|~r1_int_2(X1,X2)|~v1_int_1(X2)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_26, negated_conjecture, (r1_int_2(esk1_0,esk2_0)|r1_int_2(k1_int_2(esk1_0),k1_int_2(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_27, negated_conjecture, (~r1_int_2(esk1_0,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_22]), c_0_23])])).
cnf(c_0_28, plain, (k3_int_2(X1,X2)=np__1|~r1_int_2(k1_int_2(X1),k1_int_2(X2))|~v1_int_1(X2)|~v1_int_1(X1)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_18]), c_0_19]), c_0_19])).
cnf(c_0_29, negated_conjecture, (r1_int_2(k1_int_2(esk1_0),k1_int_2(esk2_0))), inference(sr,[status(thm)],[c_0_26, c_0_27])).
cnf(c_0_30, negated_conjecture, (k3_int_2(esk1_0,esk2_0)=np__1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_22]), c_0_23])])).
cnf(c_0_31, 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_17, c_0_30]), c_0_22]), c_0_23])]), c_0_27]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 32
# Proof object clause steps            : 19
# Proof object formula steps           : 13
# Proof object conjectures             : 12
# Proof object clause conjectures      : 9
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 10
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 8
# Proof object simplifying inferences  : 18
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 10
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 10
# Processed clauses                    : 29
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 28
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 2
# Generated clauses                    : 12
# ...of the previous two non-trivial   : 10
# Contextual simplify-reflections      : 4
# Paramodulations                      : 11
# 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  : 4
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 10
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 13
# Clause-clause subsumption calls (NU) : 39
# Rec. Clause-clause subsumption calls : 29
# Non-unit clause-clause subsumptions  : 4
# Unit Clause-clause subsumption calls : 2
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 2
# BW rewrite match successes           : 2
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 989

# -------------------------------------------------
# User time                : 0.024 s
# System time              : 0.000 s
# Total time               : 0.024 s
# Maximum resident set size: 2932 pages
