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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t3_topgen_5, axiom, ![X1, X2, X3]:((v1_relat_1(X3)&v1_funct_1(X3))=>(r2_tarski(X2,k9_xtuple_0(X3))=>k1_funct_1(k9_funct_6(k17_funcop_1(X1,X3)),X2)=k17_funcop_1(X1,k1_funct_1(X3,X2)))), file('gr_free0/gr_free0__t4_gr_free0', t3_topgen_5)).
fof(t82_funct_4, axiom, ![X1, X2]:k17_funcop_1(X1,X2)=k1_tarski(k4_tarski(X1,X2)), file('gr_free0/gr_free0__t4_gr_free0', t82_funct_4)).
fof(t4_gr_free0, conjecture, ![X1]:((v1_relat_1(X1)&v1_funct_1(X1))=>![X2]:(r2_hidden(X2,k9_xtuple_0(X1))=>k1_funct_1(k9_funct_6(k9_finseq_1(X1)),X2)=k9_finseq_1(k1_funct_1(X1,X2)))), file('gr_free0/gr_free0__t4_gr_free0', t4_gr_free0)).
fof(d5_finseq_1, axiom, ![X1]:k5_finseq_1(X1)=k1_tarski(k4_tarski(np__1,X1)), file('gr_free0/gr_free0__t4_gr_free0', d5_finseq_1)).
fof(redefinition_k9_finseq_1, axiom, ![X1]:k9_finseq_1(X1)=k5_finseq_1(X1), file('gr_free0/gr_free0__t4_gr_free0', redefinition_k9_finseq_1)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('gr_free0/gr_free0__t4_gr_free0', redefinition_r2_tarski)).
fof(c_0_6, plain, ![X21, X22, X23]:(~v1_relat_1(X23)|~v1_funct_1(X23)|(~r2_tarski(X22,k9_xtuple_0(X23))|k1_funct_1(k9_funct_6(k17_funcop_1(X21,X23)),X22)=k17_funcop_1(X21,k1_funct_1(X23,X22)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_topgen_5])])).
fof(c_0_7, plain, ![X24, X25]:k17_funcop_1(X24,X25)=k1_tarski(k4_tarski(X24,X25)), inference(variable_rename,[status(thm)],[t82_funct_4])).
fof(c_0_8, negated_conjecture, ~(![X1]:((v1_relat_1(X1)&v1_funct_1(X1))=>![X2]:(r2_hidden(X2,k9_xtuple_0(X1))=>k1_funct_1(k9_funct_6(k9_finseq_1(X1)),X2)=k9_finseq_1(k1_funct_1(X1,X2))))), inference(assume_negation,[status(cth)],[t4_gr_free0])).
fof(c_0_9, plain, ![X17]:k5_finseq_1(X17)=k1_tarski(k4_tarski(np__1,X17)), inference(variable_rename,[status(thm)],[d5_finseq_1])).
fof(c_0_10, plain, ![X18]:k9_finseq_1(X18)=k5_finseq_1(X18), inference(variable_rename,[status(thm)],[redefinition_k9_finseq_1])).
cnf(c_0_11, plain, (k1_funct_1(k9_funct_6(k17_funcop_1(X3,X1)),X2)=k17_funcop_1(X3,k1_funct_1(X1,X2))|~v1_relat_1(X1)|~v1_funct_1(X1)|~r2_tarski(X2,k9_xtuple_0(X1))), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_12, plain, (k17_funcop_1(X1,X2)=k1_tarski(k4_tarski(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_7])).
fof(c_0_13, plain, ![X19, X20]:((~r2_tarski(X19,X20)|r2_hidden(X19,X20))&(~r2_hidden(X19,X20)|r2_tarski(X19,X20))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
fof(c_0_14, negated_conjecture, ((v1_relat_1(esk1_0)&v1_funct_1(esk1_0))&(r2_hidden(esk2_0,k9_xtuple_0(esk1_0))&k1_funct_1(k9_funct_6(k9_finseq_1(esk1_0)),esk2_0)!=k9_finseq_1(k1_funct_1(esk1_0,esk2_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
cnf(c_0_15, plain, (k5_finseq_1(X1)=k1_tarski(k4_tarski(np__1,X1))), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_16, plain, (k9_finseq_1(X1)=k5_finseq_1(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_17, plain, (k1_funct_1(k9_funct_6(k1_tarski(k4_tarski(X3,X1))),X2)=k1_tarski(k4_tarski(X3,k1_funct_1(X1,X2)))|~v1_relat_1(X1)|~v1_funct_1(X1)|~r2_tarski(X2,k9_xtuple_0(X1))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_12]), c_0_12])).
cnf(c_0_18, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_19, negated_conjecture, (k1_funct_1(k9_funct_6(k9_finseq_1(esk1_0)),esk2_0)!=k9_finseq_1(k1_funct_1(esk1_0,esk2_0))), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_20, plain, (k9_finseq_1(X1)=k1_tarski(k4_tarski(np__1,X1))), inference(rw,[status(thm)],[c_0_15, c_0_16])).
cnf(c_0_21, plain, (k1_funct_1(k9_funct_6(k1_tarski(k4_tarski(X1,X2))),X3)=k1_tarski(k4_tarski(X1,k1_funct_1(X2,X3)))|~r2_hidden(X3,k9_xtuple_0(X2))|~v1_funct_1(X2)|~v1_relat_1(X2)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
cnf(c_0_22, negated_conjecture, (r2_hidden(esk2_0,k9_xtuple_0(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_23, negated_conjecture, (v1_funct_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_24, negated_conjecture, (v1_relat_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_25, negated_conjecture, (k1_funct_1(k9_funct_6(k1_tarski(k4_tarski(np__1,esk1_0))),esk2_0)!=k1_tarski(k4_tarski(np__1,k1_funct_1(esk1_0,esk2_0)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_20]), c_0_20])).
cnf(c_0_26, negated_conjecture, (k1_funct_1(k9_funct_6(k1_tarski(k4_tarski(X1,esk1_0))),esk2_0)=k1_tarski(k4_tarski(X1,k1_funct_1(esk1_0,esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23]), c_0_24])])).
cnf(c_0_27, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25, c_0_26])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 28
# Proof object clause steps            : 15
# Proof object formula steps           : 13
# Proof object conjectures             : 10
# Proof object clause conjectures      : 7
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 9
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 2
# Proof object simplifying inferences  : 10
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 10
# Removed in clause preprocessing      : 3
# Initial clauses in saturation        : 7
# Processed clauses                    : 16
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 16
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 3
# ...of the previous two non-trivial   : 2
# Contextual simplify-reflections      : 0
# Paramodulations                      : 3
# 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  : 8
#    Positive orientable unit clauses  : 4
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 0
#    Non-unit-clauses                  : 4
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 11
# Clause-clause subsumption calls (NU) : 12
# Rec. Clause-clause subsumption calls : 11
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# 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          : 725

# -------------------------------------------------
# User time                : 0.017 s
# System time              : 0.006 s
# Total time               : 0.023 s
# Maximum resident set size: 2860 pages
