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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t11_relset_3, axiom, ![X1]:(v1_xcmplx_0(X1)=>![X2]:(v1_xcmplx_0(X2)=>![X3]:(v1_xcmplx_0(X3)=>![X4]:(v1_membered(X4)=>(r2_hidden(k4_tarski(X2,X3),k2_relset_3(X4,X1))<=>((r2_hidden(X2,X4)&r2_hidden(X3,X4))&X3=k2_xcmplx_0(X1,X2))))))), file('relset_3/relset_3__t19_relset_3', t11_relset_3)).
fof(fc2_xcmplx_0, axiom, ![X1, X2]:((v1_xcmplx_0(X1)&v1_xcmplx_0(X2))=>v1_xcmplx_0(k2_xcmplx_0(X1,X2))), file('relset_3/relset_3__t19_relset_3', fc2_xcmplx_0)).
fof(t19_relset_3, conjecture, ![X1]:(v1_xcmplx_0(X1)=>![X2]:(v1_xcmplx_0(X2)=>r2_hidden(k4_tarski(X2,k2_xcmplx_0(X2,X1)),k2_relset_3(k2_numbers,X1)))), file('relset_3/relset_3__t19_relset_3', t19_relset_3)).
fof(commutativity_k2_xcmplx_0, axiom, ![X1, X2]:((v1_xcmplx_0(X1)&v1_xcmplx_0(X2))=>k2_xcmplx_0(X1,X2)=k2_xcmplx_0(X2,X1)), file('relset_3/relset_3__t19_relset_3', commutativity_k2_xcmplx_0)).
fof(fc1_membered, axiom, v1_membered(k2_numbers), file('relset_3/relset_3__t19_relset_3', fc1_membered)).
fof(d2_xcmplx_0, axiom, ![X1]:(v1_xcmplx_0(X1)<=>r2_hidden(X1,k2_numbers)), file('relset_3/relset_3__t19_relset_3', d2_xcmplx_0)).
fof(c_0_6, plain, ![X23, X24, X25, X26]:((((r2_hidden(X24,X26)|~r2_hidden(k4_tarski(X24,X25),k2_relset_3(X26,X23))|~v1_membered(X26)|~v1_xcmplx_0(X25)|~v1_xcmplx_0(X24)|~v1_xcmplx_0(X23))&(r2_hidden(X25,X26)|~r2_hidden(k4_tarski(X24,X25),k2_relset_3(X26,X23))|~v1_membered(X26)|~v1_xcmplx_0(X25)|~v1_xcmplx_0(X24)|~v1_xcmplx_0(X23)))&(X25=k2_xcmplx_0(X23,X24)|~r2_hidden(k4_tarski(X24,X25),k2_relset_3(X26,X23))|~v1_membered(X26)|~v1_xcmplx_0(X25)|~v1_xcmplx_0(X24)|~v1_xcmplx_0(X23)))&(~r2_hidden(X24,X26)|~r2_hidden(X25,X26)|X25!=k2_xcmplx_0(X23,X24)|r2_hidden(k4_tarski(X24,X25),k2_relset_3(X26,X23))|~v1_membered(X26)|~v1_xcmplx_0(X25)|~v1_xcmplx_0(X24)|~v1_xcmplx_0(X23))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t11_relset_3])])])])).
fof(c_0_7, plain, ![X21, X22]:(~v1_xcmplx_0(X21)|~v1_xcmplx_0(X22)|v1_xcmplx_0(k2_xcmplx_0(X21,X22))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc2_xcmplx_0])])).
fof(c_0_8, negated_conjecture, ~(![X1]:(v1_xcmplx_0(X1)=>![X2]:(v1_xcmplx_0(X2)=>r2_hidden(k4_tarski(X2,k2_xcmplx_0(X2,X1)),k2_relset_3(k2_numbers,X1))))), inference(assume_negation,[status(cth)],[t19_relset_3])).
cnf(c_0_9, plain, (r2_hidden(k4_tarski(X1,X3),k2_relset_3(X2,X4))|~r2_hidden(X1,X2)|~r2_hidden(X3,X2)|X3!=k2_xcmplx_0(X4,X1)|~v1_membered(X2)|~v1_xcmplx_0(X3)|~v1_xcmplx_0(X1)|~v1_xcmplx_0(X4)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_10, plain, (v1_xcmplx_0(k2_xcmplx_0(X1,X2))|~v1_xcmplx_0(X1)|~v1_xcmplx_0(X2)), inference(split_conjunct,[status(thm)],[c_0_7])).
fof(c_0_11, plain, ![X18, X19]:(~v1_xcmplx_0(X18)|~v1_xcmplx_0(X19)|k2_xcmplx_0(X18,X19)=k2_xcmplx_0(X19,X18)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[commutativity_k2_xcmplx_0])])).
fof(c_0_12, negated_conjecture, (v1_xcmplx_0(esk1_0)&(v1_xcmplx_0(esk2_0)&~r2_hidden(k4_tarski(esk2_0,k2_xcmplx_0(esk2_0,esk1_0)),k2_relset_3(k2_numbers,esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
cnf(c_0_13, plain, (r2_hidden(k4_tarski(X1,k2_xcmplx_0(X2,X1)),k2_relset_3(X3,X2))|~v1_membered(X3)|~r2_hidden(k2_xcmplx_0(X2,X1),X3)|~r2_hidden(X1,X3)|~v1_xcmplx_0(X2)|~v1_xcmplx_0(X1)), inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_9]), c_0_10])).
cnf(c_0_14, plain, (k2_xcmplx_0(X1,X2)=k2_xcmplx_0(X2,X1)|~v1_xcmplx_0(X1)|~v1_xcmplx_0(X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_15, negated_conjecture, (~r2_hidden(k4_tarski(esk2_0,k2_xcmplx_0(esk2_0,esk1_0)),k2_relset_3(k2_numbers,esk1_0))), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_16, plain, (r2_hidden(k4_tarski(X1,k2_xcmplx_0(X1,X2)),k2_relset_3(X3,X2))|~v1_membered(X3)|~r2_hidden(k2_xcmplx_0(X1,X2),X3)|~r2_hidden(X1,X3)|~v1_xcmplx_0(X2)|~v1_xcmplx_0(X1)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
cnf(c_0_17, plain, (v1_membered(k2_numbers)), inference(split_conjunct,[status(thm)],[fc1_membered])).
cnf(c_0_18, negated_conjecture, (v1_xcmplx_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_19, negated_conjecture, (v1_xcmplx_0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
fof(c_0_20, plain, ![X20]:((~v1_xcmplx_0(X20)|r2_hidden(X20,k2_numbers))&(~r2_hidden(X20,k2_numbers)|v1_xcmplx_0(X20))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_xcmplx_0])])).
cnf(c_0_21, negated_conjecture, (~r2_hidden(k2_xcmplx_0(esk2_0,esk1_0),k2_numbers)|~r2_hidden(esk2_0,k2_numbers)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17]), c_0_18]), c_0_19])])).
cnf(c_0_22, plain, (r2_hidden(X1,k2_numbers)|~v1_xcmplx_0(X1)), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_23, negated_conjecture, (~r2_hidden(esk2_0,k2_numbers)|~v1_xcmplx_0(k2_xcmplx_0(esk2_0,esk1_0))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
cnf(c_0_24, negated_conjecture, (~r2_hidden(esk2_0,k2_numbers)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_10]), c_0_18]), c_0_19])])).
cnf(c_0_25, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_22]), c_0_19])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 26
# Proof object clause steps            : 14
# Proof object formula steps           : 12
# Proof object conjectures             : 10
# Proof object clause conjectures      : 7
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 8
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 5
# Proof object simplifying inferences  : 11
# 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                    : 32
# ...of these trivial                  : 0
# ...subsumed                          : 3
# ...remaining for further processing  : 29
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 17
# ...of the previous two non-trivial   : 11
# Contextual simplify-reflections      : 1
# Paramodulations                      : 16
# 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  : 16
#    Positive orientable unit clauses  : 3
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 11
# Current number of unprocessed clauses: 3
# ...number of literals in the above   : 18
# Current number of archived formulas  : 0
# Current number of archived clauses   : 12
# Clause-clause subsumption calls (NU) : 24
# Rec. Clause-clause subsumption calls : 10
# Non-unit clause-clause subsumptions  : 4
# Unit Clause-clause subsumption calls : 3
# 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          : 1431

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