# No SInE strategy applied
# Trying AutoSched0 for 161 seconds
# AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4S
# and selection function SelectNewComplexAHPNS.
#
# Preprocessing time       : 0.023 s

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t20_glpacy00, conjecture, ![X1]:(((((v1_relat_1(X1)&v4_relat_1(X1,k4_ordinal1))&v1_funct_1(X1))&v1_finset_1(X1))&v1_glib_000(X1))=>![X2]:(((((v1_relat_1(X2)&v4_relat_1(X2,k4_ordinal1))&v1_funct_1(X2))&v1_finset_1(X2))&v1_glib_000(X2))=>((r5_glib_000(X1,X2)&v1_glpacy00(X1))=>v1_glpacy00(X2)))), file('glpacy00/glpacy00__t20_glpacy00', t20_glpacy00)).
fof(l21_glpacy00, axiom, ![X1]:(((((v1_relat_1(X1)&v4_relat_1(X1,k4_ordinal1))&v1_funct_1(X1))&v1_finset_1(X1))&v1_glib_000(X1))=>![X2]:(((((v1_relat_1(X2)&v4_relat_1(X2,k4_ordinal1))&v1_funct_1(X2))&v1_finset_1(X2))&v1_glib_000(X2))=>((r5_glib_000(X1,X2)&v1_glpacy00(X1))=>v1_glpacy00(X2)))), file('glpacy00/glpacy00__t20_glpacy00', l21_glpacy00)).
fof(c_0_2, negated_conjecture, ~(![X1]:(((((v1_relat_1(X1)&v4_relat_1(X1,k4_ordinal1))&v1_funct_1(X1))&v1_finset_1(X1))&v1_glib_000(X1))=>![X2]:(((((v1_relat_1(X2)&v4_relat_1(X2,k4_ordinal1))&v1_funct_1(X2))&v1_finset_1(X2))&v1_glib_000(X2))=>((r5_glib_000(X1,X2)&v1_glpacy00(X1))=>v1_glpacy00(X2))))), inference(assume_negation,[status(cth)],[t20_glpacy00])).
fof(c_0_3, plain, ![X9, X10]:(~v1_relat_1(X9)|~v4_relat_1(X9,k4_ordinal1)|~v1_funct_1(X9)|~v1_finset_1(X9)|~v1_glib_000(X9)|(~v1_relat_1(X10)|~v4_relat_1(X10,k4_ordinal1)|~v1_funct_1(X10)|~v1_finset_1(X10)|~v1_glib_000(X10)|(~r5_glib_000(X9,X10)|~v1_glpacy00(X9)|v1_glpacy00(X10)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l21_glpacy00])])])).
fof(c_0_4, negated_conjecture, (((((v1_relat_1(esk1_0)&v4_relat_1(esk1_0,k4_ordinal1))&v1_funct_1(esk1_0))&v1_finset_1(esk1_0))&v1_glib_000(esk1_0))&(((((v1_relat_1(esk2_0)&v4_relat_1(esk2_0,k4_ordinal1))&v1_funct_1(esk2_0))&v1_finset_1(esk2_0))&v1_glib_000(esk2_0))&((r5_glib_000(esk1_0,esk2_0)&v1_glpacy00(esk1_0))&~v1_glpacy00(esk2_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])).
cnf(c_0_5, plain, (v1_glpacy00(X2)|~v1_relat_1(X1)|~v4_relat_1(X1,k4_ordinal1)|~v1_funct_1(X1)|~v1_finset_1(X1)|~v1_glib_000(X1)|~v1_relat_1(X2)|~v4_relat_1(X2,k4_ordinal1)|~v1_funct_1(X2)|~v1_finset_1(X2)|~v1_glib_000(X2)|~r5_glib_000(X1,X2)|~v1_glpacy00(X1)), inference(split_conjunct,[status(thm)],[c_0_3])).
cnf(c_0_6, negated_conjecture, (v4_relat_1(esk2_0,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_7, negated_conjecture, (v1_glib_000(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_8, negated_conjecture, (v1_finset_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_9, negated_conjecture, (v1_funct_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_10, negated_conjecture, (v1_relat_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_11, negated_conjecture, (~v1_glpacy00(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_12, negated_conjecture, (~v1_glpacy00(X1)|~r5_glib_000(X1,esk2_0)|~v1_glib_000(X1)|~v1_finset_1(X1)|~v1_funct_1(X1)|~v4_relat_1(X1,k4_ordinal1)|~v1_relat_1(X1)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7]), c_0_8]), c_0_9]), c_0_10])]), c_0_11])).
cnf(c_0_13, negated_conjecture, (r5_glib_000(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_14, negated_conjecture, (v1_glpacy00(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_15, negated_conjecture, (v1_glib_000(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_16, negated_conjecture, (v1_finset_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_17, negated_conjecture, (v1_funct_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_18, negated_conjecture, (v4_relat_1(esk1_0,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_19, negated_conjecture, (v1_relat_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_20, 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(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14]), c_0_15]), c_0_16]), c_0_17]), c_0_18]), c_0_19])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 21
# Proof object clause steps            : 16
# Proof object formula steps           : 5
# Proof object conjectures             : 18
# Proof object clause conjectures      : 15
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 14
# Proof object initial formulas used   : 2
# Proof object generating inferences   : 2
# Proof object simplifying inferences  : 13
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 2
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 14
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 14
# Processed clauses                    : 15
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 15
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 3
# ...of the previous two non-trivial   : 1
# Contextual simplify-reflections      : 0
# Paramodulations                      : 3
# 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  : 15
#    Positive orientable unit clauses  : 12
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 2
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 0
# Clause-clause subsumption calls (NU) : 1
# Rec. Clause-clause subsumption calls : 0
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# 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          : 1039

# -------------------------------------------------
# User time                : 0.020 s
# System time              : 0.007 s
# Total time               : 0.027 s
# Maximum resident set size: 3056 pages
