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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t5_relset_3, conjecture, ![X1]:(v3_ordinal1(X1)=>![X2]:(v3_ordinal1(X2)=>(r2_tarski(k1_ordinal1(X2),X1)=>r2_hidden(k4_tarski(X2,k1_ordinal1(X2)),k1_relset_3(X1))))), file('relset_3/relset_3__t5_relset_3', t5_relset_3)).
fof(t4_relset_3, axiom, ![X1]:(v3_ordinal1(X1)=>![X2]:(v3_ordinal1(X2)=>![X3]:(v3_ordinal1(X3)=>(r2_hidden(k4_tarski(X2,X3),k1_relset_3(X1))<=>(r2_tarski(k1_ordinal1(X2),X1)&X3=k1_ordinal1(X2)))))), file('relset_3/relset_3__t5_relset_3', t4_relset_3)).
fof(fc2_ordinal1, axiom, ![X1]:(v3_ordinal1(X1)=>(~(v1_xboole_0(k1_ordinal1(X1)))&v3_ordinal1(k1_ordinal1(X1)))), file('relset_3/relset_3__t5_relset_3', fc2_ordinal1)).
fof(c_0_3, negated_conjecture, ~(![X1]:(v3_ordinal1(X1)=>![X2]:(v3_ordinal1(X2)=>(r2_tarski(k1_ordinal1(X2),X1)=>r2_hidden(k4_tarski(X2,k1_ordinal1(X2)),k1_relset_3(X1)))))), inference(assume_negation,[status(cth)],[t5_relset_3])).
fof(c_0_4, plain, ![X13, X14, X15]:(((r2_tarski(k1_ordinal1(X14),X13)|~r2_hidden(k4_tarski(X14,X15),k1_relset_3(X13))|~v3_ordinal1(X15)|~v3_ordinal1(X14)|~v3_ordinal1(X13))&(X15=k1_ordinal1(X14)|~r2_hidden(k4_tarski(X14,X15),k1_relset_3(X13))|~v3_ordinal1(X15)|~v3_ordinal1(X14)|~v3_ordinal1(X13)))&(~r2_tarski(k1_ordinal1(X14),X13)|X15!=k1_ordinal1(X14)|r2_hidden(k4_tarski(X14,X15),k1_relset_3(X13))|~v3_ordinal1(X15)|~v3_ordinal1(X14)|~v3_ordinal1(X13))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_relset_3])])])])).
fof(c_0_5, negated_conjecture, (v3_ordinal1(esk1_0)&(v3_ordinal1(esk2_0)&(r2_tarski(k1_ordinal1(esk2_0),esk1_0)&~r2_hidden(k4_tarski(esk2_0,k1_ordinal1(esk2_0)),k1_relset_3(esk1_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
cnf(c_0_6, plain, (r2_hidden(k4_tarski(X1,X3),k1_relset_3(X2))|~r2_tarski(k1_ordinal1(X1),X2)|X3!=k1_ordinal1(X1)|~v3_ordinal1(X3)|~v3_ordinal1(X1)|~v3_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_7, negated_conjecture, (r2_tarski(k1_ordinal1(esk2_0),esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_8, negated_conjecture, (v3_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_9, negated_conjecture, (v3_ordinal1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
fof(c_0_10, plain, ![X1]:(v3_ordinal1(X1)=>(~v1_xboole_0(k1_ordinal1(X1))&v3_ordinal1(k1_ordinal1(X1)))), inference(fof_simplification,[status(thm)],[fc2_ordinal1])).
cnf(c_0_11, negated_conjecture, (r2_hidden(k4_tarski(esk2_0,X1),k1_relset_3(esk1_0))|X1!=k1_ordinal1(esk2_0)|~v3_ordinal1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_7]), c_0_8]), c_0_9])])).
cnf(c_0_12, negated_conjecture, (~r2_hidden(k4_tarski(esk2_0,k1_ordinal1(esk2_0)),k1_relset_3(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_5])).
fof(c_0_13, plain, ![X12]:((~v1_xboole_0(k1_ordinal1(X12))|~v3_ordinal1(X12))&(v3_ordinal1(k1_ordinal1(X12))|~v3_ordinal1(X12))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
cnf(c_0_14, negated_conjecture, (~v3_ordinal1(k1_ordinal1(esk2_0))), inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_11]), c_0_12])).
cnf(c_0_15, plain, (v3_ordinal1(k1_ordinal1(X1))|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_9])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 17
# Proof object clause steps            : 9
# Proof object formula steps           : 8
# Proof object conjectures             : 10
# Proof object clause conjectures      : 7
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 6
# Proof object initial formulas used   : 3
# Proof object generating inferences   : 3
# Proof object simplifying inferences  : 6
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 3
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 9
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 9
# Processed clauses                    : 20
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 20
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 3
# ...of the previous two non-trivial   : 2
# Contextual simplify-reflections      : 0
# Paramodulations                      : 2
# 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  : 11
#    Positive orientable unit clauses  : 3
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 6
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 9
# Clause-clause subsumption calls (NU) : 17
# Rec. Clause-clause subsumption calls : 0
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 1
# 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          : 798

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