# 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.016 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(d15_polnot_2, axiom, ![X1]:((~(v1_xboole_0(X1))&v4_finseq_1(X1))=>![X2]:(v7_ordinal1(X2)=>k8_polnot_2(X1,X2)=a_2_1_polnot_2(X1,X2))), file('polnot_2/polnot_2__l28_polnot_2', d15_polnot_2)).
fof(l28_polnot_2, conjecture, ![X1]:((~(v1_xboole_0(X1))&v4_finseq_1(X1))=>![X2]:(((v1_relat_1(X2)&v1_funct_1(X2))&v1_finseq_1(X2))=>![X3]:(v7_ordinal1(X3)=>(r2_tarski(X2,k8_polnot_2(X1,X3))<=>(r2_tarski(X2,X1)&r1_xxreal_0(k3_finseq_1(X2),X3)))))), file('polnot_2/polnot_2__l28_polnot_2', l28_polnot_2)).
fof(fraenkel_a_2_1_polnot_2, axiom, ![X1, X2, X3]:(((~(v1_xboole_0(X2))&v4_finseq_1(X2))&v7_ordinal1(X3))=>(r2_hidden(X1,a_2_1_polnot_2(X2,X3))<=>?[X4]:((m1_subset_1(X4,X2)&X1=X4)&r1_xxreal_0(k3_finseq_1(X4),X3)))), file('polnot_2/polnot_2__l28_polnot_2', fraenkel_a_2_1_polnot_2)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('polnot_2/polnot_2__l28_polnot_2', redefinition_r2_tarski)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('polnot_2/polnot_2__l28_polnot_2', t1_subset)).
fof(t2_subset, axiom, ![X1, X2]:(m1_subset_1(X1,X2)=>(v1_xboole_0(X2)|r2_tarski(X1,X2))), file('polnot_2/polnot_2__l28_polnot_2', t2_subset)).
fof(c_0_6, plain, ![X1]:((~v1_xboole_0(X1)&v4_finseq_1(X1))=>![X2]:(v7_ordinal1(X2)=>k8_polnot_2(X1,X2)=a_2_1_polnot_2(X1,X2))), inference(fof_simplification,[status(thm)],[d15_polnot_2])).
fof(c_0_7, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v4_finseq_1(X1))=>![X2]:(((v1_relat_1(X2)&v1_funct_1(X2))&v1_finseq_1(X2))=>![X3]:(v7_ordinal1(X3)=>(r2_tarski(X2,k8_polnot_2(X1,X3))<=>(r2_tarski(X2,X1)&r1_xxreal_0(k3_finseq_1(X2),X3))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l28_polnot_2])])).
fof(c_0_8, plain, ![X23, X24]:(v1_xboole_0(X23)|~v4_finseq_1(X23)|(~v7_ordinal1(X24)|k8_polnot_2(X23,X24)=a_2_1_polnot_2(X23,X24))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
fof(c_0_9, negated_conjecture, ((~v1_xboole_0(esk1_0)&v4_finseq_1(esk1_0))&(((v1_relat_1(esk2_0)&v1_funct_1(esk2_0))&v1_finseq_1(esk2_0))&(v7_ordinal1(esk3_0)&((~r2_tarski(esk2_0,k8_polnot_2(esk1_0,esk3_0))|(~r2_tarski(esk2_0,esk1_0)|~r1_xxreal_0(k3_finseq_1(esk2_0),esk3_0)))&((r2_tarski(esk2_0,esk1_0)|r2_tarski(esk2_0,k8_polnot_2(esk1_0,esk3_0)))&(r1_xxreal_0(k3_finseq_1(esk2_0),esk3_0)|r2_tarski(esk2_0,k8_polnot_2(esk1_0,esk3_0)))))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])).
fof(c_0_10, plain, ![X1, X2, X3]:(((~v1_xboole_0(X2)&v4_finseq_1(X2))&v7_ordinal1(X3))=>(r2_hidden(X1,a_2_1_polnot_2(X2,X3))<=>?[X4]:((m1_subset_1(X4,X2)&X1=X4)&r1_xxreal_0(k3_finseq_1(X4),X3)))), inference(fof_simplification,[status(thm)],[fraenkel_a_2_1_polnot_2])).
cnf(c_0_11, plain, (v1_xboole_0(X1)|k8_polnot_2(X1,X2)=a_2_1_polnot_2(X1,X2)|~v4_finseq_1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_12, negated_conjecture, (v7_ordinal1(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
fof(c_0_13, plain, ![X25, X26, X27, X29]:((((m1_subset_1(esk4_3(X25,X26,X27),X26)|~r2_hidden(X25,a_2_1_polnot_2(X26,X27))|(v1_xboole_0(X26)|~v4_finseq_1(X26)|~v7_ordinal1(X27)))&(X25=esk4_3(X25,X26,X27)|~r2_hidden(X25,a_2_1_polnot_2(X26,X27))|(v1_xboole_0(X26)|~v4_finseq_1(X26)|~v7_ordinal1(X27))))&(r1_xxreal_0(k3_finseq_1(esk4_3(X25,X26,X27)),X27)|~r2_hidden(X25,a_2_1_polnot_2(X26,X27))|(v1_xboole_0(X26)|~v4_finseq_1(X26)|~v7_ordinal1(X27))))&(~m1_subset_1(X29,X26)|X25!=X29|~r1_xxreal_0(k3_finseq_1(X29),X27)|r2_hidden(X25,a_2_1_polnot_2(X26,X27))|(v1_xboole_0(X26)|~v4_finseq_1(X26)|~v7_ordinal1(X27)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])).
fof(c_0_14, plain, ![X30, X31]:((~r2_tarski(X30,X31)|r2_hidden(X30,X31))&(~r2_hidden(X30,X31)|r2_tarski(X30,X31))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_15, negated_conjecture, (k8_polnot_2(X1,esk3_0)=a_2_1_polnot_2(X1,esk3_0)|v1_xboole_0(X1)|~v4_finseq_1(X1)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
cnf(c_0_16, negated_conjecture, (v4_finseq_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_17, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_18, plain, (m1_subset_1(esk4_3(X1,X2,X3),X2)|v1_xboole_0(X2)|~r2_hidden(X1,a_2_1_polnot_2(X2,X3))|~v4_finseq_1(X2)|~v7_ordinal1(X3)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_19, plain, (r2_hidden(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_20, negated_conjecture, (r2_tarski(esk2_0,esk1_0)|r2_tarski(esk2_0,k8_polnot_2(esk1_0,esk3_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_21, negated_conjecture, (k8_polnot_2(esk1_0,esk3_0)=a_2_1_polnot_2(esk1_0,esk3_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])).
cnf(c_0_22, plain, (X1=esk4_3(X1,X2,X3)|v1_xboole_0(X2)|~r2_hidden(X1,a_2_1_polnot_2(X2,X3))|~v4_finseq_1(X2)|~v7_ordinal1(X3)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_23, plain, (m1_subset_1(esk4_3(X1,X2,X3),X2)|v1_xboole_0(X2)|~r2_tarski(X1,a_2_1_polnot_2(X2,X3))|~v7_ordinal1(X3)|~v4_finseq_1(X2)), inference(spm,[status(thm)],[c_0_18, c_0_19])).
cnf(c_0_24, negated_conjecture, (r2_tarski(esk2_0,a_2_1_polnot_2(esk1_0,esk3_0))|r2_tarski(esk2_0,esk1_0)), inference(rw,[status(thm)],[c_0_20, c_0_21])).
cnf(c_0_25, plain, (esk4_3(X1,X2,X3)=X1|v1_xboole_0(X2)|~r2_tarski(X1,a_2_1_polnot_2(X2,X3))|~v7_ordinal1(X3)|~v4_finseq_1(X2)), inference(spm,[status(thm)],[c_0_22, c_0_19])).
fof(c_0_26, plain, ![X32, X33]:(~r2_tarski(X32,X33)|m1_subset_1(X32,X33)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
cnf(c_0_27, plain, (r2_hidden(X3,a_2_1_polnot_2(X2,X4))|v1_xboole_0(X2)|~m1_subset_1(X1,X2)|X3!=X1|~r1_xxreal_0(k3_finseq_1(X1),X4)|~v4_finseq_1(X2)|~v7_ordinal1(X4)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_28, negated_conjecture, (r1_xxreal_0(k3_finseq_1(esk2_0),esk3_0)|r2_tarski(esk2_0,k8_polnot_2(esk1_0,esk3_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
fof(c_0_29, plain, ![X34, X35]:(~m1_subset_1(X34,X35)|(v1_xboole_0(X35)|r2_tarski(X34,X35))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])).
cnf(c_0_30, negated_conjecture, (m1_subset_1(esk4_3(esk2_0,esk1_0,esk3_0),esk1_0)|r2_tarski(esk2_0,esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_12]), c_0_16])]), c_0_17])).
cnf(c_0_31, negated_conjecture, (esk4_3(esk2_0,esk1_0,esk3_0)=esk2_0|r2_tarski(esk2_0,esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_24]), c_0_12]), c_0_16])]), c_0_17])).
cnf(c_0_32, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_33, plain, (r2_hidden(X1,a_2_1_polnot_2(X2,X3))|v1_xboole_0(X2)|~m1_subset_1(X1,X2)|~r1_xxreal_0(k3_finseq_1(X1),X3)|~v7_ordinal1(X3)|~v4_finseq_1(X2)), inference(er,[status(thm)],[c_0_27])).
cnf(c_0_34, negated_conjecture, (r1_xxreal_0(k3_finseq_1(esk2_0),esk3_0)|r2_tarski(esk2_0,a_2_1_polnot_2(esk1_0,esk3_0))), inference(rw,[status(thm)],[c_0_28, c_0_21])).
cnf(c_0_35, negated_conjecture, (~r2_tarski(esk2_0,k8_polnot_2(esk1_0,esk3_0))|~r2_tarski(esk2_0,esk1_0)|~r1_xxreal_0(k3_finseq_1(esk2_0),esk3_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_36, plain, (v1_xboole_0(X2)|r2_tarski(X1,X2)|~m1_subset_1(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_29])).
cnf(c_0_37, negated_conjecture, (m1_subset_1(esk2_0,esk1_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32])).
cnf(c_0_38, negated_conjecture, (r2_hidden(esk2_0,a_2_1_polnot_2(X1,esk3_0))|r2_tarski(esk2_0,a_2_1_polnot_2(esk1_0,esk3_0))|v1_xboole_0(X1)|~m1_subset_1(esk2_0,X1)|~v4_finseq_1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_12])])).
cnf(c_0_39, negated_conjecture, (~r1_xxreal_0(k3_finseq_1(esk2_0),esk3_0)|~r2_tarski(esk2_0,a_2_1_polnot_2(esk1_0,esk3_0))|~r2_tarski(esk2_0,esk1_0)), inference(rw,[status(thm)],[c_0_35, c_0_21])).
cnf(c_0_40, negated_conjecture, (r2_tarski(esk2_0,esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_17])).
cnf(c_0_41, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_42, negated_conjecture, (r2_hidden(esk2_0,a_2_1_polnot_2(esk1_0,esk3_0))), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_37]), c_0_16])]), c_0_17]), c_0_19])).
cnf(c_0_43, plain, (r1_xxreal_0(k3_finseq_1(esk4_3(X1,X2,X3)),X3)|v1_xboole_0(X2)|~r2_hidden(X1,a_2_1_polnot_2(X2,X3))|~v4_finseq_1(X2)|~v7_ordinal1(X3)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_44, negated_conjecture, (~r1_xxreal_0(k3_finseq_1(esk2_0),esk3_0)|~r2_tarski(esk2_0,a_2_1_polnot_2(esk1_0,esk3_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39, c_0_40])])).
cnf(c_0_45, negated_conjecture, (r2_tarski(esk2_0,a_2_1_polnot_2(esk1_0,esk3_0))), inference(spm,[status(thm)],[c_0_41, c_0_42])).
cnf(c_0_46, plain, (r1_xxreal_0(k3_finseq_1(esk4_3(X1,X2,X3)),X3)|v1_xboole_0(X2)|~r2_tarski(X1,a_2_1_polnot_2(X2,X3))|~v7_ordinal1(X3)|~v4_finseq_1(X2)), inference(spm,[status(thm)],[c_0_43, c_0_19])).
cnf(c_0_47, negated_conjecture, (esk4_3(esk2_0,esk1_0,esk3_0)=esk2_0), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_42]), c_0_12]), c_0_16])]), c_0_17])).
cnf(c_0_48, negated_conjecture, (~r1_xxreal_0(k3_finseq_1(esk2_0),esk3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44, c_0_45])])).
cnf(c_0_49, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46, c_0_45]), c_0_47]), c_0_12]), c_0_16])]), c_0_17]), c_0_48]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 50
# Proof object clause steps            : 35
# Proof object formula steps           : 15
# Proof object conjectures             : 25
# Proof object clause conjectures      : 22
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 15
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 14
# Proof object simplifying inferences  : 35
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 18
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 18
# Processed clauses                    : 60
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 58
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 13
# Generated clauses                    : 33
# ...of the previous two non-trivial   : 30
# Contextual simplify-reflections      : 2
# Paramodulations                      : 32
# 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  : 26
#    Positive orientable unit clauses  : 11
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 13
# Current number of unprocessed clauses: 5
# ...number of literals in the above   : 14
# Current number of archived formulas  : 0
# Current number of archived clauses   : 31
# Clause-clause subsumption calls (NU) : 126
# Rec. Clause-clause subsumption calls : 63
# Non-unit clause-clause subsumptions  : 3
# Unit Clause-clause subsumption calls : 14
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 3
# BW rewrite match successes           : 3
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 2060

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.000 s
# Total time               : 0.021 s
# Maximum resident set size: 2868 pages
