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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(l18_glpacy00, conjecture, ![X1]:((((v1_relat_1(X1)&v4_relat_1(X1,k4_ordinal1))&v1_funct_1(X1))&v1_partfun1(X1,k4_ordinal1))=>![X2]:(v7_ordinal1(X2)<=>r2_hidden(X2,k1_relset_1(k4_ordinal1,X1)))), file('glpacy00/glpacy00__l18_glpacy00', l18_glpacy00)).
fof(d2_partfun1, axiom, ![X1, X2]:((v1_relat_1(X2)&v4_relat_1(X2,X1))=>(v1_partfun1(X2,X1)<=>k1_relset_1(X1,X2)=X1)), file('glpacy00/glpacy00__l18_glpacy00', d2_partfun1)).
fof(d12_ordinal1, axiom, ![X1]:(v7_ordinal1(X1)<=>r2_hidden(X1,k4_ordinal1)), file('glpacy00/glpacy00__l18_glpacy00', d12_ordinal1)).
fof(c_0_3, negated_conjecture, ~(![X1]:((((v1_relat_1(X1)&v4_relat_1(X1,k4_ordinal1))&v1_funct_1(X1))&v1_partfun1(X1,k4_ordinal1))=>![X2]:(v7_ordinal1(X2)<=>r2_hidden(X2,k1_relset_1(k4_ordinal1,X1))))), inference(assume_negation,[status(cth)],[l18_glpacy00])).
fof(c_0_4, plain, ![X11, X12]:((~v1_partfun1(X12,X11)|k1_relset_1(X11,X12)=X11|(~v1_relat_1(X12)|~v4_relat_1(X12,X11)))&(k1_relset_1(X11,X12)!=X11|v1_partfun1(X12,X11)|(~v1_relat_1(X12)|~v4_relat_1(X12,X11)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_partfun1])])])).
fof(c_0_5, negated_conjecture, ((((v1_relat_1(esk1_0)&v4_relat_1(esk1_0,k4_ordinal1))&v1_funct_1(esk1_0))&v1_partfun1(esk1_0,k4_ordinal1))&((~v7_ordinal1(esk2_0)|~r2_hidden(esk2_0,k1_relset_1(k4_ordinal1,esk1_0)))&(v7_ordinal1(esk2_0)|r2_hidden(esk2_0,k1_relset_1(k4_ordinal1,esk1_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
cnf(c_0_6, plain, (k1_relset_1(X2,X1)=X2|~v1_partfun1(X1,X2)|~v1_relat_1(X1)|~v4_relat_1(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_7, negated_conjecture, (v1_partfun1(esk1_0,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_8, negated_conjecture, (v4_relat_1(esk1_0,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_9, negated_conjecture, (v1_relat_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
fof(c_0_10, plain, ![X10]:((~v7_ordinal1(X10)|r2_hidden(X10,k4_ordinal1))&(~r2_hidden(X10,k4_ordinal1)|v7_ordinal1(X10))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d12_ordinal1])])).
cnf(c_0_11, negated_conjecture, (~v7_ordinal1(esk2_0)|~r2_hidden(esk2_0,k1_relset_1(k4_ordinal1,esk1_0))), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_12, negated_conjecture, (k1_relset_1(k4_ordinal1,esk1_0)=k4_ordinal1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_7]), c_0_8]), c_0_9])])).
cnf(c_0_13, plain, (v7_ordinal1(X1)|~r2_hidden(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_14, negated_conjecture, (~r2_hidden(esk2_0,k4_ordinal1)), inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_12]), c_0_13])).
cnf(c_0_15, plain, (r2_hidden(X1,k4_ordinal1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_16, negated_conjecture, (v7_ordinal1(esk2_0)|r2_hidden(esk2_0,k1_relset_1(k4_ordinal1,esk1_0))), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_17, negated_conjecture, (~v7_ordinal1(esk2_0)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
cnf(c_0_18, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_12]), c_0_14]), c_0_17]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 19
# Proof object clause steps            : 12
# Proof object formula steps           : 7
# Proof object conjectures             : 12
# Proof object clause conjectures      : 9
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 8
# Proof object initial formulas used   : 3
# Proof object generating inferences   : 2
# Proof object simplifying inferences  : 8
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 3
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 10
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 10
# Processed clauses                    : 24
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 23
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 2
# Generated clauses                    : 5
# ...of the previous two non-trivial   : 4
# Contextual simplify-reflections      : 1
# Paramodulations                      : 5
# 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  : 11
#    Positive orientable unit clauses  : 5
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    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   : 12
# Clause-clause subsumption calls (NU) : 3
# Rec. Clause-clause subsumption calls : 3
# Non-unit clause-clause subsumptions  : 1
# 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          : 686

# -------------------------------------------------
# User time                : 0.018 s
# System time              : 0.011 s
# Total time               : 0.029 s
# Maximum resident set size: 3764 pages
