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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(commutativity_k4_lattices, axiom, ![X1, X2, X3]:(((((~(v2_struct_0(X1))&v6_lattices(X1))&l1_lattices(X1))&m1_subset_1(X2,u1_struct_0(X1)))&m1_subset_1(X3,u1_struct_0(X1)))=>k4_lattices(X1,X2,X3)=k4_lattices(X1,X3,X2)), file('latwal_2/latwal_2__l42_latwal_2', commutativity_k4_lattices)).
fof(l42_latwal_2, conjecture, ![X1]:(m1_subset_1(X1,u1_struct_0(k5_latwal_1))=>![X2]:(m1_subset_1(X2,u1_struct_0(k5_latwal_1))=>((X1=k5_ordinal1&X2=np__2)=>k4_lattices(k5_latwal_1,X1,X2)=np__2))), file('latwal_2/latwal_2__l42_latwal_2', l42_latwal_2)).
fof(fc2_latwal_1, axiom, ((((((~(v2_struct_0(k5_latwal_1))&v4_lattices(k5_latwal_1))&v6_lattices(k5_latwal_1))&v8_lattices(k5_latwal_1))&v9_lattices(k5_latwal_1))&v7_robbins1(k5_latwal_1))&v5_sheffer1(k5_latwal_1)), file('latwal_2/latwal_2__l42_latwal_2', fc2_latwal_1)).
fof(dt_k5_latwal_1, axiom, (~(v2_struct_0(k5_latwal_1))&l3_lattices(k5_latwal_1)), file('latwal_2/latwal_2__l42_latwal_2', dt_k5_latwal_1)).
fof(dt_l3_lattices, axiom, ![X1]:(l3_lattices(X1)=>(l1_lattices(X1)&l2_lattices(X1))), file('latwal_2/latwal_2__l42_latwal_2', dt_l3_lattices)).
fof(l41_latwal_2, axiom, ![X1]:(m1_subset_1(X1,u1_struct_0(k5_latwal_1))=>![X2]:(m1_subset_1(X2,u1_struct_0(k5_latwal_1))=>((X1=np__2&X2=k5_ordinal1)=>k4_lattices(k5_latwal_1,X1,X2)=np__2))), file('latwal_2/latwal_2__l42_latwal_2', l41_latwal_2)).
fof(c_0_6, plain, ![X1, X2, X3]:(((((~v2_struct_0(X1)&v6_lattices(X1))&l1_lattices(X1))&m1_subset_1(X2,u1_struct_0(X1)))&m1_subset_1(X3,u1_struct_0(X1)))=>k4_lattices(X1,X2,X3)=k4_lattices(X1,X3,X2)), inference(fof_simplification,[status(thm)],[commutativity_k4_lattices])).
fof(c_0_7, negated_conjecture, ~(![X1]:(m1_subset_1(X1,u1_struct_0(k5_latwal_1))=>![X2]:(m1_subset_1(X2,u1_struct_0(k5_latwal_1))=>((X1=k5_ordinal1&X2=np__2)=>k4_lattices(k5_latwal_1,X1,X2)=np__2)))), inference(assume_negation,[status(cth)],[l42_latwal_2])).
fof(c_0_8, plain, ![X15, X16, X17]:(v2_struct_0(X15)|~v6_lattices(X15)|~l1_lattices(X15)|~m1_subset_1(X16,u1_struct_0(X15))|~m1_subset_1(X17,u1_struct_0(X15))|k4_lattices(X15,X16,X17)=k4_lattices(X15,X17,X16)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
fof(c_0_9, negated_conjecture, (m1_subset_1(esk1_0,u1_struct_0(k5_latwal_1))&(m1_subset_1(esk2_0,u1_struct_0(k5_latwal_1))&((esk1_0=k5_ordinal1&esk2_0=np__2)&k4_lattices(k5_latwal_1,esk1_0,esk2_0)!=np__2))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
fof(c_0_10, plain, ((((((~v2_struct_0(k5_latwal_1)&v4_lattices(k5_latwal_1))&v6_lattices(k5_latwal_1))&v8_lattices(k5_latwal_1))&v9_lattices(k5_latwal_1))&v7_robbins1(k5_latwal_1))&v5_sheffer1(k5_latwal_1)), inference(fof_simplification,[status(thm)],[fc2_latwal_1])).
fof(c_0_11, plain, (~v2_struct_0(k5_latwal_1)&l3_lattices(k5_latwal_1)), inference(fof_simplification,[status(thm)],[dt_k5_latwal_1])).
cnf(c_0_12, plain, (v2_struct_0(X1)|k4_lattices(X1,X2,X3)=k4_lattices(X1,X3,X2)|~v6_lattices(X1)|~l1_lattices(X1)|~m1_subset_1(X2,u1_struct_0(X1))|~m1_subset_1(X3,u1_struct_0(X1))), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_13, negated_conjecture, (m1_subset_1(esk2_0,u1_struct_0(k5_latwal_1))), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_14, plain, (v6_lattices(k5_latwal_1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_15, plain, (~v2_struct_0(k5_latwal_1)), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_16, plain, ![X14]:((l1_lattices(X14)|~l3_lattices(X14))&(l2_lattices(X14)|~l3_lattices(X14))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l3_lattices])])])).
fof(c_0_17, plain, ![X18, X19]:(~m1_subset_1(X18,u1_struct_0(k5_latwal_1))|(~m1_subset_1(X19,u1_struct_0(k5_latwal_1))|(X18!=np__2|X19!=k5_ordinal1|k4_lattices(k5_latwal_1,X18,X19)=np__2))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l41_latwal_2])])])).
cnf(c_0_18, negated_conjecture, (k4_lattices(k5_latwal_1,esk1_0,esk2_0)!=np__2), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_19, negated_conjecture, (esk2_0=np__2), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_20, negated_conjecture, (k4_lattices(k5_latwal_1,X1,esk2_0)=k4_lattices(k5_latwal_1,esk2_0,X1)|~l1_lattices(k5_latwal_1)|~m1_subset_1(X1,u1_struct_0(k5_latwal_1))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])]), c_0_15])).
cnf(c_0_21, plain, (l1_lattices(X1)|~l3_lattices(X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_22, plain, (l3_lattices(k5_latwal_1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_23, plain, (k4_lattices(k5_latwal_1,X1,X2)=np__2|~m1_subset_1(X1,u1_struct_0(k5_latwal_1))|~m1_subset_1(X2,u1_struct_0(k5_latwal_1))|X1!=np__2|X2!=k5_ordinal1), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_24, negated_conjecture, (esk1_0=k5_ordinal1), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_25, negated_conjecture, (m1_subset_1(esk1_0,u1_struct_0(k5_latwal_1))), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_26, negated_conjecture, (k4_lattices(k5_latwal_1,esk1_0,esk2_0)!=esk2_0), inference(rw,[status(thm)],[c_0_18, c_0_19])).
cnf(c_0_27, negated_conjecture, (k4_lattices(k5_latwal_1,X1,esk2_0)=k4_lattices(k5_latwal_1,esk2_0,X1)|~m1_subset_1(X1,u1_struct_0(k5_latwal_1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])])).
cnf(c_0_28, plain, (k4_lattices(k5_latwal_1,esk2_0,esk1_0)=esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_19]), c_0_24]), c_0_19])])]), c_0_25]), c_0_13])])).
cnf(c_0_29, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28]), c_0_25])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 30
# Proof object clause steps            : 16
# Proof object formula steps           : 14
# Proof object conjectures             : 12
# Proof object clause conjectures      : 9
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 11
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 3
# Proof object simplifying inferences  : 17
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 18
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 18
# Processed clauses                    : 39
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 38
# Other redundant clauses eliminated   : 2
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 0
# Generated clauses                    : 6
# ...of the previous two non-trivial   : 5
# Contextual simplify-reflections      : 0
# Paramodulations                      : 5
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 2
# 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  : 19
#    Positive orientable unit clauses  : 12
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 5
# Current number of unprocessed clauses: 1
# ...number of literals in the above   : 2
# Current number of archived formulas  : 0
# Current number of archived clauses   : 18
# Clause-clause subsumption calls (NU) : 5
# Rec. Clause-clause subsumption calls : 5
# Non-unit clause-clause subsumptions  : 1
# 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          : 1165

# -------------------------------------------------
# User time                : 0.024 s
# System time              : 0.000 s
# Total time               : 0.024 s
# Maximum resident set size: 2996 pages
