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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(l57_proofs_1, axiom, ![X1]:((~(v1_xboole_0(X1))&v15_proofs_1(X1))=>![X2]:((v6_ordinal1(X2)&m1_subset_1(X2,k1_zfmisc_1(X1)))=>r2_tarski(k3_tarski(X2),X1))), file('proofs_1/proofs_1__t21_proofs_1', l57_proofs_1)).
fof(t3_subset, axiom, ![X1, X2]:(m1_subset_1(X1,k1_zfmisc_1(X2))<=>r1_tarski(X1,X2)), file('proofs_1/proofs_1__t21_proofs_1', t3_subset)).
fof(t21_proofs_1, conjecture, ![X1]:((~(v1_xboole_0(X1))&v15_proofs_1(X1))=>?[X2]:(m1_subset_1(X2,X1)&![X3]:(m1_subset_1(X3,X1)=>~(r2_xboole_0(X2,X3))))), file('proofs_1/proofs_1__t21_proofs_1', t21_proofs_1)).
fof(t65_orders_1, axiom, ![X1]:~(((X1!=k1_xboole_0&![X2]:~(((r1_tarski(X2,X1)&v6_ordinal1(X2))&![X3]:~((r2_tarski(X3,X1)&![X4]:(r2_tarski(X4,X2)=>r1_tarski(X4,X3)))))))&![X2]:~((r2_tarski(X2,X1)&![X3]:~(((r2_tarski(X3,X1)&X3!=X2)&r1_tarski(X2,X3))))))), file('proofs_1/proofs_1__t21_proofs_1', t65_orders_1)).
fof(d8_xboole_0, axiom, ![X1, X2]:(r2_xboole_0(X1,X2)<=>(r1_tarski(X1,X2)&X1!=X2)), file('proofs_1/proofs_1__t21_proofs_1', d8_xboole_0)).
fof(t74_zfmisc_1, axiom, ![X1, X2]:(r2_tarski(X2,X1)=>r1_tarski(X2,k3_tarski(X1))), file('proofs_1/proofs_1__t21_proofs_1', t74_zfmisc_1)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('proofs_1/proofs_1__t21_proofs_1', t1_subset)).
fof(t2_subset, axiom, ![X1, X2]:(m1_subset_1(X1,X2)=>(v1_xboole_0(X2)|r2_tarski(X1,X2))), file('proofs_1/proofs_1__t21_proofs_1', t2_subset)).
fof(irreflexivity_r2_xboole_0, axiom, ![X1, X2]:~(r2_xboole_0(X1,X1)), file('proofs_1/proofs_1__t21_proofs_1', irreflexivity_r2_xboole_0)).
fof(fc1_xboole_0, axiom, v1_xboole_0(k1_xboole_0), file('proofs_1/proofs_1__t21_proofs_1', fc1_xboole_0)).
fof(c_0_10, plain, ![X1]:((~v1_xboole_0(X1)&v15_proofs_1(X1))=>![X2]:((v6_ordinal1(X2)&m1_subset_1(X2,k1_zfmisc_1(X1)))=>r2_tarski(k3_tarski(X2),X1))), inference(fof_simplification,[status(thm)],[l57_proofs_1])).
fof(c_0_11, plain, ![X34, X35]:(v1_xboole_0(X34)|~v15_proofs_1(X34)|(~v6_ordinal1(X35)|~m1_subset_1(X35,k1_zfmisc_1(X34))|r2_tarski(k3_tarski(X35),X34))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
fof(c_0_12, plain, ![X40, X41]:((~m1_subset_1(X40,k1_zfmisc_1(X41))|r1_tarski(X40,X41))&(~r1_tarski(X40,X41)|m1_subset_1(X40,k1_zfmisc_1(X41)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])).
fof(c_0_13, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v15_proofs_1(X1))=>?[X2]:(m1_subset_1(X2,X1)&![X3]:(m1_subset_1(X3,X1)=>~r2_xboole_0(X2,X3))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t21_proofs_1])])).
cnf(c_0_14, plain, (v1_xboole_0(X1)|r2_tarski(k3_tarski(X2),X1)|~v15_proofs_1(X1)|~v6_ordinal1(X2)|~m1_subset_1(X2,k1_zfmisc_1(X1))), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_15, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
fof(c_0_16, plain, ![X42, X44, X47]:((((r2_tarski(esk5_1(X42),X42)|(r1_tarski(esk3_1(X42),X42)|X42=k1_xboole_0))&(~r2_tarski(X47,X42)|X47=esk5_1(X42)|~r1_tarski(esk5_1(X42),X47)|(r1_tarski(esk3_1(X42),X42)|X42=k1_xboole_0)))&((r2_tarski(esk5_1(X42),X42)|(v6_ordinal1(esk3_1(X42))|X42=k1_xboole_0))&(~r2_tarski(X47,X42)|X47=esk5_1(X42)|~r1_tarski(esk5_1(X42),X47)|(v6_ordinal1(esk3_1(X42))|X42=k1_xboole_0))))&(((r2_tarski(esk5_1(X42),X42)|(r2_tarski(esk4_2(X42,X44),esk3_1(X42))|~r2_tarski(X44,X42)|X42=k1_xboole_0))&(~r2_tarski(X47,X42)|X47=esk5_1(X42)|~r1_tarski(esk5_1(X42),X47)|(r2_tarski(esk4_2(X42,X44),esk3_1(X42))|~r2_tarski(X44,X42)|X42=k1_xboole_0)))&((r2_tarski(esk5_1(X42),X42)|(~r1_tarski(esk4_2(X42,X44),X44)|~r2_tarski(X44,X42)|X42=k1_xboole_0))&(~r2_tarski(X47,X42)|X47=esk5_1(X42)|~r1_tarski(esk5_1(X42),X47)|(~r1_tarski(esk4_2(X42,X44),X44)|~r2_tarski(X44,X42)|X42=k1_xboole_0))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t65_orders_1])])])])])).
fof(c_0_17, plain, ![X31, X32]:(((r1_tarski(X31,X32)|~r2_xboole_0(X31,X32))&(X31!=X32|~r2_xboole_0(X31,X32)))&(~r1_tarski(X31,X32)|X31=X32|r2_xboole_0(X31,X32))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_xboole_0])])])).
fof(c_0_18, negated_conjecture, ![X29]:((~v1_xboole_0(esk1_0)&v15_proofs_1(esk1_0))&((m1_subset_1(esk2_1(X29),esk1_0)|~m1_subset_1(X29,esk1_0))&(r2_xboole_0(X29,esk2_1(X29))|~m1_subset_1(X29,esk1_0)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])).
fof(c_0_19, plain, ![X48, X49]:(~r2_tarski(X49,X48)|r1_tarski(X49,k3_tarski(X48))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t74_zfmisc_1])])).
cnf(c_0_20, plain, (r2_tarski(k3_tarski(X1),X2)|v1_xboole_0(X2)|~v6_ordinal1(X1)|~r1_tarski(X1,X2)|~v15_proofs_1(X2)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
cnf(c_0_21, plain, (r2_tarski(esk5_1(X1),X1)|r1_tarski(esk3_1(X1),X1)|X1=k1_xboole_0), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_22, plain, (r2_tarski(esk5_1(X1),X1)|v6_ordinal1(esk3_1(X1))|X1=k1_xboole_0), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_23, plain, (r1_tarski(X1,X2)|~r2_xboole_0(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_24, negated_conjecture, (r2_xboole_0(X1,esk2_1(X1))|~m1_subset_1(X1,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_18])).
fof(c_0_25, plain, ![X36, X37]:(~r2_tarski(X36,X37)|m1_subset_1(X36,X37)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
cnf(c_0_26, plain, (r2_tarski(esk5_1(X1),X1)|X1=k1_xboole_0|~r1_tarski(esk4_2(X1,X2),X2)|~r2_tarski(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_27, plain, (r1_tarski(X1,k3_tarski(X2))|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_19])).
cnf(c_0_28, plain, (X1=k1_xboole_0|r2_tarski(k3_tarski(esk3_1(X1)),X1)|r2_tarski(esk5_1(X1),X1)|v1_xboole_0(X1)|~v15_proofs_1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])).
cnf(c_0_29, negated_conjecture, (v15_proofs_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_30, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_31, negated_conjecture, (r1_tarski(X1,esk2_1(X1))|~m1_subset_1(X1,esk1_0)), inference(spm,[status(thm)],[c_0_23, c_0_24])).
cnf(c_0_32, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_33, plain, (X1=k1_xboole_0|r2_tarski(esk5_1(X1),X1)|~r2_tarski(esk4_2(X1,k3_tarski(X2)),X2)|~r2_tarski(k3_tarski(X2),X1)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
cnf(c_0_34, negated_conjecture, (esk1_0=k1_xboole_0|r2_tarski(k3_tarski(esk3_1(esk1_0)),esk1_0)|r2_tarski(esk5_1(esk1_0),esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30])).
cnf(c_0_35, plain, (X1=esk5_1(X2)|r1_tarski(esk3_1(X2),X2)|X2=k1_xboole_0|~r2_tarski(X1,X2)|~r1_tarski(esk5_1(X2),X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_36, negated_conjecture, (r1_tarski(X1,esk2_1(X1))|~r2_tarski(X1,esk1_0)), inference(spm,[status(thm)],[c_0_31, c_0_32])).
cnf(c_0_37, plain, (X1=esk5_1(X2)|X2=k1_xboole_0|~r2_tarski(X1,X2)|~r1_tarski(esk5_1(X2),X1)|~r1_tarski(esk4_2(X2,X3),X3)|~r2_tarski(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_38, negated_conjecture, (esk1_0=k1_xboole_0|r2_tarski(esk5_1(esk1_0),esk1_0)|~r2_tarski(esk4_2(esk1_0,k3_tarski(esk3_1(esk1_0))),esk3_1(esk1_0))), inference(spm,[status(thm)],[c_0_33, c_0_34])).
cnf(c_0_39, plain, (r2_tarski(esk5_1(X1),X1)|r2_tarski(esk4_2(X1,X2),esk3_1(X1))|X1=k1_xboole_0|~r2_tarski(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_40, negated_conjecture, (esk2_1(esk5_1(X1))=esk5_1(X1)|X1=k1_xboole_0|r1_tarski(esk3_1(X1),X1)|~r2_tarski(esk2_1(esk5_1(X1)),X1)|~r2_tarski(esk5_1(X1),esk1_0)), inference(spm,[status(thm)],[c_0_35, c_0_36])).
cnf(c_0_41, negated_conjecture, (esk2_1(esk5_1(X1))=esk5_1(X1)|X1=k1_xboole_0|~r2_tarski(esk2_1(esk5_1(X1)),X1)|~r2_tarski(esk5_1(X1),esk1_0)|~r2_tarski(X2,X1)|~r1_tarski(esk4_2(X1,X2),X2)), inference(spm,[status(thm)],[c_0_37, c_0_36])).
cnf(c_0_42, negated_conjecture, (esk1_0=k1_xboole_0|r2_tarski(esk5_1(esk1_0),esk1_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_34])).
fof(c_0_43, plain, ![X38, X39]:(~m1_subset_1(X38,X39)|(v1_xboole_0(X39)|r2_tarski(X38,X39))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])).
cnf(c_0_44, negated_conjecture, (esk2_1(esk5_1(X1))=esk5_1(X1)|X1=k1_xboole_0|r2_tarski(k3_tarski(esk3_1(X1)),X1)|v1_xboole_0(X1)|~r2_tarski(esk2_1(esk5_1(X1)),X1)|~r2_tarski(esk5_1(X1),esk1_0)|~v6_ordinal1(esk3_1(X1))|~v15_proofs_1(X1)), inference(spm,[status(thm)],[c_0_20, c_0_40])).
cnf(c_0_45, plain, (X1=esk5_1(X2)|v6_ordinal1(esk3_1(X2))|X2=k1_xboole_0|~r2_tarski(X1,X2)|~r1_tarski(esk5_1(X2),X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_46, negated_conjecture, (esk2_1(esk5_1(esk1_0))=esk5_1(esk1_0)|esk1_0=k1_xboole_0|~r2_tarski(esk2_1(esk5_1(esk1_0)),esk1_0)|~r2_tarski(X1,esk1_0)|~r1_tarski(esk4_2(esk1_0,X1),X1)), inference(spm,[status(thm)],[c_0_41, c_0_42])).
cnf(c_0_47, plain, (X1=esk5_1(X2)|r2_tarski(esk4_2(X2,X3),esk3_1(X2))|X2=k1_xboole_0|~r2_tarski(X1,X2)|~r1_tarski(esk5_1(X2),X1)|~r2_tarski(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_48, plain, (v1_xboole_0(X2)|r2_tarski(X1,X2)|~m1_subset_1(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_43])).
cnf(c_0_49, negated_conjecture, (esk2_1(esk5_1(X1))=esk5_1(X1)|X2=esk5_1(X1)|X1=k1_xboole_0|r2_tarski(k3_tarski(esk3_1(X1)),X1)|v1_xboole_0(X1)|~r2_tarski(esk2_1(esk5_1(X1)),X1)|~r2_tarski(esk5_1(X1),esk1_0)|~r2_tarski(X2,X1)|~r1_tarski(esk5_1(X1),X2)|~v15_proofs_1(X1)), inference(spm,[status(thm)],[c_0_44, c_0_45])).
cnf(c_0_50, negated_conjecture, (esk2_1(esk5_1(esk1_0))=esk5_1(esk1_0)|esk1_0=k1_xboole_0|~r2_tarski(esk2_1(esk5_1(esk1_0)),esk1_0)|~r2_tarski(esk4_2(esk1_0,k3_tarski(X1)),X1)|~r2_tarski(k3_tarski(X1),esk1_0)), inference(spm,[status(thm)],[c_0_46, c_0_27])).
cnf(c_0_51, negated_conjecture, (esk2_1(esk5_1(X1))=esk5_1(X1)|X1=k1_xboole_0|r2_tarski(esk4_2(X1,X2),esk3_1(X1))|~r2_tarski(esk2_1(esk5_1(X1)),X1)|~r2_tarski(esk5_1(X1),esk1_0)|~r2_tarski(X2,X1)), inference(spm,[status(thm)],[c_0_47, c_0_36])).
cnf(c_0_52, negated_conjecture, (r2_tarski(X1,esk1_0)|~m1_subset_1(X1,esk1_0)), inference(spm,[status(thm)],[c_0_30, c_0_48])).
cnf(c_0_53, negated_conjecture, (m1_subset_1(esk2_1(X1),esk1_0)|~m1_subset_1(X1,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_54, negated_conjecture, (esk2_1(esk5_1(X1))=esk5_1(X1)|X1=k1_xboole_0|r2_tarski(k3_tarski(esk3_1(X1)),X1)|v1_xboole_0(X1)|~r2_tarski(esk2_1(esk5_1(X1)),X1)|~r2_tarski(esk5_1(X1),esk1_0)|~v15_proofs_1(X1)), inference(spm,[status(thm)],[c_0_49, c_0_36])).
cnf(c_0_55, negated_conjecture, (esk2_1(esk5_1(esk1_0))=esk5_1(esk1_0)|esk1_0=k1_xboole_0|~r2_tarski(esk2_1(esk5_1(esk1_0)),esk1_0)|~r2_tarski(k3_tarski(esk3_1(esk1_0)),esk1_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_51]), c_0_42])).
cnf(c_0_56, negated_conjecture, (r2_tarski(esk2_1(X1),esk1_0)|~m1_subset_1(X1,esk1_0)), inference(spm,[status(thm)],[c_0_52, c_0_53])).
fof(c_0_57, plain, ![X1, X2]:~r2_xboole_0(X1,X1), inference(fof_simplification,[status(thm)],[irreflexivity_r2_xboole_0])).
cnf(c_0_58, negated_conjecture, (esk2_1(esk5_1(esk1_0))=esk5_1(esk1_0)|esk1_0=k1_xboole_0|~r2_tarski(esk2_1(esk5_1(esk1_0)),esk1_0)), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54, c_0_42]), c_0_29])]), c_0_30]), c_0_55])).
cnf(c_0_59, negated_conjecture, (r2_tarski(esk2_1(X1),esk1_0)|~r2_tarski(X1,esk1_0)), inference(spm,[status(thm)],[c_0_56, c_0_32])).
fof(c_0_60, plain, ![X33]:~r2_xboole_0(X33,X33), inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_57])])).
cnf(c_0_61, negated_conjecture, (esk2_1(esk5_1(esk1_0))=esk5_1(esk1_0)|esk1_0=k1_xboole_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58, c_0_59]), c_0_42])).
cnf(c_0_62, plain, (~r2_xboole_0(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_60])).
cnf(c_0_63, negated_conjecture, (esk1_0=k1_xboole_0|~m1_subset_1(esk5_1(esk1_0),esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_61]), c_0_62])).
cnf(c_0_64, negated_conjecture, (esk1_0=k1_xboole_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63, c_0_32]), c_0_42])).
cnf(c_0_65, plain, (v1_xboole_0(k1_xboole_0)), inference(split_conjunct,[status(thm)],[fc1_xboole_0])).
cnf(c_0_66, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30, c_0_64]), c_0_65])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 67
# Proof object clause steps            : 45
# Proof object formula steps           : 22
# Proof object conjectures             : 29
# Proof object clause conjectures      : 26
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 20
# Proof object initial formulas used   : 10
# Proof object generating inferences   : 24
# Proof object simplifying inferences  : 14
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 10
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 23
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 23
# Processed clauses                    : 363
# ...of these trivial                  : 0
# ...subsumed                          : 56
# ...remaining for further processing  : 307
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 9
# Backward-rewritten                   : 240
# Generated clauses                    : 1019
# ...of the previous two non-trivial   : 1239
# Contextual simplify-reflections      : 6
# Paramodulations                      : 1018
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 1
# 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  : 35
#    Positive orientable unit clauses  : 2
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 32
# Current number of unprocessed clauses: 693
# ...number of literals in the above   : 3175
# Current number of archived formulas  : 0
# Current number of archived clauses   : 271
# Clause-clause subsumption calls (NU) : 21113
# Rec. Clause-clause subsumption calls : 6978
# Non-unit clause-clause subsumptions  : 70
# Unit Clause-clause subsumption calls : 20
# 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          : 148370

# -------------------------------------------------
# User time                : 0.037 s
# System time              : 0.004 s
# Total time               : 0.041 s
# Maximum resident set size: 3620 pages
