# 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.019 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t62_number14, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r2_hidden(X2,k7_number14(X1))<=>r1_int_1(X1,X2)))), file('number14/number14__t62_number14', t62_number14)).
fof(fraenkel_a_1_0_number14, axiom, ![X1, X2]:(v1_int_1(X2)=>(r2_hidden(X1,a_1_0_number14(X2))<=>?[X3]:(m3_number14(X3,X2)&X1=X3))), file('number14/number14__t62_number14', fraenkel_a_1_0_number14)).
fof(t61_number14, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(r2_hidden(X2,k7_number14(X1))=>m3_number14(X2,X1))), file('number14/number14__t62_number14', t61_number14)).
fof(d16_number14, axiom, ![X1]:(v1_int_1(X1)=>k7_number14(X1)=a_1_0_number14(X1)), file('number14/number14__t62_number14', d16_number14)).
fof(d15_number14, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(m3_number14(X2,X1)<=>r1_int_1(X1,X2)))), file('number14/number14__t62_number14', d15_number14)).
fof(dt_m3_number14, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(m3_number14(X2,X1)=>v1_int_1(X2))), file('number14/number14__t62_number14', dt_m3_number14)).
fof(c_0_6, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r2_hidden(X2,k7_number14(X1))<=>r1_int_1(X1,X2))))), inference(assume_negation,[status(cth)],[t62_number14])).
fof(c_0_7, plain, ![X23, X24, X26]:(((m3_number14(esk3_2(X23,X24),X24)|~r2_hidden(X23,a_1_0_number14(X24))|~v1_int_1(X24))&(X23=esk3_2(X23,X24)|~r2_hidden(X23,a_1_0_number14(X24))|~v1_int_1(X24)))&(~m3_number14(X26,X24)|X23!=X26|r2_hidden(X23,a_1_0_number14(X24))|~v1_int_1(X24))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fraenkel_a_1_0_number14])])])])])).
fof(c_0_8, plain, ![X27, X28]:(~v1_int_1(X27)|(~r2_hidden(X28,k7_number14(X27))|m3_number14(X28,X27))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t61_number14])])])).
fof(c_0_9, negated_conjecture, (v1_int_1(esk1_0)&(v1_int_1(esk2_0)&((~r2_hidden(esk2_0,k7_number14(esk1_0))|~r1_int_1(esk1_0,esk2_0))&(r2_hidden(esk2_0,k7_number14(esk1_0))|r1_int_1(esk1_0,esk2_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
cnf(c_0_10, plain, (r2_hidden(X3,a_1_0_number14(X2))|~m3_number14(X1,X2)|X3!=X1|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_7])).
fof(c_0_11, plain, ![X20]:(~v1_int_1(X20)|k7_number14(X20)=a_1_0_number14(X20)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d16_number14])])).
fof(c_0_12, plain, ![X18, X19]:((~m3_number14(X19,X18)|r1_int_1(X18,X19)|~v1_int_1(X19)|~v1_int_1(X18))&(~r1_int_1(X18,X19)|m3_number14(X19,X18)|~v1_int_1(X19)|~v1_int_1(X18))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d15_number14])])])])).
cnf(c_0_13, plain, (m3_number14(X2,X1)|~v1_int_1(X1)|~r2_hidden(X2,k7_number14(X1))), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_14, negated_conjecture, (r2_hidden(esk2_0,k7_number14(esk1_0))|r1_int_1(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_15, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_16, plain, (r2_hidden(X1,a_1_0_number14(X2))|~m3_number14(X1,X2)|~v1_int_1(X2)), inference(er,[status(thm)],[c_0_10])).
cnf(c_0_17, plain, (k7_number14(X1)=a_1_0_number14(X1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_18, plain, (m3_number14(X2,X1)|~r1_int_1(X1,X2)|~v1_int_1(X2)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_19, negated_conjecture, (m3_number14(esk2_0,esk1_0)|r1_int_1(esk1_0,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])])).
cnf(c_0_20, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
fof(c_0_21, plain, ![X21, X22]:(~v1_int_1(X21)|(~m3_number14(X22,X21)|v1_int_1(X22))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m3_number14])])])).
cnf(c_0_22, negated_conjecture, (~r2_hidden(esk2_0,k7_number14(esk1_0))|~r1_int_1(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_23, plain, (r2_hidden(X1,k7_number14(X2))|~m3_number14(X1,X2)|~v1_int_1(X2)), inference(spm,[status(thm)],[c_0_16, c_0_17])).
cnf(c_0_24, negated_conjecture, (m3_number14(esk2_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20]), c_0_15])])).
cnf(c_0_25, plain, (r1_int_1(X2,X1)|~m3_number14(X1,X2)|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_26, plain, (v1_int_1(X2)|~v1_int_1(X1)|~m3_number14(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_27, negated_conjecture, (~r1_int_1(esk1_0,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24]), c_0_15])])).
cnf(c_0_28, plain, (r1_int_1(X1,X2)|~m3_number14(X2,X1)|~v1_int_1(X1)), inference(csr,[status(thm)],[c_0_25, c_0_26])).
cnf(c_0_29, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_24]), c_0_15])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 30
# Proof object clause steps            : 17
# Proof object formula steps           : 13
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 10
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 5
# Proof object simplifying inferences  : 13
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 12
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 12
# Processed clauses                    : 30
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 30
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 16
# ...of the previous two non-trivial   : 11
# Contextual simplify-reflections      : 1
# Paramodulations                      : 14
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 1
# 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: 4
# ...number of literals in the above   : 11
# Current number of archived formulas  : 0
# Current number of archived clauses   : 14
# Clause-clause subsumption calls (NU) : 13
# Rec. Clause-clause subsumption calls : 11
# Non-unit clause-clause subsumptions  : 1
# Unit Clause-clause subsumption calls : 1
# 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          : 1133

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.002 s
# Total time               : 0.023 s
# Maximum resident set size: 3024 pages
