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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t20_number14, conjecture, ![X1, X2, X3]:(((v1_relat_1(X3)&v1_funct_1(X3))&v1_finseq_1(X3))=>(r2_tarski(np__1,k4_finseq_1(k7_finseq_1(k10_finseq_1(X1,X2),X3)))&r2_tarski(np__2,k4_finseq_1(k7_finseq_1(k10_finseq_1(X1,X2),X3))))), file('number14/number14__t20_number14', t20_number14)).
fof(d9_finseq_1, axiom, ![X1, X2]:k10_finseq_1(X1,X2)=k7_finseq_1(k9_finseq_1(X1),k9_finseq_1(X2)), file('number14/number14__t20_number14', d9_finseq_1)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('number14/number14__t20_number14', redefinition_r2_tarski)).
fof(d2_tarski, axiom, ![X1, X2, X3]:(X3=k2_tarski(X1,X2)<=>![X4]:(r2_hidden(X4,X3)<=>(X4=X1|X4=X2))), file('number14/number14__t20_number14', d2_tarski)).
fof(d3_tarski, axiom, ![X1, X2]:(r1_tarski(X1,X2)<=>![X3]:(r2_hidden(X3,X1)=>r2_hidden(X3,X2))), file('number14/number14__t20_number14', d3_tarski)).
fof(t26_finseq_1, axiom, ![X1]:(((v1_relat_1(X1)&v1_funct_1(X1))&v1_finseq_1(X1))=>![X2]:(((v1_relat_1(X2)&v1_funct_1(X2))&v1_finseq_1(X2))=>r1_tarski(k4_finseq_1(X1),k4_finseq_1(k7_finseq_1(X1,X2))))), file('number14/number14__t20_number14', t26_finseq_1)).
fof(t92_finseq_1, axiom, ![X1, X2]:k4_finseq_1(k10_finseq_1(X1,X2))=k2_tarski(np__1,np__2), file('number14/number14__t20_number14', t92_finseq_1)).
fof(fc10_finseq_1, axiom, ![X1, X2]:v1_finseq_1(k10_finseq_1(X1,X2)), file('number14/number14__t20_number14', fc10_finseq_1)).
fof(fc8_finseq_1, axiom, ![X1, X2]:(v1_relat_1(k10_finseq_1(X1,X2))&v1_funct_1(k10_finseq_1(X1,X2))), file('number14/number14__t20_number14', fc8_finseq_1)).
fof(c_0_9, negated_conjecture, ~(![X1, X2, X3]:(((v1_relat_1(X3)&v1_funct_1(X3))&v1_finseq_1(X3))=>(r2_tarski(np__1,k4_finseq_1(k7_finseq_1(k10_finseq_1(X1,X2),X3)))&r2_tarski(np__2,k4_finseq_1(k7_finseq_1(k10_finseq_1(X1,X2),X3)))))), inference(assume_negation,[status(cth)],[t20_number14])).
fof(c_0_10, negated_conjecture, (((v1_relat_1(esk3_0)&v1_funct_1(esk3_0))&v1_finseq_1(esk3_0))&(~r2_tarski(np__1,k4_finseq_1(k7_finseq_1(k10_finseq_1(esk1_0,esk2_0),esk3_0)))|~r2_tarski(np__2,k4_finseq_1(k7_finseq_1(k10_finseq_1(esk1_0,esk2_0),esk3_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
fof(c_0_11, plain, ![X45, X46]:k10_finseq_1(X45,X46)=k7_finseq_1(k9_finseq_1(X45),k9_finseq_1(X46)), inference(variable_rename,[status(thm)],[d9_finseq_1])).
cnf(c_0_12, negated_conjecture, (~r2_tarski(np__1,k4_finseq_1(k7_finseq_1(k10_finseq_1(esk1_0,esk2_0),esk3_0)))|~r2_tarski(np__2,k4_finseq_1(k7_finseq_1(k10_finseq_1(esk1_0,esk2_0),esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_13, plain, (k10_finseq_1(X1,X2)=k7_finseq_1(k9_finseq_1(X1),k9_finseq_1(X2))), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_14, plain, ![X51, X52]:((~r2_tarski(X51,X52)|r2_hidden(X51,X52))&(~r2_hidden(X51,X52)|r2_tarski(X51,X52))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
fof(c_0_15, plain, ![X30, X31, X32, X33, X34, X35, X36, X37]:(((~r2_hidden(X33,X32)|(X33=X30|X33=X31)|X32!=k2_tarski(X30,X31))&((X34!=X30|r2_hidden(X34,X32)|X32!=k2_tarski(X30,X31))&(X34!=X31|r2_hidden(X34,X32)|X32!=k2_tarski(X30,X31))))&(((esk4_3(X35,X36,X37)!=X35|~r2_hidden(esk4_3(X35,X36,X37),X37)|X37=k2_tarski(X35,X36))&(esk4_3(X35,X36,X37)!=X36|~r2_hidden(esk4_3(X35,X36,X37),X37)|X37=k2_tarski(X35,X36)))&(r2_hidden(esk4_3(X35,X36,X37),X37)|(esk4_3(X35,X36,X37)=X35|esk4_3(X35,X36,X37)=X36)|X37=k2_tarski(X35,X36)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tarski])])])])])])).
cnf(c_0_16, negated_conjecture, (~r2_tarski(np__1,k4_finseq_1(k7_finseq_1(k7_finseq_1(k9_finseq_1(esk1_0),k9_finseq_1(esk2_0)),esk3_0)))|~r2_tarski(np__2,k4_finseq_1(k7_finseq_1(k7_finseq_1(k9_finseq_1(esk1_0),k9_finseq_1(esk2_0)),esk3_0)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_13]), c_0_13])).
cnf(c_0_17, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
fof(c_0_18, plain, ![X39, X40, X41, X42, X43]:((~r1_tarski(X39,X40)|(~r2_hidden(X41,X39)|r2_hidden(X41,X40)))&((r2_hidden(esk5_2(X42,X43),X42)|r1_tarski(X42,X43))&(~r2_hidden(esk5_2(X42,X43),X43)|r1_tarski(X42,X43)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])])).
fof(c_0_19, plain, ![X53, X54]:(~v1_relat_1(X53)|~v1_funct_1(X53)|~v1_finseq_1(X53)|(~v1_relat_1(X54)|~v1_funct_1(X54)|~v1_finseq_1(X54)|r1_tarski(k4_finseq_1(X53),k4_finseq_1(k7_finseq_1(X53,X54))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t26_finseq_1])])])).
fof(c_0_20, plain, ![X55, X56]:k4_finseq_1(k10_finseq_1(X55,X56))=k2_tarski(np__1,np__2), inference(variable_rename,[status(thm)],[t92_finseq_1])).
cnf(c_0_21, plain, (r2_hidden(X1,X3)|X1!=X2|X3!=k2_tarski(X4,X2)), inference(split_conjunct,[status(thm)],[c_0_15])).
fof(c_0_22, plain, ![X47, X48]:v1_finseq_1(k10_finseq_1(X47,X48)), inference(variable_rename,[status(thm)],[fc10_finseq_1])).
fof(c_0_23, plain, ![X49, X50]:(v1_relat_1(k10_finseq_1(X49,X50))&v1_funct_1(k10_finseq_1(X49,X50))), inference(variable_rename,[status(thm)],[fc8_finseq_1])).
cnf(c_0_24, negated_conjecture, (~r2_hidden(np__2,k4_finseq_1(k7_finseq_1(k7_finseq_1(k9_finseq_1(esk1_0),k9_finseq_1(esk2_0)),esk3_0)))|~r2_tarski(np__1,k4_finseq_1(k7_finseq_1(k7_finseq_1(k9_finseq_1(esk1_0),k9_finseq_1(esk2_0)),esk3_0)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
cnf(c_0_25, plain, (r2_hidden(X3,X2)|~r1_tarski(X1,X2)|~r2_hidden(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_26, plain, (r1_tarski(k4_finseq_1(X1),k4_finseq_1(k7_finseq_1(X1,X2)))|~v1_relat_1(X1)|~v1_funct_1(X1)|~v1_finseq_1(X1)|~v1_relat_1(X2)|~v1_funct_1(X2)|~v1_finseq_1(X2)), inference(split_conjunct,[status(thm)],[c_0_19])).
cnf(c_0_27, plain, (k4_finseq_1(k10_finseq_1(X1,X2))=k2_tarski(np__1,np__2)), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_28, plain, (r2_hidden(X1,X2)|X2!=k2_tarski(X3,X1)), inference(er,[status(thm)],[c_0_21])).
cnf(c_0_29, plain, (v1_finseq_1(k10_finseq_1(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_30, plain, (v1_funct_1(k10_finseq_1(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_31, plain, (v1_relat_1(k10_finseq_1(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_32, plain, (r2_hidden(X1,X3)|X1!=X2|X3!=k2_tarski(X2,X4)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_33, negated_conjecture, (~r2_hidden(np__2,k4_finseq_1(k7_finseq_1(k7_finseq_1(k9_finseq_1(esk1_0),k9_finseq_1(esk2_0)),esk3_0)))|~r2_hidden(np__1,k4_finseq_1(k7_finseq_1(k7_finseq_1(k9_finseq_1(esk1_0),k9_finseq_1(esk2_0)),esk3_0)))), inference(spm,[status(thm)],[c_0_24, c_0_17])).
cnf(c_0_34, plain, (r2_hidden(X1,k4_finseq_1(k7_finseq_1(X2,X3)))|~r2_hidden(X1,k4_finseq_1(X2))|~v1_finseq_1(X3)|~v1_finseq_1(X2)|~v1_funct_1(X3)|~v1_funct_1(X2)|~v1_relat_1(X3)|~v1_relat_1(X2)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
cnf(c_0_35, plain, (k4_finseq_1(k7_finseq_1(k9_finseq_1(X1),k9_finseq_1(X2)))=k2_tarski(np__1,np__2)), inference(rw,[status(thm)],[c_0_27, c_0_13])).
cnf(c_0_36, plain, (r2_hidden(X1,k2_tarski(X2,X1))), inference(er,[status(thm)],[c_0_28])).
cnf(c_0_37, negated_conjecture, (v1_finseq_1(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_38, plain, (v1_finseq_1(k7_finseq_1(k9_finseq_1(X1),k9_finseq_1(X2)))), inference(rw,[status(thm)],[c_0_29, c_0_13])).
cnf(c_0_39, negated_conjecture, (v1_funct_1(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_40, plain, (v1_funct_1(k7_finseq_1(k9_finseq_1(X1),k9_finseq_1(X2)))), inference(rw,[status(thm)],[c_0_30, c_0_13])).
cnf(c_0_41, negated_conjecture, (v1_relat_1(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_42, plain, (v1_relat_1(k7_finseq_1(k9_finseq_1(X1),k9_finseq_1(X2)))), inference(rw,[status(thm)],[c_0_31, c_0_13])).
cnf(c_0_43, plain, (r2_hidden(X1,X2)|X2!=k2_tarski(X1,X3)), inference(er,[status(thm)],[c_0_32])).
cnf(c_0_44, negated_conjecture, (~r2_hidden(np__1,k4_finseq_1(k7_finseq_1(k7_finseq_1(k9_finseq_1(esk1_0),k9_finseq_1(esk2_0)),esk3_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35]), c_0_36]), c_0_37]), c_0_38]), c_0_39]), c_0_40]), c_0_41]), c_0_42])])).
cnf(c_0_45, plain, (r2_hidden(X1,k2_tarski(X1,X2))), inference(er,[status(thm)],[c_0_43])).
cnf(c_0_46, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_34]), c_0_35]), c_0_45]), c_0_37]), c_0_38]), c_0_39]), c_0_40]), c_0_41]), c_0_42])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 47
# Proof object clause steps            : 28
# Proof object formula steps           : 19
# Proof object conjectures             : 12
# Proof object clause conjectures      : 9
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 14
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 7
# Proof object simplifying inferences  : 26
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 9
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 21
# Removed in clause preprocessing      : 1
# Initial clauses in saturation        : 20
# Processed clauses                    : 53
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 53
# Other redundant clauses eliminated   : 2
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 29
# ...of the previous two non-trivial   : 23
# Contextual simplify-reflections      : 0
# Paramodulations                      : 24
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 5
# 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  : 31
#    Positive orientable unit clauses  : 10
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 20
# Current number of unprocessed clauses: 10
# ...number of literals in the above   : 60
# Current number of archived formulas  : 0
# Current number of archived clauses   : 21
# Clause-clause subsumption calls (NU) : 338
# Rec. Clause-clause subsumption calls : 112
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 30
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 4
# BW rewrite match successes           : 0
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 2164

# -------------------------------------------------
# User time                : 0.026 s
# System time              : 0.000 s
# Total time               : 0.026 s
# Maximum resident set size: 3452 pages
