%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET168-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:13:48 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.81s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 14 unt; 3 nHn; 20 RR)
% Number of literals : 46 ( 2 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 6 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_members_of_union3_2,negated_conjecture,
~ member(x,union(y,z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_members_of_union3_2) ).
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(prove_members_of_union3_1,negated_conjecture,
member(x,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_members_of_union3_1) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(c_0_8,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_9,negated_conjecture,
~ member(x,union(y,z)),
inference(fof_simplification,[status(thm)],[prove_members_of_union3_2]) ).
cnf(c_0_10,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_8 ).
cnf(c_0_11,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_12,negated_conjecture,
~ member(x,union(y,z)),
c_0_9 ).
cnf(c_0_13,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_14,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_15,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
member(x,z),
prove_members_of_union3_1 ).
cnf(c_0_17,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_18,negated_conjecture,
~ member(x,complement(intersection(complement(y),complement(z)))),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_22,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
member(x,intersection(complement(y),complement(z))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_24,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_21 ).
cnf(c_0_25,negated_conjecture,
member(x,complement(z)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET168-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.66 % Computer : n016.cluster.edu
% 0.19/0.66 % Model : x86_64 x86_64
% 0.19/0.66 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.66 % Memory : 8046.5625MB
% 0.19/0.66 % OS : Linux 6.8.0-71-generic
% 0.19/0.67 % CPULimit : 300
% 0.19/0.67 % WCLimit : 300
% 0.19/0.67 % DateTime : Mon Sep 21 05:02:24 UTC 2026
% 0.19/0.67 % CPUTime :
% 0.19/0.67 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.74 Running first-order theorem proving
% 0.23/0.74 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.23/0.81 % Version: 3.5.1
% 0.23/0.81 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.81 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.81 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.81 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.81 % Starting sh5l with 300s (1) cores
% 0.23/0.81 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1612286 completed with status 0
% 0.23/0.81 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.23/0.81 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.81 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.81 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.81 % No SInE strategy applied
% 0.23/0.81 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.23/0.81 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.81 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.81 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.81 % Starting new_bool_3 with 311s (1) cores
% 0.23/0.81 % Starting new_bool_1 with 308s (1) cores
% 0.23/0.81 % Starting sh5l with 304s (1) cores
% 0.23/0.81 % SubtermCWHack with pid 1612293 completed with status 0
% 0.23/0.81 % Result found by SubtermCWHack
% 0.23/0.81 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.81 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.81 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.81 % No SInE strategy applied
% 0.23/0.81 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.23/0.81 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.81 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.81 % Preprocessing time : 0.002 s
% 0.23/0.81
% 0.23/0.81 % Proof found!
% 0.23/0.81 % SZS status Unsatisfiable
% 0.23/0.81 % SZS output start CNFRefutation
% See solution above
% 0.23/0.81 % Parsed axioms : 114
% 0.23/0.81 % Removed by relevancy pruning/SinE : 0
% 0.23/0.81 % Initial clauses : 114
% 0.23/0.81 % Removed in clause preprocessing : 17
% 0.23/0.81 % Initial clauses in saturation : 97
% 0.23/0.81 % Processed clauses : 102
% 0.23/0.81 % ...of these trivial : 0
% 0.23/0.81 % ...subsumed : 14
% 0.23/0.81 % ...remaining for further processing : 88
% 0.23/0.81 % Other redundant clauses eliminated : 2
% 0.23/0.81 % Clauses deleted for lack of memory : 0
% 0.23/0.81 % Backward-subsumed : 0
% 0.23/0.81 % Backward-rewritten : 1
% 0.23/0.81 % Generated clauses : 128
% 0.23/0.81 % ...of the previous two non-redundant : 106
% 0.23/0.81 % ...aggressively subsumed : 0
% 0.23/0.81 % Contextual simplify-reflections : 1
% 0.23/0.81 % Paramodulations : 126
% 0.23/0.81 % Factorizations : 0
% 0.23/0.81 % NegExts : 0
% 0.23/0.81 % Equation resolutions : 2
% 0.23/0.81 % Disequality decompositions : 0
% 0.23/0.81 % Total rewrite steps : 16
% 0.23/0.81 % ...of those cached : 6
% 0.23/0.81 % Propositional unsat checks : 0
% 0.23/0.81 % Propositional check models : 0
% 0.23/0.81 % Propositional check unsatisfiable : 0
% 0.23/0.81 % Propositional clauses : 0
% 0.23/0.81 % Propositional clauses after purity: 0
% 0.23/0.81 % Propositional unsat core size : 0
% 0.23/0.81 % Propositional preprocessing time : 0.000
% 0.23/0.81 % Propositional encoding time : 0.000
% 0.23/0.81 % Propositional solver time : 0.000
% 0.23/0.81 % Success case prop preproc time : 0.000
% 0.23/0.81 % Success case prop encoding time : 0.000
% 0.23/0.81 % Success case prop solver time : 0.000
% 0.23/0.81 % Current number of processed clauses : 85
% 0.23/0.81 % Positive orientable unit clauses : 28
% 0.23/0.81 % Positive unorientable unit clauses: 1
% 0.23/0.81 % Negative unit clauses : 3
% 0.23/0.81 % Non-unit-clauses : 53
% 0.23/0.81 % Current number of unprocessed clauses: 101
% 0.23/0.81 % ...number of literals in the above : 246
% 0.23/0.81 % Current number of archived formulas : 0
% 0.23/0.81 % Current number of archived clauses : 18
% 0.23/0.81 % Clause-clause subsumption calls (NU) : 350
% 0.23/0.81 % Rec. Clause-clause subsumption calls : 223
% 0.23/0.81 % Non-unit clause-clause subsumptions : 12
% 0.23/0.81 % Unit Clause-clause subsumption calls : 116
% 0.23/0.81 % Rewrite failures with RHS unbound : 0
% 0.23/0.81 % BW rewrite match attempts : 3
% 0.23/0.81 % BW rewrite match successes : 1
% 0.23/0.81 % Condensation attempts : 0
% 0.23/0.81 % Condensation successes : 0
% 0.23/0.81 % Termbank termtop insertions : 6233
% 0.23/0.81 % Search garbage collected termcells : 185
% 0.23/0.81
% 0.23/0.81 % -------------------------------------------------
% 0.23/0.81 % User time : 0.013 s
% 0.23/0.81 % System time : 0.007 s
% 0.23/0.81 % Total time : 0.020 s
% 0.23/0.81 % Maximum resident set size: 4000 pages
% 0.23/0.81
% 0.23/0.81 % -------------------------------------------------
% 0.23/0.81 % User time : 0.028 s
% 0.23/0.81 % System time : 0.022 s
% 0.23/0.81 % Total time : 0.050 s
% 0.23/0.81 % Maximum resident set size: 4608 pages
% 0.23/0.81 % E exiting
%------------------------------------------------------------------------------