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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(d9_latwal_2, axiom, ![X1]:((((((~(v2_struct_0(X1))&v3_orders_2(X1))&v5_orders_2(X1))&v1_lattice3(X1))&v2_lattice3(X1))&l1_orders_2(X1))=>![X2]:(r1_latwal_2(X1,X2)<=>![X3]:(m1_subset_1(X3,u1_struct_0(X1))=>![X4]:(m1_subset_1(X4,u1_struct_0(X1))=>((r2_tarski(X3,X2)&r2_tarski(X4,X2))=>(X3=X4|X2=k1_latwal_2(X1,X3,X4))))))), file('latwal_2/latwal_2__t38_latwal_2', d9_latwal_2)).
fof(t38_latwal_2, conjecture, ![X1]:((((((~(v2_struct_0(X1))&v3_orders_2(X1))&v5_orders_2(X1))&v1_lattice3(X1))&v2_lattice3(X1))&l1_orders_2(X1))=>![X2]:(m1_subset_1(X2,u1_struct_0(X1))=>r1_latwal_2(X1,k1_tarski(X2)))), file('latwal_2/latwal_2__t38_latwal_2', t38_latwal_2)).
fof(d1_tarski, axiom, ![X1, X2]:(X2=k1_tarski(X1)<=>![X3]:(r2_hidden(X3,X2)<=>X3=X1)), file('latwal_2/latwal_2__t38_latwal_2', d1_tarski)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('latwal_2/latwal_2__t38_latwal_2', redefinition_r2_tarski)).
fof(c_0_4, plain, ![X1]:((((((~v2_struct_0(X1)&v3_orders_2(X1))&v5_orders_2(X1))&v1_lattice3(X1))&v2_lattice3(X1))&l1_orders_2(X1))=>![X2]:(r1_latwal_2(X1,X2)<=>![X3]:(m1_subset_1(X3,u1_struct_0(X1))=>![X4]:(m1_subset_1(X4,u1_struct_0(X1))=>((r2_tarski(X3,X2)&r2_tarski(X4,X2))=>(X3=X4|X2=k1_latwal_2(X1,X3,X4))))))), inference(fof_simplification,[status(thm)],[d9_latwal_2])).
fof(c_0_5, negated_conjecture, ~(![X1]:((((((~v2_struct_0(X1)&v3_orders_2(X1))&v5_orders_2(X1))&v1_lattice3(X1))&v2_lattice3(X1))&l1_orders_2(X1))=>![X2]:(m1_subset_1(X2,u1_struct_0(X1))=>r1_latwal_2(X1,k1_tarski(X2))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t38_latwal_2])])).
fof(c_0_6, plain, ![X25, X26, X27, X28, X29]:((~r1_latwal_2(X25,X26)|(~m1_subset_1(X27,u1_struct_0(X25))|(~m1_subset_1(X28,u1_struct_0(X25))|(~r2_tarski(X27,X26)|~r2_tarski(X28,X26)|(X27=X28|X26=k1_latwal_2(X25,X27,X28)))))|(v2_struct_0(X25)|~v3_orders_2(X25)|~v5_orders_2(X25)|~v1_lattice3(X25)|~v2_lattice3(X25)|~l1_orders_2(X25)))&((m1_subset_1(esk4_2(X25,X29),u1_struct_0(X25))|r1_latwal_2(X25,X29)|(v2_struct_0(X25)|~v3_orders_2(X25)|~v5_orders_2(X25)|~v1_lattice3(X25)|~v2_lattice3(X25)|~l1_orders_2(X25)))&((m1_subset_1(esk5_2(X25,X29),u1_struct_0(X25))|r1_latwal_2(X25,X29)|(v2_struct_0(X25)|~v3_orders_2(X25)|~v5_orders_2(X25)|~v1_lattice3(X25)|~v2_lattice3(X25)|~l1_orders_2(X25)))&(((r2_tarski(esk4_2(X25,X29),X29)|r1_latwal_2(X25,X29)|(v2_struct_0(X25)|~v3_orders_2(X25)|~v5_orders_2(X25)|~v1_lattice3(X25)|~v2_lattice3(X25)|~l1_orders_2(X25)))&(r2_tarski(esk5_2(X25,X29),X29)|r1_latwal_2(X25,X29)|(v2_struct_0(X25)|~v3_orders_2(X25)|~v5_orders_2(X25)|~v1_lattice3(X25)|~v2_lattice3(X25)|~l1_orders_2(X25))))&((esk4_2(X25,X29)!=esk5_2(X25,X29)|r1_latwal_2(X25,X29)|(v2_struct_0(X25)|~v3_orders_2(X25)|~v5_orders_2(X25)|~v1_lattice3(X25)|~v2_lattice3(X25)|~l1_orders_2(X25)))&(X29!=k1_latwal_2(X25,esk4_2(X25,X29),esk5_2(X25,X29))|r1_latwal_2(X25,X29)|(v2_struct_0(X25)|~v3_orders_2(X25)|~v5_orders_2(X25)|~v1_lattice3(X25)|~v2_lattice3(X25)|~l1_orders_2(X25)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])])).
fof(c_0_7, negated_conjecture, ((((((~v2_struct_0(esk1_0)&v3_orders_2(esk1_0))&v5_orders_2(esk1_0))&v1_lattice3(esk1_0))&v2_lattice3(esk1_0))&l1_orders_2(esk1_0))&(m1_subset_1(esk2_0,u1_struct_0(esk1_0))&~r1_latwal_2(esk1_0,k1_tarski(esk2_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
fof(c_0_8, plain, ![X18, X19, X20, X21, X22, X23]:(((~r2_hidden(X20,X19)|X20=X18|X19!=k1_tarski(X18))&(X21!=X18|r2_hidden(X21,X19)|X19!=k1_tarski(X18)))&((~r2_hidden(esk3_2(X22,X23),X23)|esk3_2(X22,X23)!=X22|X23=k1_tarski(X22))&(r2_hidden(esk3_2(X22,X23),X23)|esk3_2(X22,X23)=X22|X23=k1_tarski(X22)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tarski])])])])])])).
fof(c_0_9, plain, ![X32, X33]:((~r2_tarski(X32,X33)|r2_hidden(X32,X33))&(~r2_hidden(X32,X33)|r2_tarski(X32,X33))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_10, plain, (r2_tarski(esk5_2(X1,X2),X2)|r1_latwal_2(X1,X2)|v2_struct_0(X1)|~v3_orders_2(X1)|~v5_orders_2(X1)|~v1_lattice3(X1)|~v2_lattice3(X1)|~l1_orders_2(X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_11, negated_conjecture, (l1_orders_2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_12, negated_conjecture, (v2_lattice3(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_13, negated_conjecture, (v1_lattice3(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_14, negated_conjecture, (v5_orders_2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_15, negated_conjecture, (v3_orders_2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_16, negated_conjecture, (~v2_struct_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_17, plain, (r2_tarski(esk4_2(X1,X2),X2)|r1_latwal_2(X1,X2)|v2_struct_0(X1)|~v3_orders_2(X1)|~v5_orders_2(X1)|~v1_lattice3(X1)|~v2_lattice3(X1)|~l1_orders_2(X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_18, plain, (X1=X3|~r2_hidden(X1,X2)|X2!=k1_tarski(X3)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_19, plain, (r2_hidden(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_20, negated_conjecture, (r2_tarski(esk5_2(esk1_0,X1),X1)|r1_latwal_2(esk1_0,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_10, c_0_11]), c_0_12]), c_0_13]), c_0_14]), c_0_15])]), c_0_16])).
cnf(c_0_21, negated_conjecture, (r2_tarski(esk4_2(esk1_0,X1),X1)|r1_latwal_2(esk1_0,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_17, c_0_11]), c_0_12]), c_0_13]), c_0_14]), c_0_15])]), c_0_16])).
cnf(c_0_22, plain, (X1=X2|~r2_hidden(X1,k1_tarski(X2))), inference(er,[status(thm)],[c_0_18])).
cnf(c_0_23, negated_conjecture, (r2_hidden(esk5_2(esk1_0,X1),X1)|r1_latwal_2(esk1_0,X1)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
cnf(c_0_24, negated_conjecture, (r2_hidden(esk4_2(esk1_0,X1),X1)|r1_latwal_2(esk1_0,X1)), inference(spm,[status(thm)],[c_0_19, c_0_21])).
cnf(c_0_25, plain, (r1_latwal_2(X1,X2)|v2_struct_0(X1)|esk4_2(X1,X2)!=esk5_2(X1,X2)|~v3_orders_2(X1)|~v5_orders_2(X1)|~v1_lattice3(X1)|~v2_lattice3(X1)|~l1_orders_2(X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_26, negated_conjecture, (~r1_latwal_2(esk1_0,k1_tarski(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_27, negated_conjecture, (esk5_2(esk1_0,k1_tarski(X1))=X1|r1_latwal_2(esk1_0,k1_tarski(X1))), inference(spm,[status(thm)],[c_0_22, c_0_23])).
cnf(c_0_28, negated_conjecture, (esk4_2(esk1_0,k1_tarski(X1))=X1|r1_latwal_2(esk1_0,k1_tarski(X1))), inference(spm,[status(thm)],[c_0_22, c_0_24])).
cnf(c_0_29, negated_conjecture, (r1_latwal_2(esk1_0,X1)|esk5_2(esk1_0,X1)!=esk4_2(esk1_0,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_25, c_0_11]), c_0_12]), c_0_13]), c_0_14]), c_0_15])]), c_0_16])).
cnf(c_0_30, negated_conjecture, (esk5_2(esk1_0,k1_tarski(esk2_0))=esk2_0), inference(spm,[status(thm)],[c_0_26, c_0_27])).
cnf(c_0_31, negated_conjecture, (esk4_2(esk1_0,k1_tarski(esk2_0))=esk2_0), inference(spm,[status(thm)],[c_0_26, c_0_28])).
cnf(c_0_32, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31])]), c_0_26]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 33
# Proof object clause steps            : 23
# Proof object formula steps           : 10
# Proof object conjectures             : 20
# Proof object clause conjectures      : 17
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 12
# Proof object initial formulas used   : 4
# Proof object generating inferences   : 10
# Proof object simplifying inferences  : 22
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 4
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 21
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 21
# Processed clauses                    : 55
# ...of these trivial                  : 0
# ...subsumed                          : 2
# ...remaining for further processing  : 53
# Other redundant clauses eliminated   : 3
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 26
# ...of the previous two non-trivial   : 20
# Contextual simplify-reflections      : 0
# Paramodulations                      : 24
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 3
# 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  : 29
#    Positive orientable unit clauses  : 10
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 17
# Current number of unprocessed clauses: 5
# ...number of literals in the above   : 35
# Current number of archived formulas  : 0
# Current number of archived clauses   : 22
# Clause-clause subsumption calls (NU) : 366
# Rec. Clause-clause subsumption calls : 68
# Non-unit clause-clause subsumptions  : 2
# Unit Clause-clause subsumption calls : 31
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 3
# BW rewrite match successes           : 1
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 2188

# -------------------------------------------------
# User time                : 0.025 s
# System time              : 0.000 s
# Total time               : 0.025 s
# Maximum resident set size: 2952 pages
