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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t19_number14, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>![X3]:(v1_int_1(X3)=>(r2_int_1(X2,X3,X1)=>(r1_xxreal_0(X1,k5_numbers)|(r1_int_1(X1,X2)<=>r1_int_1(X1,X3))))))), file('number14/number14__t19_number14', t19_number14)).
fof(t62_int_1, axiom, ![X1]:(v1_int_1(X1)=>(~(r1_xxreal_0(X1,k5_numbers))=>![X2]:(v1_int_1(X2)=>(k5_int_1(X2,X1)=k5_numbers<=>r1_int_1(X1,X2))))), file('number14/number14__t19_number14', t62_int_1)).
fof(t64_nat_d, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>![X3]:(v1_int_1(X3)=>((k5_int_1(X2,X1)=k5_int_1(X3,X1)=>(X1=k5_numbers|r2_int_1(X2,X3,X1)))&(r2_int_1(X2,X3,X1)=>k5_int_1(X2,X1)=k5_int_1(X3,X1)))))), file('number14/number14__t19_number14', t64_nat_d)).
fof(c_0_3, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>![X3]:(v1_int_1(X3)=>(r2_int_1(X2,X3,X1)=>(r1_xxreal_0(X1,k5_numbers)|(r1_int_1(X1,X2)<=>r1_int_1(X1,X3)))))))), inference(assume_negation,[status(cth)],[t19_number14])).
fof(c_0_4, plain, ![X1]:(v1_int_1(X1)=>(~r1_xxreal_0(X1,k5_numbers)=>![X2]:(v1_int_1(X2)=>(k5_int_1(X2,X1)=k5_numbers<=>r1_int_1(X1,X2))))), inference(fof_simplification,[status(thm)],[t62_int_1])).
fof(c_0_5, negated_conjecture, (v1_int_1(esk1_0)&(v1_int_1(esk2_0)&(v1_int_1(esk3_0)&(r2_int_1(esk2_0,esk3_0,esk1_0)&(~r1_xxreal_0(esk1_0,k5_numbers)&((~r1_int_1(esk1_0,esk2_0)|~r1_int_1(esk1_0,esk3_0))&(r1_int_1(esk1_0,esk2_0)|r1_int_1(esk1_0,esk3_0)))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
fof(c_0_6, plain, ![X15, X16]:((k5_int_1(X16,X15)!=k5_numbers|r1_int_1(X15,X16)|~v1_int_1(X16)|r1_xxreal_0(X15,k5_numbers)|~v1_int_1(X15))&(~r1_int_1(X15,X16)|k5_int_1(X16,X15)=k5_numbers|~v1_int_1(X16)|r1_xxreal_0(X15,k5_numbers)|~v1_int_1(X15))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])).
fof(c_0_7, plain, ![X17, X18, X19]:((k5_int_1(X18,X17)!=k5_int_1(X19,X17)|(X17=k5_numbers|r2_int_1(X18,X19,X17))|~v1_int_1(X19)|~v1_int_1(X18)|~v1_int_1(X17))&(~r2_int_1(X18,X19,X17)|k5_int_1(X18,X17)=k5_int_1(X19,X17)|~v1_int_1(X19)|~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)],[t64_nat_d])])])])).
cnf(c_0_8, negated_conjecture, (~r1_xxreal_0(esk1_0,k5_numbers)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_9, plain, (k5_int_1(X2,X1)=k5_numbers|r1_xxreal_0(X1,k5_numbers)|~r1_int_1(X1,X2)|~v1_int_1(X2)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_10, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_11, plain, (k5_int_1(X1,X3)=k5_int_1(X2,X3)|~r2_int_1(X1,X2,X3)|~v1_int_1(X2)|~v1_int_1(X1)|~v1_int_1(X3)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_12, negated_conjecture, (r2_int_1(esk2_0,esk3_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_13, negated_conjecture, (v1_int_1(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_14, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_15, plain, (r1_int_1(X2,X1)|r1_xxreal_0(X2,k5_numbers)|k5_int_1(X1,X2)!=k5_numbers|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_16, 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_17, negated_conjecture, (r1_int_1(esk1_0,esk2_0)|r1_int_1(esk1_0,esk3_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_18, negated_conjecture, (k5_int_1(esk3_0,esk1_0)=k5_int_1(esk2_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_10]), c_0_13]), c_0_14])])).
cnf(c_0_19, negated_conjecture, (~r1_int_1(esk1_0,esk2_0)|~r1_int_1(esk1_0,esk3_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_20, 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_15]), c_0_10])])).
cnf(c_0_21, negated_conjecture, (k5_int_1(esk2_0,esk1_0)=k5_numbers|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_16, c_0_17]), c_0_18]), c_0_13])])).
cnf(c_0_22, negated_conjecture, (k5_int_1(esk2_0,esk1_0)!=k5_numbers|~r1_int_1(esk1_0,esk3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_14])])).
cnf(c_0_23, negated_conjecture, (~r1_int_1(esk1_0,esk3_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_21]), c_0_22])).
cnf(c_0_24, negated_conjecture, (r1_int_1(esk1_0,esk2_0)), inference(sr,[status(thm)],[c_0_17, c_0_23])).
cnf(c_0_25, 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_23, c_0_20]), c_0_18]), c_0_13])])).
cnf(c_0_26, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_24]), c_0_14])]), c_0_25]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 27
# Proof object clause steps            : 19
# Proof object formula steps           : 8
# Proof object conjectures             : 19
# Proof object clause conjectures      : 16
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 10
# Proof object initial formulas used   : 3
# Proof object generating inferences   : 8
# Proof object simplifying inferences  : 21
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 3
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 11
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 11
# Processed clauses                    : 32
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 30
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 1
# Generated clauses                    : 14
# ...of the previous two non-trivial   : 13
# Contextual simplify-reflections      : 1
# Paramodulations                      : 13
# 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  : 16
#    Positive orientable unit clauses  : 6
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 7
# Current number of unprocessed clauses: 2
# ...number of literals in the above   : 6
# Current number of archived formulas  : 0
# Current number of archived clauses   : 14
# Clause-clause subsumption calls (NU) : 2
# Rec. Clause-clause subsumption calls : 1
# Non-unit clause-clause subsumptions  : 1
# Unit Clause-clause subsumption calls : 6
# 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          : 1095

# -------------------------------------------------
# User time                : 0.022 s
# System time              : 0.001 s
# Total time               : 0.023 s
# Maximum resident set size: 3016 pages
