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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(cc11_card_1, axiom, ![X1]:((~(v1_xboole_0(X1))&v1_card_1(X1))=>![X2]:(v3_card_1(X2,X1)=>~(v1_xboole_0(X2)))), file('polnot_2/polnot_2__l5_polnot_2', cc11_card_1)).
fof(cc8_card_1, axiom, ![X1]:(v1_xboole_0(X1)=>v3_card_1(X1,k5_ordinal1)), file('polnot_2/polnot_2__l5_polnot_2', cc8_card_1)).
fof(cc3_card_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_card_1(X1)), file('polnot_2/polnot_2__l5_polnot_2', cc3_card_1)).
fof(fc8_ordinal1, axiom, v7_ordinal1(k5_ordinal1), file('polnot_2/polnot_2__l5_polnot_2', fc8_ordinal1)).
fof(t6_boole, axiom, ![X1]:(v1_xboole_0(X1)=>X1=k1_xboole_0), file('polnot_2/polnot_2__l5_polnot_2', t6_boole)).
fof(fc1_xboole_0, axiom, v1_xboole_0(k1_xboole_0), file('polnot_2/polnot_2__l5_polnot_2', fc1_xboole_0)).
fof(l5_polnot_2, conjecture, ![X1]:(((v1_relat_1(X1)&v1_funct_1(X1))&v1_polnot_2(X1))=>(v3_relat_1(X1)<=>![X2]:(r2_hidden(X2,k1_polnot_2(X1))=>k1_funct_1(X1,X2)=k5_ordinal1))), file('polnot_2/polnot_2__l5_polnot_2', l5_polnot_2)).
fof(redefinition_k1_polnot_2, axiom, ![X1]:(((v1_relat_1(X1)&v1_funct_1(X1))&v1_polnot_2(X1))=>k1_polnot_2(X1)=k9_xtuple_0(X1)), file('polnot_2/polnot_2__l5_polnot_2', redefinition_k1_polnot_2)).
fof(fc19_funct_1, axiom, ![X1, X2]:(((v1_relat_1(X1)&v3_relat_1(X1))&v1_funct_1(X1))=>v1_xboole_0(k1_funct_1(X1,X2))), file('polnot_2/polnot_2__l5_polnot_2', fc19_funct_1)).
fof(d8_funct_1, axiom, ![X1]:((v1_relat_1(X1)&v1_funct_1(X1))=>(v3_relat_1(X1)<=>![X2]:(r2_hidden(X2,k9_xtuple_0(X1))=>v1_xboole_0(k1_funct_1(X1,X2))))), file('polnot_2/polnot_2__l5_polnot_2', d8_funct_1)).
fof(c_0_10, plain, ![X1]:((~v1_xboole_0(X1)&v1_card_1(X1))=>![X2]:(v3_card_1(X2,X1)=>~v1_xboole_0(X2))), inference(fof_simplification,[status(thm)],[cc11_card_1])).
fof(c_0_11, plain, ![X18, X19]:(v1_xboole_0(X18)|~v1_card_1(X18)|(~v3_card_1(X19,X18)|~v1_xboole_0(X19))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
fof(c_0_12, plain, ![X21]:(~v1_xboole_0(X21)|v3_card_1(X21,k5_ordinal1)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_card_1])])).
cnf(c_0_13, plain, (v1_xboole_0(X1)|~v1_card_1(X1)|~v3_card_1(X2,X1)|~v1_xboole_0(X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_14, plain, (v3_card_1(X1,k5_ordinal1)|~v1_xboole_0(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
fof(c_0_15, plain, ![X20]:(~v7_ordinal1(X20)|v1_card_1(X20)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc3_card_1])])).
cnf(c_0_16, plain, (v1_xboole_0(k5_ordinal1)|~v1_card_1(k5_ordinal1)|~v1_xboole_0(X1)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
cnf(c_0_17, plain, (v1_card_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_18, plain, (v7_ordinal1(k5_ordinal1)), inference(split_conjunct,[status(thm)],[fc8_ordinal1])).
fof(c_0_19, plain, ![X28]:(~v1_xboole_0(X28)|X28=k1_xboole_0), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])).
cnf(c_0_20, plain, (v1_xboole_0(k5_ordinal1)|~v1_xboole_0(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])])).
cnf(c_0_21, plain, (v1_xboole_0(k1_xboole_0)), inference(split_conjunct,[status(thm)],[fc1_xboole_0])).
fof(c_0_22, negated_conjecture, ~(![X1]:(((v1_relat_1(X1)&v1_funct_1(X1))&v1_polnot_2(X1))=>(v3_relat_1(X1)<=>![X2]:(r2_hidden(X2,k1_polnot_2(X1))=>k1_funct_1(X1,X2)=k5_ordinal1)))), inference(assume_negation,[status(cth)],[l5_polnot_2])).
cnf(c_0_23, plain, (X1=k1_xboole_0|~v1_xboole_0(X1)), inference(split_conjunct,[status(thm)],[c_0_19])).
cnf(c_0_24, plain, (v1_xboole_0(k5_ordinal1)), inference(spm,[status(thm)],[c_0_20, c_0_21])).
fof(c_0_25, plain, ![X27]:(~v1_relat_1(X27)|~v1_funct_1(X27)|~v1_polnot_2(X27)|k1_polnot_2(X27)=k9_xtuple_0(X27)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k1_polnot_2])])).
fof(c_0_26, negated_conjecture, ![X17]:(((v1_relat_1(esk1_0)&v1_funct_1(esk1_0))&v1_polnot_2(esk1_0))&(((r2_hidden(esk2_0,k1_polnot_2(esk1_0))|~v3_relat_1(esk1_0))&(k1_funct_1(esk1_0,esk2_0)!=k5_ordinal1|~v3_relat_1(esk1_0)))&(v3_relat_1(esk1_0)|(~r2_hidden(X17,k1_polnot_2(esk1_0))|k1_funct_1(esk1_0,X17)=k5_ordinal1)))), 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_22])])])])])).
cnf(c_0_27, plain, (k1_xboole_0=k5_ordinal1), inference(spm,[status(thm)],[c_0_23, c_0_24])).
fof(c_0_28, plain, ![X25, X26]:(~v1_relat_1(X25)|~v3_relat_1(X25)|~v1_funct_1(X25)|v1_xboole_0(k1_funct_1(X25,X26))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc19_funct_1])])).
fof(c_0_29, plain, ![X22, X23]:((~v3_relat_1(X22)|(~r2_hidden(X23,k9_xtuple_0(X22))|v1_xboole_0(k1_funct_1(X22,X23)))|(~v1_relat_1(X22)|~v1_funct_1(X22)))&((r2_hidden(esk3_1(X22),k9_xtuple_0(X22))|v3_relat_1(X22)|(~v1_relat_1(X22)|~v1_funct_1(X22)))&(~v1_xboole_0(k1_funct_1(X22,esk3_1(X22)))|v3_relat_1(X22)|(~v1_relat_1(X22)|~v1_funct_1(X22))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_funct_1])])])])])).
cnf(c_0_30, plain, (k1_polnot_2(X1)=k9_xtuple_0(X1)|~v1_relat_1(X1)|~v1_funct_1(X1)|~v1_polnot_2(X1)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_31, negated_conjecture, (v1_polnot_2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_32, negated_conjecture, (v1_funct_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_33, negated_conjecture, (v1_relat_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_34, plain, (X1=k5_ordinal1|~v1_xboole_0(X1)), inference(rw,[status(thm)],[c_0_23, c_0_27])).
cnf(c_0_35, plain, (v1_xboole_0(k1_funct_1(X1,X2))|~v1_relat_1(X1)|~v3_relat_1(X1)|~v1_funct_1(X1)), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_36, plain, (r2_hidden(esk3_1(X1),k9_xtuple_0(X1))|v3_relat_1(X1)|~v1_relat_1(X1)|~v1_funct_1(X1)), inference(split_conjunct,[status(thm)],[c_0_29])).
cnf(c_0_37, negated_conjecture, (k9_xtuple_0(esk1_0)=k1_polnot_2(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32]), c_0_33])])).
cnf(c_0_38, negated_conjecture, (k1_funct_1(esk1_0,esk2_0)!=k5_ordinal1|~v3_relat_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_39, plain, (k1_funct_1(X1,X2)=k5_ordinal1|~v3_relat_1(X1)|~v1_funct_1(X1)|~v1_relat_1(X1)), inference(spm,[status(thm)],[c_0_34, c_0_35])).
cnf(c_0_40, negated_conjecture, (r2_hidden(esk3_1(esk1_0),k1_polnot_2(esk1_0))|v3_relat_1(esk1_0)), inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_32]), c_0_33])]), c_0_37])).
cnf(c_0_41, negated_conjecture, (~v3_relat_1(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_32]), c_0_33])])).
cnf(c_0_42, negated_conjecture, (v3_relat_1(esk1_0)|k1_funct_1(esk1_0,X1)=k5_ordinal1|~r2_hidden(X1,k1_polnot_2(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_43, negated_conjecture, (r2_hidden(esk3_1(esk1_0),k1_polnot_2(esk1_0))), inference(sr,[status(thm)],[c_0_40, c_0_41])).
cnf(c_0_44, plain, (v3_relat_1(X1)|~v1_xboole_0(k1_funct_1(X1,esk3_1(X1)))|~v1_relat_1(X1)|~v1_funct_1(X1)), inference(split_conjunct,[status(thm)],[c_0_29])).
cnf(c_0_45, negated_conjecture, (k1_funct_1(esk1_0,esk3_1(esk1_0))=k5_ordinal1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_43]), c_0_41])).
cnf(c_0_46, negated_conjecture, ($false), 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_44, c_0_45]), c_0_24]), c_0_32]), c_0_33])]), c_0_41]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 47
# Proof object clause steps            : 27
# Proof object formula steps           : 20
# Proof object conjectures             : 14
# Proof object clause conjectures      : 11
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 15
# Proof object initial formulas used   : 10
# Proof object generating inferences   : 10
# Proof object simplifying inferences  : 19
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 10
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 17
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 17
# Processed clauses                    : 44
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 43
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 3
# Generated clauses                    : 19
# ...of the previous two non-trivial   : 14
# Contextual simplify-reflections      : 0
# Paramodulations                      : 18
# 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  : 22
#    Positive orientable unit clauses  : 9
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 12
# Current number of unprocessed clauses: 1
# ...number of literals in the above   : 2
# Current number of archived formulas  : 0
# Current number of archived clauses   : 21
# Clause-clause subsumption calls (NU) : 87
# Rec. Clause-clause subsumption calls : 65
# Non-unit clause-clause subsumptions  : 2
# Unit Clause-clause subsumption calls : 5
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 2
# BW rewrite match successes           : 2
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 1622

# -------------------------------------------------
# User time                : 0.012 s
# System time              : 0.008 s
# Total time               : 0.020 s
# Maximum resident set size: 2860 pages
