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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t53_nat_1, axiom, ![X1]:(v7_ordinal1(X1)=>~(((~(v8_ordinal1(X1))&X1!=np__1)&r1_xxreal_0(X1,np__1)))), file('group_24/group_24__t76_group_24', t53_nat_1)).
fof(t76_group_24, conjecture, ![X1]:((v7_ordinal1(X1)&~(v8_ordinal1(X1)))=>(~((~(v7_struct_0(k4_gr_cy_1(X1)))&r1_xxreal_0(X1,np__1)))&~((~(r1_xxreal_0(X1,np__1))&v7_struct_0(k4_gr_cy_1(X1)))))), file('group_24/group_24__t76_group_24', t76_group_24)).
fof(t75_group_24, axiom, ![X1]:((v7_ordinal1(X1)&~(v8_ordinal1(X1)))=>(v7_struct_0(k4_gr_cy_1(X1))<=>X1=np__1)), file('group_24/group_24__t76_group_24', t75_group_24)).
fof(fc9_group_24, axiom, ((~(v2_struct_0(k4_gr_cy_1(np__1)))&v7_struct_0(k4_gr_cy_1(np__1)))&v15_algstr_0(k4_gr_cy_1(np__1))), file('group_24/group_24__t76_group_24', fc9_group_24)).
fof(rqLessOrEqual__r1_xxreal_0__r1_r1, axiom, r1_xxreal_0(np__1,np__1), file('group_24/group_24__t76_group_24', rqLessOrEqual__r1_xxreal_0__r1_r1)).
fof(c_0_5, plain, ![X1]:(v7_ordinal1(X1)=>~(((~v8_ordinal1(X1)&X1!=np__1)&r1_xxreal_0(X1,np__1)))), inference(fof_simplification,[status(thm)],[t53_nat_1])).
fof(c_0_6, negated_conjecture, ~(![X1]:((v7_ordinal1(X1)&~v8_ordinal1(X1))=>(~((~v7_struct_0(k4_gr_cy_1(X1))&r1_xxreal_0(X1,np__1)))&~((~r1_xxreal_0(X1,np__1)&v7_struct_0(k4_gr_cy_1(X1))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t76_group_24])])).
fof(c_0_7, plain, ![X1]:((v7_ordinal1(X1)&~v8_ordinal1(X1))=>(v7_struct_0(k4_gr_cy_1(X1))<=>X1=np__1)), inference(fof_simplification,[status(thm)],[t75_group_24])).
fof(c_0_8, plain, ![X6]:(~v7_ordinal1(X6)|(v8_ordinal1(X6)|X6=np__1|~r1_xxreal_0(X6,np__1))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])).
fof(c_0_9, negated_conjecture, ((v7_ordinal1(esk1_0)&~v8_ordinal1(esk1_0))&(((~r1_xxreal_0(esk1_0,np__1)|~v7_struct_0(k4_gr_cy_1(esk1_0)))&(v7_struct_0(k4_gr_cy_1(esk1_0))|~v7_struct_0(k4_gr_cy_1(esk1_0))))&((~r1_xxreal_0(esk1_0,np__1)|r1_xxreal_0(esk1_0,np__1))&(v7_struct_0(k4_gr_cy_1(esk1_0))|r1_xxreal_0(esk1_0,np__1))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])).
fof(c_0_10, plain, ![X7]:((~v7_struct_0(k4_gr_cy_1(X7))|X7=np__1|(~v7_ordinal1(X7)|v8_ordinal1(X7)))&(X7!=np__1|v7_struct_0(k4_gr_cy_1(X7))|(~v7_ordinal1(X7)|v8_ordinal1(X7)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
cnf(c_0_11, plain, (v8_ordinal1(X1)|X1=np__1|~v7_ordinal1(X1)|~r1_xxreal_0(X1,np__1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_12, negated_conjecture, (v7_struct_0(k4_gr_cy_1(esk1_0))|r1_xxreal_0(esk1_0,np__1)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_13, negated_conjecture, (v7_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_14, negated_conjecture, (~v8_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_15, plain, (X1=np__1|v8_ordinal1(X1)|~v7_struct_0(k4_gr_cy_1(X1))|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_16, negated_conjecture, (np__1=esk1_0|v7_struct_0(k4_gr_cy_1(esk1_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])]), c_0_14])).
fof(c_0_17, plain, ((~v2_struct_0(k4_gr_cy_1(np__1))&v7_struct_0(k4_gr_cy_1(np__1)))&v15_algstr_0(k4_gr_cy_1(np__1))), inference(fof_simplification,[status(thm)],[fc9_group_24])).
cnf(c_0_18, plain, (r1_xxreal_0(np__1,np__1)), inference(split_conjunct,[status(thm)],[rqLessOrEqual__r1_xxreal_0__r1_r1])).
cnf(c_0_19, negated_conjecture, (np__1=esk1_0), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_13])]), c_0_14])).
cnf(c_0_20, plain, (v7_struct_0(k4_gr_cy_1(np__1))), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_21, negated_conjecture, (~r1_xxreal_0(esk1_0,np__1)|~v7_struct_0(k4_gr_cy_1(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_22, plain, (r1_xxreal_0(esk1_0,esk1_0)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19]), c_0_19])).
cnf(c_0_23, plain, (v7_struct_0(k4_gr_cy_1(esk1_0))), inference(rw,[status(thm)],[c_0_20, c_0_19])).
cnf(c_0_24, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_19]), c_0_22]), c_0_23])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 25
# Proof object clause steps            : 13
# Proof object formula steps           : 12
# Proof object conjectures             : 10
# Proof object clause conjectures      : 7
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 8
# Proof object initial formulas used   : 5
# Proof object generating inferences   : 2
# Proof object simplifying inferences  : 13
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 5
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 13
# Removed in clause preprocessing      : 2
# Initial clauses in saturation        : 11
# Processed clauses                    : 30
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 29
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 10
# Generated clauses                    : 4
# ...of the previous two non-trivial   : 11
# Contextual simplify-reflections      : 0
# Paramodulations                      : 4
# 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  : 8
#    Positive orientable unit clauses  : 5
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 1
# Current number of unprocessed clauses: 3
# ...number of literals in the above   : 10
# Current number of archived formulas  : 0
# Current number of archived clauses   : 21
# Clause-clause subsumption calls (NU) : 1
# Rec. Clause-clause subsumption calls : 1
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 2
# 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          : 868

# -------------------------------------------------
# User time                : 0.027 s
# System time              : 0.000 s
# Total time               : 0.027 s
# Maximum resident set size: 2900 pages
