# 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__t10_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__t10_number14', dt_k1_int_2)).
fof(t10_number14, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r1_int_2(X1,X2)<=>r1_int_2(k1_int_2(X1),X2)))), file('number14/number14__t10_number14', t10_number14)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('number14/number14__t10_number14', cc2_int_1)).
fof(symmetry_r1_int_2, axiom, ![X1, X2]:((v1_int_1(X1)&v1_int_1(X2))=>(r1_int_2(X1,X2)=>r1_int_2(X2,X1))), file('number14/number14__t10_number14', symmetry_r1_int_2)).
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__t10_number14', d3_int_2)).
fof(t14_int_6, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>k3_int_2(X1,X2)=k3_int_2(X1,k1_int_2(X2)))), file('number14/number14__t10_number14', t14_int_6)).
fof(c_0_7, plain, ![X17]:(~m1_subset_1(X17,k4_ordinal1)|v7_ordinal1(X17)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
fof(c_0_8, plain, ![X20]:(~v1_int_1(X20)|m1_subset_1(k1_int_2(X20),k4_ordinal1)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_int_2])])).
fof(c_0_9, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r1_int_2(X1,X2)<=>r1_int_2(k1_int_2(X1),X2))))), inference(assume_negation,[status(cth)],[t10_number14])).
fof(c_0_10, plain, ![X16]:(~v7_ordinal1(X16)|v1_int_1(X16)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_int_1])])).
cnf(c_0_11, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_12, plain, (m1_subset_1(k1_int_2(X1),k4_ordinal1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
fof(c_0_13, 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),esk2_0))&(r1_int_2(esk1_0,esk2_0)|r1_int_2(k1_int_2(esk1_0),esk2_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
fof(c_0_14, plain, ![X18, X19]:(~v1_int_1(X18)|~v1_int_1(X19)|(~r1_int_2(X18,X19)|r1_int_2(X19,X18))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_int_2])])).
fof(c_0_15, plain, ![X21, X22]:((~r1_int_2(X21,X22)|k3_int_2(X21,X22)=np__1|~v1_int_1(X22)|~v1_int_1(X21))&(k3_int_2(X21,X22)!=np__1|r1_int_2(X21,X22)|~v1_int_1(X22)|~v1_int_1(X21))), 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_16, plain, ![X23, X24]:(~v1_int_1(X23)|(~v1_int_1(X24)|k3_int_2(X23,X24)=k3_int_2(X23,k1_int_2(X24)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t14_int_6])])])).
cnf(c_0_17, plain, (v1_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_18, plain, (v7_ordinal1(k1_int_2(X1))|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
cnf(c_0_19, negated_conjecture, (~r1_int_2(esk1_0,esk2_0)|~r1_int_2(k1_int_2(esk1_0),esk2_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_20, plain, (r1_int_2(X2,X1)|~v1_int_1(X1)|~v1_int_1(X2)|~r1_int_2(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_21, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_22, 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_15])).
cnf(c_0_23, plain, (k3_int_2(X1,X2)=k3_int_2(X1,k1_int_2(X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_24, plain, (v1_int_1(k1_int_2(X1))|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
cnf(c_0_25, negated_conjecture, (~r1_int_2(esk2_0,k1_int_2(esk1_0))|~r1_int_2(esk1_0,esk2_0)|~v1_int_1(k1_int_2(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])])).
cnf(c_0_26, plain, (r1_int_2(X1,k1_int_2(X2))|k3_int_2(X1,X2)!=np__1|~v1_int_1(X1)|~v1_int_1(X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])).
cnf(c_0_27, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_28, negated_conjecture, (r1_int_2(esk1_0,esk2_0)|r1_int_2(k1_int_2(esk1_0),esk2_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_29, negated_conjecture, (k3_int_2(esk2_0,esk1_0)!=np__1|~r1_int_2(esk1_0,esk2_0)|~v1_int_1(k1_int_2(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_21]), c_0_27])])).
cnf(c_0_30, 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_15])).
cnf(c_0_31, negated_conjecture, (r1_int_2(esk2_0,k1_int_2(esk1_0))|r1_int_2(esk1_0,esk2_0)|~v1_int_1(k1_int_2(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_28]), c_0_21])])).
cnf(c_0_32, negated_conjecture, (~r1_int_2(esk1_0,esk2_0)|~r1_int_2(esk2_0,esk1_0)|~v1_int_1(k1_int_2(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_27]), c_0_21])])).
cnf(c_0_33, plain, (k3_int_2(X1,X2)=np__1|~r1_int_2(X1,k1_int_2(X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_23]), c_0_24])).
cnf(c_0_34, negated_conjecture, (r1_int_2(esk2_0,k1_int_2(esk1_0))|r1_int_2(esk1_0,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_24]), c_0_27])])).
cnf(c_0_35, negated_conjecture, (~r1_int_2(esk1_0,esk2_0)|~r1_int_2(esk2_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_24]), c_0_27])])).
cnf(c_0_36, negated_conjecture, (k3_int_2(esk2_0,esk1_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_33, c_0_34]), c_0_21]), c_0_27])])).
cnf(c_0_37, negated_conjecture, (~r1_int_2(esk2_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_20]), c_0_27]), c_0_21])])).
cnf(c_0_38, negated_conjecture, (r1_int_2(esk1_0,esk2_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_36]), c_0_27]), c_0_21])]), c_0_37])).
cnf(c_0_39, 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_20, c_0_38]), c_0_21]), c_0_27])]), c_0_37]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 40
# Proof object clause steps            : 25
# Proof object formula steps           : 15
# Proof object conjectures             : 17
# Proof object clause conjectures      : 14
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 11
# Proof object initial formulas used   : 7
# Proof object generating inferences   : 14
# Proof object simplifying inferences  : 30
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 7
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 11
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 11
# Processed clauses                    : 35
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 35
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 2
# Backward-rewritten                   : 7
# Generated clauses                    : 22
# ...of the previous two non-trivial   : 19
# Contextual simplify-reflections      : 2
# Paramodulations                      : 22
# 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  : 3
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 11
# Current number of unprocessed clauses: 2
# ...number of literals in the above   : 10
# Current number of archived formulas  : 0
# Current number of archived clauses   : 20
# Clause-clause subsumption calls (NU) : 59
# Rec. Clause-clause subsumption calls : 39
# Non-unit clause-clause subsumptions  : 4
# 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          : 1235

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