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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t17_proofs_1, axiom, ![X1]:(~(v1_xboole_0(X1))=>![X2]:(m1_subset_1(X2,k1_zfmisc_1(X1))=>![X3]:(m1_proofs_1(X3,X1)=>![X4]:(r2_proofs_1(X2,X4,X3)=>r2_hidden(X4,X1))))), file('proofs_1/proofs_1__t18_proofs_1', t17_proofs_1)).
fof(dt_u1_proofs_1, axiom, ![X1]:(l1_proofs_1(X1)=>m1_subset_1(u1_proofs_1(X1),k1_zfmisc_1(u1_struct_0(X1)))), file('proofs_1/proofs_1__t18_proofs_1', dt_u1_proofs_1)).
fof(d17_proofs_1, axiom, ![X1]:(l1_proofs_1(X1)=>![X2]:(r3_proofs_1(X1,X2)<=>r2_proofs_1(u1_proofs_1(X1),X2,u2_proofs_1(X1)))), file('proofs_1/proofs_1__t18_proofs_1', d17_proofs_1)).
fof(dt_u2_proofs_1, axiom, ![X1]:(l1_proofs_1(X1)=>m1_proofs_1(u2_proofs_1(X1),u1_struct_0(X1))), file('proofs_1/proofs_1__t18_proofs_1', dt_u2_proofs_1)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('proofs_1/proofs_1__t18_proofs_1', redefinition_r2_tarski)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('proofs_1/proofs_1__t18_proofs_1', t1_subset)).
fof(t18_proofs_1, conjecture, ![X1]:((~(v2_struct_0(X1))&l1_proofs_1(X1))=>![X2]:(r3_proofs_1(X1,X2)=>m1_subset_1(X2,u1_struct_0(X1)))), file('proofs_1/proofs_1__t18_proofs_1', t18_proofs_1)).
fof(fc2_struct_0, axiom, ![X1]:((~(v2_struct_0(X1))&l1_struct_0(X1))=>~(v1_xboole_0(u1_struct_0(X1)))), file('proofs_1/proofs_1__t18_proofs_1', fc2_struct_0)).
fof(dt_l1_proofs_1, axiom, ![X1]:(l1_proofs_1(X1)=>l1_struct_0(X1)), file('proofs_1/proofs_1__t18_proofs_1', dt_l1_proofs_1)).
fof(c_0_9, plain, ![X1]:(~v1_xboole_0(X1)=>![X2]:(m1_subset_1(X2,k1_zfmisc_1(X1))=>![X3]:(m1_proofs_1(X3,X1)=>![X4]:(r2_proofs_1(X2,X4,X3)=>r2_hidden(X4,X1))))), inference(fof_simplification,[status(thm)],[t17_proofs_1])).
fof(c_0_10, plain, ![X33, X34, X35, X36]:(v1_xboole_0(X33)|(~m1_subset_1(X34,k1_zfmisc_1(X33))|(~m1_proofs_1(X35,X33)|(~r2_proofs_1(X34,X36,X35)|r2_hidden(X36,X33))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
fof(c_0_11, plain, ![X25]:(~l1_proofs_1(X25)|m1_subset_1(u1_proofs_1(X25),k1_zfmisc_1(u1_struct_0(X25)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_u1_proofs_1])])).
cnf(c_0_12, plain, (v1_xboole_0(X1)|r2_hidden(X4,X1)|~m1_subset_1(X2,k1_zfmisc_1(X1))|~m1_proofs_1(X3,X1)|~r2_proofs_1(X2,X4,X3)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_13, plain, (m1_subset_1(u1_proofs_1(X1),k1_zfmisc_1(u1_struct_0(X1)))|~l1_proofs_1(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_14, plain, ![X31, X32]:((~r3_proofs_1(X31,X32)|r2_proofs_1(u1_proofs_1(X31),X32,u2_proofs_1(X31))|~l1_proofs_1(X31))&(~r2_proofs_1(u1_proofs_1(X31),X32,u2_proofs_1(X31))|r3_proofs_1(X31,X32)|~l1_proofs_1(X31))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d17_proofs_1])])])])).
fof(c_0_15, plain, ![X26]:(~l1_proofs_1(X26)|m1_proofs_1(u2_proofs_1(X26),u1_struct_0(X26))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_u2_proofs_1])])).
fof(c_0_16, plain, ![X23, X24]:((~r2_tarski(X23,X24)|r2_hidden(X23,X24))&(~r2_hidden(X23,X24)|r2_tarski(X23,X24))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_17, plain, (v1_xboole_0(u1_struct_0(X1))|r2_hidden(X2,u1_struct_0(X1))|~r2_proofs_1(u1_proofs_1(X1),X2,X3)|~m1_proofs_1(X3,u1_struct_0(X1))|~l1_proofs_1(X1)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
cnf(c_0_18, plain, (r2_proofs_1(u1_proofs_1(X1),X2,u2_proofs_1(X1))|~r3_proofs_1(X1,X2)|~l1_proofs_1(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_19, plain, (m1_proofs_1(u2_proofs_1(X1),u1_struct_0(X1))|~l1_proofs_1(X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
fof(c_0_20, plain, ![X29, X30]:(~r2_tarski(X29,X30)|m1_subset_1(X29,X30)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
cnf(c_0_21, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_22, plain, (v1_xboole_0(u1_struct_0(X1))|r2_hidden(X2,u1_struct_0(X1))|~r3_proofs_1(X1,X2)|~l1_proofs_1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])).
fof(c_0_23, negated_conjecture, ~(![X1]:((~v2_struct_0(X1)&l1_proofs_1(X1))=>![X2]:(r3_proofs_1(X1,X2)=>m1_subset_1(X2,u1_struct_0(X1))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t18_proofs_1])])).
fof(c_0_24, plain, ![X1]:((~v2_struct_0(X1)&l1_struct_0(X1))=>~v1_xboole_0(u1_struct_0(X1))), inference(fof_simplification,[status(thm)],[fc2_struct_0])).
cnf(c_0_25, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_26, plain, (v1_xboole_0(u1_struct_0(X1))|r2_tarski(X2,u1_struct_0(X1))|~r3_proofs_1(X1,X2)|~l1_proofs_1(X1)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
fof(c_0_27, negated_conjecture, ((~v2_struct_0(esk1_0)&l1_proofs_1(esk1_0))&(r3_proofs_1(esk1_0,esk2_0)&~m1_subset_1(esk2_0,u1_struct_0(esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])).
fof(c_0_28, plain, ![X27]:(v2_struct_0(X27)|~l1_struct_0(X27)|~v1_xboole_0(u1_struct_0(X27))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])).
cnf(c_0_29, plain, (v1_xboole_0(u1_struct_0(X1))|m1_subset_1(X2,u1_struct_0(X1))|~r3_proofs_1(X1,X2)|~l1_proofs_1(X1)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
cnf(c_0_30, negated_conjecture, (r3_proofs_1(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_31, negated_conjecture, (l1_proofs_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_32, negated_conjecture, (~m1_subset_1(esk2_0,u1_struct_0(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_33, plain, (v2_struct_0(X1)|~l1_struct_0(X1)|~v1_xboole_0(u1_struct_0(X1))), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_34, negated_conjecture, (v1_xboole_0(u1_struct_0(esk1_0))), 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_32])).
cnf(c_0_35, negated_conjecture, (~v2_struct_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_27])).
fof(c_0_36, plain, ![X28]:(~l1_proofs_1(X28)|l1_struct_0(X28)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_proofs_1])])).
cnf(c_0_37, negated_conjecture, (~l1_struct_0(esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35])).
cnf(c_0_38, plain, (l1_struct_0(X1)|~l1_proofs_1(X1)), inference(split_conjunct,[status(thm)],[c_0_36])).
cnf(c_0_39, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_31])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 40
# Proof object clause steps            : 19
# Proof object formula steps           : 21
# Proof object conjectures             : 10
# Proof object clause conjectures      : 7
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 12
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 7
# Proof object simplifying inferences  : 7
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 9
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 14
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 14
# Processed clauses                    : 34
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 34
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 9
# ...of the previous two non-trivial   : 6
# Contextual simplify-reflections      : 1
# Paramodulations                      : 9
# 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  : 20
#    Positive orientable unit clauses  : 3
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 14
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 14
# Clause-clause subsumption calls (NU) : 109
# Rec. Clause-clause subsumption calls : 43
# Non-unit clause-clause subsumptions  : 1
# Unit Clause-clause subsumption calls : 2
# 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          : 1305

# -------------------------------------------------
# User time                : 0.013 s
# System time              : 0.002 s
# Total time               : 0.015 s
# Maximum resident set size: 3072 pages
