%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET123-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 : n016.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:38 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.58s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 40 ( 22 unt; 6 nHn; 28 RR)
% Number of literals : 70 ( 16 equ; 35 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 55 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
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(prove_set_builder_alternate_defn1_1,negated_conjecture,
member(x,set_builder(y,z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_set_builder_alternate_defn1_1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
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(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
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(prove_set_builder_alternate_defn1_3,negated_conjecture,
~ member(x,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_set_builder_alternate_defn1_3) ).
cnf(unordered_pair_member,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(prove_set_builder_alternate_defn1_2,negated_conjecture,
x != y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_set_builder_alternate_defn1_2) ).
cnf(c_0_12,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
definition_of_set_builder ).
cnf(c_0_13,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_14,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_15,negated_conjecture,
member(x,set_builder(y,z)),
prove_set_builder_alternate_defn1_1 ).
cnf(c_0_16,plain,
union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_18,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_19,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
member(x,complement(intersection(complement(unordered_pair(y,y)),complement(z)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_21,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_22,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_18 ).
cnf(c_0_23,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_24,negated_conjecture,
~ member(x,intersection(complement(unordered_pair(y,y)),complement(z))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_21 ).
cnf(c_0_26,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_27,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(x,complement(z))
| ~ member(x,complement(unordered_pair(y,y))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_26 ).
cnf(c_0_30,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
cnf(c_0_31,negated_conjecture,
~ member(x,z),
inference(fof_simplification,[status(thm)],[prove_set_builder_alternate_defn1_3]) ).
cnf(c_0_32,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_33,negated_conjecture,
( ~ member(x,complement(z))
| member(x,unordered_pair(y,y)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_34,negated_conjecture,
~ member(x,z),
c_0_31 ).
cnf(c_0_35,negated_conjecture,
x != y,
inference(fof_simplification,[status(thm)],[prove_set_builder_alternate_defn1_2]) ).
cnf(c_0_36,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
member(x,unordered_pair(y,y)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_30])]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
x != y,
c_0_35 ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET123-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n016.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 04:59:38 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.53 Running first-order theorem proving
% 0.25/0.53 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.25/0.58 % Version: 3.5.1
% 0.25/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.58 % Starting sh5l with 300s (1) cores
% 0.25/0.58 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1605762 completed with status 0
% 0.25/0.58 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.25/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.58 % No SInE strategy applied
% 0.25/0.58 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.25/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.25/0.58 % Starting new_bool_3 with 311s (1) cores
% 0.25/0.58 % Starting new_bool_1 with 308s (1) cores
% 0.25/0.58 % Starting sh5l with 304s (1) cores
% 0.25/0.58 % SubtermCWHack with pid 1605769 completed with status 0
% 0.25/0.58 % Result found by SubtermCWHack
% 0.25/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.58 % No SInE strategy applied
% 0.25/0.58 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.25/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.58 % Preprocessing time : 0.004 s
% 0.25/0.58
% 0.25/0.58 % Proof found!
% 0.25/0.58 % SZS status Unsatisfiable
% 0.25/0.58 % SZS output start CNFRefutation
% See solution above
% 0.25/0.58 % Parsed axioms : 95
% 0.25/0.58 % Removed by relevancy pruning/SinE : 0
% 0.25/0.58 % Initial clauses : 95
% 0.25/0.58 % Removed in clause preprocessing : 16
% 0.25/0.58 % Initial clauses in saturation : 79
% 0.25/0.58 % Processed clauses : 96
% 0.25/0.58 % ...of these trivial : 0
% 0.25/0.58 % ...subsumed : 13
% 0.25/0.58 % ...remaining for further processing : 83
% 0.25/0.58 % Other redundant clauses eliminated : 2
% 0.25/0.58 % Clauses deleted for lack of memory : 0
% 0.25/0.58 % Backward-subsumed : 0
% 0.25/0.58 % Backward-rewritten : 2
% 0.25/0.58 % Generated clauses : 124
% 0.25/0.58 % ...of the previous two non-redundant : 103
% 0.25/0.58 % ...aggressively subsumed : 0
% 0.25/0.58 % Contextual simplify-reflections : 1
% 0.25/0.58 % Paramodulations : 122
% 0.25/0.58 % Factorizations : 0
% 0.25/0.58 % NegExts : 0
% 0.25/0.58 % Equation resolutions : 2
% 0.25/0.58 % Disequality decompositions : 0
% 0.25/0.58 % Total rewrite steps : 16
% 0.25/0.58 % ...of those cached : 6
% 0.25/0.58 % Propositional unsat checks : 0
% 0.25/0.58 % Propositional check models : 0
% 0.25/0.58 % Propositional check unsatisfiable : 0
% 0.25/0.58 % Propositional clauses : 0
% 0.25/0.58 % Propositional clauses after purity: 0
% 0.25/0.58 % Propositional unsat core size : 0
% 0.25/0.58 % Propositional preprocessing time : 0.000
% 0.25/0.58 % Propositional encoding time : 0.000
% 0.25/0.58 % Propositional solver time : 0.000
% 0.25/0.58 % Success case prop preproc time : 0.000
% 0.25/0.58 % Success case prop encoding time : 0.000
% 0.25/0.58 % Success case prop solver time : 0.000
% 0.25/0.58 % Current number of processed clauses : 79
% 0.25/0.58 % Positive orientable unit clauses : 20
% 0.25/0.58 % Positive unorientable unit clauses: 1
% 0.25/0.58 % Negative unit clauses : 4
% 0.25/0.58 % Non-unit-clauses : 54
% 0.25/0.58 % Current number of unprocessed clauses: 85
% 0.25/0.58 % ...number of literals in the above : 217
% 0.25/0.58 % Current number of archived formulas : 0
% 0.25/0.58 % Current number of archived clauses : 18
% 0.25/0.58 % Clause-clause subsumption calls (NU) : 500
% 0.25/0.58 % Rec. Clause-clause subsumption calls : 341
% 0.25/0.58 % Non-unit clause-clause subsumptions : 11
% 0.25/0.58 % Unit Clause-clause subsumption calls : 76
% 0.25/0.58 % Rewrite failures with RHS unbound : 0
% 0.25/0.58 % BW rewrite match attempts : 4
% 0.25/0.58 % BW rewrite match successes : 2
% 0.25/0.58 % Condensation attempts : 0
% 0.25/0.58 % Condensation successes : 0
% 0.25/0.58 % Termbank termtop insertions : 5374
% 0.25/0.58 % Search garbage collected termcells : 158
% 0.25/0.58
% 0.25/0.58 % -------------------------------------------------
% 0.25/0.58 % User time : 0.019 s
% 0.25/0.58 % System time : 0.005 s
% 0.25/0.58 % Total time : 0.024 s
% 0.25/0.58 % Maximum resident set size: 3720 pages
% 0.25/0.58
% 0.25/0.58 % -------------------------------------------------
% 0.25/0.58 % User time : 0.067 s
% 0.25/0.58 % System time : 0.030 s
% 0.25/0.58 % Total time : 0.098 s
% 0.25/0.58 % Maximum resident set size: 4864 pages
% 0.25/0.58 % E exiting
%------------------------------------------------------------------------------