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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(l45_field_16, axiom, ![X1]:(((~(v6_struct_0(X1))&v1_group_1(X1))&l6_algstr_0(X1))=>![X2]:((~(v1_zfmisc_1(X2))&v7_ordinal1(X2))=>k2_hurwitz(X1,k6_field_16(X1,X2))=X2)), file('field_16/field_16__t31_field_16', l45_field_16)).
fof(t31_field_16, conjecture, ![X1]:(((~(v6_struct_0(X1))&v1_group_1(X1))&l6_algstr_0(X1))=>![X2]:((~(v1_zfmisc_1(X2))&v7_ordinal1(X2))=>k2_hurwitz(X1,k6_field_16(X1,X2))=X2)), file('field_16/field_16__t31_field_16', t31_field_16)).
fof(c_0_2, plain, ![X1]:(((~v6_struct_0(X1)&v1_group_1(X1))&l6_algstr_0(X1))=>![X2]:((~v1_zfmisc_1(X2)&v7_ordinal1(X2))=>k2_hurwitz(X1,k6_field_16(X1,X2))=X2)), inference(fof_simplification,[status(thm)],[l45_field_16])).
fof(c_0_3, negated_conjecture, ~(![X1]:(((~v6_struct_0(X1)&v1_group_1(X1))&l6_algstr_0(X1))=>![X2]:((~v1_zfmisc_1(X2)&v7_ordinal1(X2))=>k2_hurwitz(X1,k6_field_16(X1,X2))=X2))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t31_field_16])])).
fof(c_0_4, plain, ![X9, X10]:(v6_struct_0(X9)|~v1_group_1(X9)|~l6_algstr_0(X9)|(v1_zfmisc_1(X10)|~v7_ordinal1(X10)|k2_hurwitz(X9,k6_field_16(X9,X10))=X10)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])).
fof(c_0_5, negated_conjecture, (((~v6_struct_0(esk1_0)&v1_group_1(esk1_0))&l6_algstr_0(esk1_0))&((~v1_zfmisc_1(esk2_0)&v7_ordinal1(esk2_0))&k2_hurwitz(esk1_0,k6_field_16(esk1_0,esk2_0))!=esk2_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
cnf(c_0_6, plain, (v6_struct_0(X1)|v1_zfmisc_1(X2)|k2_hurwitz(X1,k6_field_16(X1,X2))=X2|~v1_group_1(X1)|~l6_algstr_0(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_7, negated_conjecture, (v7_ordinal1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_8, negated_conjecture, (~v1_zfmisc_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_9, negated_conjecture, (k2_hurwitz(X1,k6_field_16(X1,esk2_0))=esk2_0|v6_struct_0(X1)|~l6_algstr_0(X1)|~v1_group_1(X1)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_7]), c_0_8])).
cnf(c_0_10, negated_conjecture, (l6_algstr_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_11, negated_conjecture, (v1_group_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_12, negated_conjecture, (k2_hurwitz(esk1_0,k6_field_16(esk1_0,esk2_0))!=esk2_0), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_13, negated_conjecture, (~v6_struct_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_14, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[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            : 9
# Proof object formula steps           : 6
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 7
# Proof object initial formulas used   : 2
# Proof object generating inferences   : 2
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 2
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 7
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 7
# 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                    : 2
# ...of the previous two non-trivial   : 1
# Contextual simplify-reflections      : 0
# Paramodulations                      : 2
# 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  : 3
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    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   : 7
# 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          : 528

# -------------------------------------------------
# User time                : 0.022 s
# System time              : 0.000 s
# Total time               : 0.022 s
# Maximum resident set size: 2932 pages
