%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET132-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:16:39 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.53s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of clauses : 49 ( 26 unt; 6 nHn; 31 RR)
% Number of literals : 78 ( 12 equ; 33 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 65 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(prove_member_of_triple3_2,negated_conjecture,
~ member(u,set_builder(x,set_builder(y,set_builder(u,null_class)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_member_of_triple3_2) ).
cnf(definition_of_set_builder,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_of_set_builder) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_member_of_triple3_1,negated_conjecture,
member(u,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_member_of_triple3_1) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(unordered_pair2,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(c_0_13,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_14,negated_conjecture,
~ member(u,set_builder(x,set_builder(y,set_builder(u,null_class)))),
inference(fof_simplification,[status(thm)],[prove_member_of_triple3_2]) ).
cnf(c_0_15,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
definition_of_set_builder ).
cnf(c_0_16,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_18,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_13 ).
cnf(c_0_19,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_20,negated_conjecture,
~ member(u,set_builder(x,set_builder(y,set_builder(u,null_class)))),
c_0_14 ).
cnf(c_0_21,plain,
union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_23,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_24,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_17 ).
cnf(c_0_25,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_26,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_28,negated_conjecture,
~ member(u,complement(intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(null_class)))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]),c_0_21]),c_0_22]),c_0_22]),c_0_22]) ).
cnf(c_0_29,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_23 ).
cnf(c_0_30,negated_conjecture,
member(u,universal_class),
prove_member_of_triple3_1 ).
cnf(c_0_31,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_33,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_27 ).
cnf(c_0_34,negated_conjecture,
member(u,intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(null_class))))))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_35,plain,
null_class = complement(universal_class),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
member(u,complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(universal_class))))))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_37,negated_conjecture,
~ member(u,complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(universal_class)))))))),
inference(spm,[status(thm)],[c_0_24,c_0_36]) ).
cnf(c_0_38,negated_conjecture,
member(u,intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(universal_class))))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_29]),c_0_30])]) ).
cnf(c_0_39,negated_conjecture,
member(u,complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(universal_class)))))),
inference(spm,[status(thm)],[c_0_33,c_0_38]) ).
cnf(c_0_40,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_41,negated_conjecture,
~ member(u,complement(intersection(complement(unordered_pair(u,u)),complement(complement(universal_class))))),
inference(spm,[status(thm)],[c_0_24,c_0_39]) ).
cnf(c_0_42,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_40 ).
cnf(c_0_43,negated_conjecture,
member(u,intersection(complement(unordered_pair(u,u)),complement(complement(universal_class)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_29]),c_0_30])]) ).
cnf(c_0_44,negated_conjecture,
member(u,complement(unordered_pair(u,u))),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_46,negated_conjecture,
~ member(u,unordered_pair(u,u)),
inference(spm,[status(thm)],[c_0_24,c_0_44]) ).
cnf(c_0_47,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_45 ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET132-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n019.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 04:56:04 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.53 % Version: 3.5.1
% 0.15/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.53 % Starting sh5l with 300s (1) cores
% 0.15/0.53 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1730985 completed with status 0
% 0.15/0.53 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.53 % No SInE strategy applied
% 0.15/0.53 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.15/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.53 % Starting new_bool_3 with 311s (1) cores
% 0.15/0.53 % Starting new_bool_1 with 308s (1) cores
% 0.15/0.53 % Starting sh5l with 304s (1) cores
% 0.15/0.53 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1730993 completed with status 0
% 0.15/0.53 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.53 % No SInE strategy applied
% 0.15/0.53 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.15/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.53 % Preprocessing time : 0.004 s
% 0.15/0.53 % Presaturation interreduction done
% 0.15/0.53
% 0.15/0.53 % Proof found!
% 0.15/0.53 % SZS status Unsatisfiable
% 0.15/0.53 % SZS output start CNFRefutation
% See solution above
% 0.15/0.53 % Parsed axioms : 94
% 0.15/0.53 % Removed by relevancy pruning/SinE : 0
% 0.15/0.53 % Initial clauses : 94
% 0.15/0.53 % Removed in clause preprocessing : 16
% 0.15/0.53 % Initial clauses in saturation : 78
% 0.15/0.53 % Processed clauses : 180
% 0.15/0.53 % ...of these trivial : 1
% 0.15/0.53 % ...subsumed : 0
% 0.15/0.53 % ...remaining for further processing : 179
% 0.15/0.53 % Other redundant clauses eliminated : 3
% 0.15/0.53 % Clauses deleted for lack of memory : 0
% 0.15/0.53 % Backward-subsumed : 1
% 0.15/0.53 % Backward-rewritten : 14
% 0.15/0.53 % Generated clauses : 160
% 0.15/0.53 % ...of the previous two non-redundant : 137
% 0.15/0.53 % ...aggressively subsumed : 0
% 0.15/0.53 % Contextual simplify-reflections : 0
% 0.15/0.53 % Paramodulations : 157
% 0.15/0.53 % Factorizations : 0
% 0.15/0.53 % NegExts : 0
% 0.15/0.53 % Equation resolutions : 3
% 0.15/0.53 % Disequality decompositions : 0
% 0.15/0.53 % Total rewrite steps : 51
% 0.15/0.53 % ...of those cached : 42
% 0.15/0.53 % Propositional unsat checks : 0
% 0.15/0.53 % Propositional check models : 0
% 0.15/0.53 % Propositional check unsatisfiable : 0
% 0.15/0.53 % Propositional clauses : 0
% 0.15/0.53 % Propositional clauses after purity: 0
% 0.15/0.53 % Propositional unsat core size : 0
% 0.15/0.53 % Propositional preprocessing time : 0.000
% 0.15/0.53 % Propositional encoding time : 0.000
% 0.15/0.53 % Propositional solver time : 0.000
% 0.15/0.53 % Success case prop preproc time : 0.000
% 0.15/0.53 % Success case prop encoding time : 0.000
% 0.15/0.53 % Success case prop solver time : 0.000
% 0.15/0.53 % Current number of processed clauses : 84
% 0.15/0.53 % Positive orientable unit clauses : 27
% 0.15/0.53 % Positive unorientable unit clauses: 1
% 0.15/0.53 % Negative unit clauses : 8
% 0.15/0.53 % Non-unit-clauses : 48
% 0.15/0.53 % Current number of unprocessed clauses: 111
% 0.15/0.53 % ...number of literals in the above : 295
% 0.15/0.53 % Current number of archived formulas : 0
% 0.15/0.53 % Current number of archived clauses : 108
% 0.15/0.53 % Clause-clause subsumption calls (NU) : 1192
% 0.15/0.53 % Rec. Clause-clause subsumption calls : 760
% 0.15/0.53 % Non-unit clause-clause subsumptions : 1
% 0.15/0.53 % Unit Clause-clause subsumption calls : 56
% 0.15/0.53 % Rewrite failures with RHS unbound : 0
% 0.15/0.53 % BW rewrite match attempts : 17
% 0.15/0.53 % BW rewrite match successes : 5
% 0.15/0.53 % Condensation attempts : 0
% 0.15/0.53 % Condensation successes : 0
% 0.15/0.53 % Termbank termtop insertions : 8492
% 0.15/0.53 % Search garbage collected termcells : 156
% 0.15/0.53
% 0.15/0.53 % -------------------------------------------------
% 0.15/0.53 % User time : 0.038 s
% 0.15/0.53 % System time : 0.003 s
% 0.15/0.53 % Total time : 0.041 s
% 0.15/0.53 % Maximum resident set size: 3976 pages
% 0.15/0.53
% 0.15/0.53 % -------------------------------------------------
% 0.15/0.53 % User time : 0.107 s
% 0.15/0.53 % System time : 0.029 s
% 0.15/0.53 % Total time : 0.136 s
% 0.15/0.53 % Maximum resident set size: 4864 pages
% 0.15/0.53 % E exiting
%------------------------------------------------------------------------------