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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(l11_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))&v2_chord(X1))=>~((r1_ordinal1(np__3,k14_glib_000(X1))&v2_glib_002(X1)))), file('glpacy00/glpacy00__l11_glpacy00', l11_glpacy00)).
fof(t100_glib_013, axiom, ![X1]:((((((v1_relat_1(X1)&v4_relat_1(X1,k4_ordinal1))&v1_funct_1(X1))&v1_finset_1(X1))&v1_glib_000(X1))&v2_chord(X1))=>~((r1_ordinal1(np__3,k14_glib_000(X1))&v2_glib_002(X1)))), file('glpacy00/glpacy00__l11_glpacy00', t100_glib_013)).
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))&v2_chord(X1))=>~((r1_ordinal1(np__3,k14_glib_000(X1))&v2_glib_002(X1))))), inference(assume_negation,[status(cth)],[l11_glpacy00])).
fof(c_0_3, plain, ![X5]:(~v1_relat_1(X5)|~v4_relat_1(X5,k4_ordinal1)|~v1_funct_1(X5)|~v1_finset_1(X5)|~v1_glib_000(X5)|~v2_chord(X5)|(~r1_ordinal1(np__3,k14_glib_000(X5))|~v2_glib_002(X5))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t100_glib_013])])).
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))&v2_chord(esk1_0))&(r1_ordinal1(np__3,k14_glib_000(esk1_0))&v2_glib_002(esk1_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])).
cnf(c_0_5, plain, (~v1_relat_1(X1)|~v4_relat_1(X1,k4_ordinal1)|~v1_funct_1(X1)|~v1_finset_1(X1)|~v1_glib_000(X1)|~v2_chord(X1)|~r1_ordinal1(np__3,k14_glib_000(X1))|~v2_glib_002(X1)), inference(split_conjunct,[status(thm)],[c_0_3])).
cnf(c_0_6, negated_conjecture, (r1_ordinal1(np__3,k14_glib_000(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_7, negated_conjecture, (v2_glib_002(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_8, negated_conjecture, (v2_chord(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_9, negated_conjecture, (v1_glib_000(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_10, negated_conjecture, (v1_finset_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_11, negated_conjecture, (v1_funct_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_12, negated_conjecture, (v4_relat_1(esk1_0,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_13, negated_conjecture, (v1_relat_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_14, 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(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]), c_0_12]), c_0_13])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 15
# Proof object clause steps            : 10
# Proof object formula steps           : 5
# Proof object conjectures             : 12
# Proof object clause conjectures      : 9
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 9
# Proof object initial formulas used   : 2
# Proof object generating inferences   : 1
# Proof object simplifying inferences  : 8
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 2
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 9
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 9
# Processed clauses                    : 18
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 18
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 1
# ...of the previous two non-trivial   : 0
# Contextual simplify-reflections      : 0
# Paramodulations                      : 1
# 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  : 9
#    Positive orientable unit clauses  : 8
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 0
#    Non-unit-clauses                  : 1
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 9
# Clause-clause subsumption calls (NU) : 0
# 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          : 649

# -------------------------------------------------
# User time                : 0.029 s
# System time              : 0.000 s
# Total time               : 0.029 s
# Maximum resident set size: 2856 pages
