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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t38_finseq_1, axiom, ![X1]:(((v1_relat_1(X1)&v1_funct_1(X1))&v1_finseq_1(X1))=>![X2]:(X1=k9_finseq_1(X2)<=>(k4_finseq_1(X1)=k2_finseq_1(np__1)&k10_xtuple_0(X1)=k1_tarski(X2)))), file('proofs_1/proofs_1__t8_proofs_1', t38_finseq_1)).
fof(redefinition_k9_finseq_1, axiom, ![X1]:k9_finseq_1(X1)=k5_finseq_1(X1), file('proofs_1/proofs_1__t8_proofs_1', redefinition_k9_finseq_1)).
fof(t1_proofs_1, axiom, ![X1]:(~(v1_xboole_0(X1))=>![X2]:((v1_relat_1(X2)&v1_proofs_1(X2))=>![X3]:(m1_subset_1(X3,X1)=>v2_proofs_1(k12_finseq_1(X1,X3),X1,X2)))), file('proofs_1/proofs_1__t8_proofs_1', t1_proofs_1)).
fof(redefinition_k12_finseq_1, axiom, ![X1, X2]:((~(v1_xboole_0(X1))&m1_subset_1(X2,X1))=>k12_finseq_1(X1,X2)=k5_finseq_1(X2)), file('proofs_1/proofs_1__t8_proofs_1', redefinition_k12_finseq_1)).
fof(d10_proofs_1, axiom, ![X1, X2, X3]:((v1_relat_1(X3)&v1_proofs_1(X3))=>(r2_proofs_1(X1,X2,X3)<=>?[X4]:((((v1_relat_1(X4)&v1_funct_1(X4))&v1_finseq_1(X4))&r2_hidden(X2,k1_proofs_1(X4)))&v2_proofs_1(X4,X1,X3)))), file('proofs_1/proofs_1__t8_proofs_1', d10_proofs_1)).
fof(redefinition_k1_proofs_1, axiom, ![X1]:(((v1_relat_1(X1)&v1_funct_1(X1))&v1_finseq_1(X1))=>k1_proofs_1(X1)=k10_xtuple_0(X1)), file('proofs_1/proofs_1__t8_proofs_1', redefinition_k1_proofs_1)).
fof(fc7_finseq_1, axiom, ![X1]:v1_finseq_1(k5_finseq_1(X1)), file('proofs_1/proofs_1__t8_proofs_1', fc7_finseq_1)).
fof(fc6_finseq_1, axiom, ![X1]:(v1_relat_1(k5_finseq_1(X1))&v1_funct_1(k5_finseq_1(X1))), file('proofs_1/proofs_1__t8_proofs_1', fc6_finseq_1)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('proofs_1/proofs_1__t8_proofs_1', t1_subset)).
fof(t7_boole, axiom, ![X1, X2]:~((r2_tarski(X1,X2)&v1_xboole_0(X2))), file('proofs_1/proofs_1__t8_proofs_1', t7_boole)).
fof(d1_tarski, axiom, ![X1, X2]:(X2=k1_tarski(X1)<=>![X3]:(r2_hidden(X3,X2)<=>X3=X1)), file('proofs_1/proofs_1__t8_proofs_1', d1_tarski)).
fof(t8_proofs_1, conjecture, ![X1, X2]:((v1_relat_1(X2)&v1_proofs_1(X2))=>![X3]:(r2_hidden(X3,X1)=>r2_proofs_1(X1,X3,X2))), file('proofs_1/proofs_1__t8_proofs_1', t8_proofs_1)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('proofs_1/proofs_1__t8_proofs_1', redefinition_r2_tarski)).
fof(c_0_13, plain, ![X60, X61]:(((k4_finseq_1(X60)=k2_finseq_1(np__1)|X60!=k9_finseq_1(X61)|(~v1_relat_1(X60)|~v1_funct_1(X60)|~v1_finseq_1(X60)))&(k10_xtuple_0(X60)=k1_tarski(X61)|X60!=k9_finseq_1(X61)|(~v1_relat_1(X60)|~v1_funct_1(X60)|~v1_finseq_1(X60))))&(k4_finseq_1(X60)!=k2_finseq_1(np__1)|k10_xtuple_0(X60)!=k1_tarski(X61)|X60=k9_finseq_1(X61)|(~v1_relat_1(X60)|~v1_funct_1(X60)|~v1_finseq_1(X60)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t38_finseq_1])])])])).
fof(c_0_14, plain, ![X52]:k9_finseq_1(X52)=k5_finseq_1(X52), inference(variable_rename,[status(thm)],[redefinition_k9_finseq_1])).
fof(c_0_15, plain, ![X1]:(~v1_xboole_0(X1)=>![X2]:((v1_relat_1(X2)&v1_proofs_1(X2))=>![X3]:(m1_subset_1(X3,X1)=>v2_proofs_1(k12_finseq_1(X1,X3),X1,X2)))), inference(fof_simplification,[status(thm)],[t1_proofs_1])).
fof(c_0_16, plain, ![X1, X2]:((~v1_xboole_0(X1)&m1_subset_1(X2,X1))=>k12_finseq_1(X1,X2)=k5_finseq_1(X2)), inference(fof_simplification,[status(thm)],[redefinition_k12_finseq_1])).
fof(c_0_17, plain, ![X35, X36, X37, X39]:((((((v1_relat_1(esk4_3(X35,X36,X37))|~r2_proofs_1(X35,X36,X37)|(~v1_relat_1(X37)|~v1_proofs_1(X37)))&(v1_funct_1(esk4_3(X35,X36,X37))|~r2_proofs_1(X35,X36,X37)|(~v1_relat_1(X37)|~v1_proofs_1(X37))))&(v1_finseq_1(esk4_3(X35,X36,X37))|~r2_proofs_1(X35,X36,X37)|(~v1_relat_1(X37)|~v1_proofs_1(X37))))&(r2_hidden(X36,k1_proofs_1(esk4_3(X35,X36,X37)))|~r2_proofs_1(X35,X36,X37)|(~v1_relat_1(X37)|~v1_proofs_1(X37))))&(v2_proofs_1(esk4_3(X35,X36,X37),X35,X37)|~r2_proofs_1(X35,X36,X37)|(~v1_relat_1(X37)|~v1_proofs_1(X37))))&(~v1_relat_1(X39)|~v1_funct_1(X39)|~v1_finseq_1(X39)|~r2_hidden(X36,k1_proofs_1(X39))|~v2_proofs_1(X39,X35,X37)|r2_proofs_1(X35,X36,X37)|(~v1_relat_1(X37)|~v1_proofs_1(X37)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_proofs_1])])])])])).
fof(c_0_18, plain, ![X51]:(~v1_relat_1(X51)|~v1_funct_1(X51)|~v1_finseq_1(X51)|k1_proofs_1(X51)=k10_xtuple_0(X51)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k1_proofs_1])])).
cnf(c_0_19, plain, (k10_xtuple_0(X1)=k1_tarski(X2)|X1!=k9_finseq_1(X2)|~v1_relat_1(X1)|~v1_funct_1(X1)|~v1_finseq_1(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_20, plain, (k9_finseq_1(X1)=k5_finseq_1(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
fof(c_0_21, plain, ![X48]:v1_finseq_1(k5_finseq_1(X48)), inference(variable_rename,[status(thm)],[fc7_finseq_1])).
fof(c_0_22, plain, ![X47]:(v1_relat_1(k5_finseq_1(X47))&v1_funct_1(k5_finseq_1(X47))), inference(variable_rename,[status(thm)],[fc6_finseq_1])).
fof(c_0_23, plain, ![X55, X56, X57]:(v1_xboole_0(X55)|(~v1_relat_1(X56)|~v1_proofs_1(X56)|(~m1_subset_1(X57,X55)|v2_proofs_1(k12_finseq_1(X55,X57),X55,X56)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])).
fof(c_0_24, plain, ![X58, X59]:(~r2_tarski(X58,X59)|m1_subset_1(X58,X59)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
fof(c_0_25, plain, ![X62, X63]:(~r2_tarski(X62,X63)|~v1_xboole_0(X63)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])).
fof(c_0_26, plain, ![X49, X50]:(v1_xboole_0(X49)|~m1_subset_1(X50,X49)|k12_finseq_1(X49,X50)=k5_finseq_1(X50)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])).
cnf(c_0_27, plain, (r2_proofs_1(X3,X2,X4)|~v1_relat_1(X1)|~v1_funct_1(X1)|~v1_finseq_1(X1)|~r2_hidden(X2,k1_proofs_1(X1))|~v2_proofs_1(X1,X3,X4)|~v1_relat_1(X4)|~v1_proofs_1(X4)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_28, plain, (k1_proofs_1(X1)=k10_xtuple_0(X1)|~v1_relat_1(X1)|~v1_funct_1(X1)|~v1_finseq_1(X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_29, plain, (k10_xtuple_0(X1)=k1_tarski(X2)|X1!=k5_finseq_1(X2)|~v1_relat_1(X1)|~v1_funct_1(X1)|~v1_finseq_1(X1)), inference(rw,[status(thm)],[c_0_19, c_0_20])).
cnf(c_0_30, plain, (v1_finseq_1(k5_finseq_1(X1))), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_31, plain, (v1_funct_1(k5_finseq_1(X1))), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_32, plain, (v1_relat_1(k5_finseq_1(X1))), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_33, plain, (v1_xboole_0(X1)|v2_proofs_1(k12_finseq_1(X1,X3),X1,X2)|~v1_relat_1(X2)|~v1_proofs_1(X2)|~m1_subset_1(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_34, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_35, plain, (~r2_tarski(X1,X2)|~v1_xboole_0(X2)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_36, plain, (v1_xboole_0(X1)|k12_finseq_1(X1,X2)=k5_finseq_1(X2)|~m1_subset_1(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_37, plain, (r2_proofs_1(X1,X2,X3)|~v2_proofs_1(X4,X1,X3)|~v1_finseq_1(X4)|~v1_funct_1(X4)|~r2_hidden(X2,k10_xtuple_0(X4))|~v1_proofs_1(X3)|~v1_relat_1(X3)|~v1_relat_1(X4)), inference(spm,[status(thm)],[c_0_27, c_0_28])).
cnf(c_0_38, plain, (k10_xtuple_0(k5_finseq_1(X1))=k1_tarski(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_29]), c_0_30]), c_0_31]), c_0_32])])).
cnf(c_0_39, plain, (v2_proofs_1(k12_finseq_1(X1,X2),X1,X3)|~r2_tarski(X2,X1)|~v1_proofs_1(X3)|~v1_relat_1(X3)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35])).
cnf(c_0_40, plain, (k12_finseq_1(X1,X2)=k5_finseq_1(X2)|~r2_tarski(X2,X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_34]), c_0_35])).
fof(c_0_41, plain, ![X40, X41, X42, X43, X44, X45]:(((~r2_hidden(X42,X41)|X42=X40|X41!=k1_tarski(X40))&(X43!=X40|r2_hidden(X43,X41)|X41!=k1_tarski(X40)))&((~r2_hidden(esk5_2(X44,X45),X45)|esk5_2(X44,X45)!=X44|X45=k1_tarski(X44))&(r2_hidden(esk5_2(X44,X45),X45)|esk5_2(X44,X45)=X44|X45=k1_tarski(X44)))), 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)],[d1_tarski])])])])])])).
fof(c_0_42, negated_conjecture, ~(![X1, X2]:((v1_relat_1(X2)&v1_proofs_1(X2))=>![X3]:(r2_hidden(X3,X1)=>r2_proofs_1(X1,X3,X2)))), inference(assume_negation,[status(cth)],[t8_proofs_1])).
cnf(c_0_43, plain, (r2_proofs_1(X1,X2,X3)|~v2_proofs_1(k5_finseq_1(X4),X1,X3)|~r2_hidden(X2,k1_tarski(X4))|~v1_proofs_1(X3)|~v1_relat_1(X3)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_30]), c_0_31]), c_0_32])])).
cnf(c_0_44, plain, (v2_proofs_1(k5_finseq_1(X1),X2,X3)|~r2_tarski(X1,X2)|~v1_proofs_1(X3)|~v1_relat_1(X3)), inference(spm,[status(thm)],[c_0_39, c_0_40])).
cnf(c_0_45, plain, (r2_hidden(X1,X3)|X1!=X2|X3!=k1_tarski(X2)), inference(split_conjunct,[status(thm)],[c_0_41])).
fof(c_0_46, negated_conjecture, ((v1_relat_1(esk2_0)&v1_proofs_1(esk2_0))&(r2_hidden(esk3_0,esk1_0)&~r2_proofs_1(esk1_0,esk3_0,esk2_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])])).
cnf(c_0_47, plain, (r2_proofs_1(X1,X2,X3)|~r2_tarski(X4,X1)|~r2_hidden(X2,k1_tarski(X4))|~v1_proofs_1(X3)|~v1_relat_1(X3)), inference(spm,[status(thm)],[c_0_43, c_0_44])).
cnf(c_0_48, plain, (r2_hidden(X1,k1_tarski(X1))), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_45])])).
cnf(c_0_49, negated_conjecture, (~r2_proofs_1(esk1_0,esk3_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_46])).
cnf(c_0_50, plain, (r2_proofs_1(X1,X2,X3)|~r2_tarski(X2,X1)|~v1_proofs_1(X3)|~v1_relat_1(X3)), inference(spm,[status(thm)],[c_0_47, c_0_48])).
cnf(c_0_51, negated_conjecture, (v1_proofs_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_46])).
cnf(c_0_52, negated_conjecture, (v1_relat_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_46])).
fof(c_0_53, plain, ![X53, X54]:((~r2_tarski(X53,X54)|r2_hidden(X53,X54))&(~r2_hidden(X53,X54)|r2_tarski(X53,X54))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_54, negated_conjecture, (~r2_tarski(esk3_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_50]), c_0_51]), c_0_52])])).
cnf(c_0_55, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_53])).
cnf(c_0_56, negated_conjecture, (r2_hidden(esk3_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_46])).
cnf(c_0_57, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54, c_0_55]), c_0_56])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 58
# Proof object clause steps            : 29
# Proof object formula steps           : 29
# Proof object conjectures             : 9
# Proof object clause conjectures      : 6
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 17
# Proof object initial formulas used   : 13
# Proof object generating inferences   : 9
# Proof object simplifying inferences  : 19
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 13
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 28
# Removed in clause preprocessing      : 1
# Initial clauses in saturation        : 27
# Processed clauses                    : 77
# ...of these trivial                  : 1
# ...subsumed                          : 0
# ...remaining for further processing  : 76
# Other redundant clauses eliminated   : 8
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 40
# ...of the previous two non-trivial   : 28
# Contextual simplify-reflections      : 5
# Paramodulations                      : 30
# Factorizations                       : 2
# NegExts                              : 0
# Equation resolutions                 : 9
# 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  : 45
#    Positive orientable unit clauses  : 9
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 4
#    Non-unit-clauses                  : 32
# Current number of unprocessed clauses: 5
# ...number of literals in the above   : 41
# Current number of archived formulas  : 0
# Current number of archived clauses   : 28
# Clause-clause subsumption calls (NU) : 556
# Rec. Clause-clause subsumption calls : 143
# Non-unit clause-clause subsumptions  : 5
# Unit Clause-clause subsumption calls : 15
# 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          : 2999

# -------------------------------------------------
# User time                : 0.016 s
# System time              : 0.002 s
# Total time               : 0.018 s
# Maximum resident set size: 3500 pages
