%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET157-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:46 PM UTC 2026
% Result : Unsatisfiable 0.97s 0.71s
% Output : CNFRefutation 0.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 51 ( 19 unt; 11 nHn; 36 RR)
% Number of literals : 95 ( 19 equ; 44 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 : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 69 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(prove_complement_is_unique_1,negated_conjecture,
union(x,y) = universal_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_complement_is_unique_1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(not_subclass_members2,axiom,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(not_subclass_members1,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(prove_complement_is_unique_2,negated_conjecture,
intersection(x,y) = null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_complement_is_unique_2) ).
cnf(subclass_implies_equal,axiom,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(prove_complement_is_unique_3,negated_conjecture,
complement(x) != y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_complement_is_unique_3) ).
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,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_15,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_13 ).
cnf(c_0_16,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_17,negated_conjecture,
union(x,y) = universal_class,
prove_complement_is_unique_1 ).
cnf(c_0_18,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_19,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_14 ).
cnf(c_0_20,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_21,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
complement(intersection(complement(x),complement(y))) = universal_class,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_25,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_26,negated_conjecture,
~ member(X1,intersection(complement(x),complement(y))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_22]),c_0_21]) ).
cnf(c_0_27,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_25 ).
cnf(c_0_29,negated_conjecture,
intersection(complement(x),complement(y)) = null_class,
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_30,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_27]),c_0_21]) ).
cnf(c_0_31,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_32,negated_conjecture,
( ~ member(X1,complement(x))
| ~ member(X1,complement(y)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_33,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_31 ).
cnf(c_0_34,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_35,negated_conjecture,
( ~ member(X1,complement(x))
| member(X1,y) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_21]) ).
cnf(c_0_36,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_37,negated_conjecture,
intersection(x,y) = null_class,
prove_complement_is_unique_2 ).
cnf(c_0_38,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_39,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_34 ).
cnf(c_0_40,negated_conjecture,
( subclass(complement(x),X1)
| member(not_subclass_element(complement(x),X1),y) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
complement(x) != y,
inference(fof_simplification,[status(thm)],[prove_complement_is_unique_3]) ).
cnf(c_0_42,negated_conjecture,
( ~ member(X1,x)
| ~ member(X1,y) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_37]),c_0_30]) ).
cnf(c_0_43,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_21,c_0_36]) ).
cnf(c_0_44,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_38 ).
cnf(c_0_45,negated_conjecture,
subclass(complement(x),y),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
complement(x) != y,
c_0_41 ).
cnf(c_0_47,negated_conjecture,
( ~ member(not_subclass_element(y,X1),x)
| subclass(y,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_36]) ).
cnf(c_0_48,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_43]) ).
cnf(c_0_49,negated_conjecture,
~ subclass(y,complement(x)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET157-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n003.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 04:58:46 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.97/0.71 % Version: 3.5.1
% 0.97/0.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.97/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.97/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.97/0.71 % Starting new_bool_3 with 300s (1) cores
% 0.97/0.71 % Starting new_bool_1 with 300s (1) cores
% 0.97/0.71 % Starting sh5l with 300s (1) cores
% 0.97/0.71 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3458686 completed with status 0
% 0.97/0.71 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.97/0.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.97/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.97/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.97/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.97/0.71 % No SInE strategy applied
% 0.97/0.71 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.97/0.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.97/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.97/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.97/0.71 % Starting new_bool_3 with 311s (1) cores
% 0.97/0.71 % Starting new_bool_1 with 308s (1) cores
% 0.97/0.71 % Starting sh5l with 304s (1) cores
% 0.97/0.71 % SubtermCWHack with pid 3458693 completed with status 0
% 0.97/0.71 % Result found by SubtermCWHack
% 0.97/0.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.97/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.97/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.97/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.97/0.71 % No SInE strategy applied
% 0.97/0.71 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.97/0.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.97/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.97/0.71 % Preprocessing time : 0.003 s
% 0.97/0.71
% 0.97/0.71 % Proof found!
% 0.97/0.71 % SZS status Unsatisfiable
% 0.97/0.71 % SZS output start CNFRefutation
% See solution above
% 0.97/0.71 % Parsed axioms : 115
% 0.97/0.71 % Removed by relevancy pruning/SinE : 0
% 0.97/0.71 % Initial clauses : 115
% 0.97/0.71 % Removed in clause preprocessing : 17
% 0.97/0.71 % Initial clauses in saturation : 98
% 0.97/0.71 % Processed clauses : 649
% 0.97/0.71 % ...of these trivial : 6
% 0.97/0.71 % ...subsumed : 290
% 0.97/0.71 % ...remaining for further processing : 353
% 0.97/0.71 % Other redundant clauses eliminated : 4
% 0.97/0.71 % Clauses deleted for lack of memory : 0
% 0.97/0.71 % Backward-subsumed : 14
% 0.97/0.71 % Backward-rewritten : 18
% 0.97/0.71 % Generated clauses : 1666
% 0.97/0.71 % ...of the previous two non-redundant : 1326
% 0.97/0.71 % ...aggressively subsumed : 0
% 0.97/0.71 % Contextual simplify-reflections : 7
% 0.97/0.71 % Paramodulations : 1662
% 0.97/0.71 % Factorizations : 0
% 0.97/0.71 % NegExts : 0
% 0.97/0.71 % Equation resolutions : 4
% 0.97/0.71 % Disequality decompositions : 0
% 0.97/0.71 % Total rewrite steps : 515
% 0.97/0.71 % ...of those cached : 412
% 0.97/0.71 % Propositional unsat checks : 0
% 0.97/0.71 % Propositional check models : 0
% 0.97/0.71 % Propositional check unsatisfiable : 0
% 0.97/0.71 % Propositional clauses : 0
% 0.97/0.71 % Propositional clauses after purity: 0
% 0.97/0.71 % Propositional unsat core size : 0
% 0.97/0.71 % Propositional preprocessing time : 0.000
% 0.97/0.71 % Propositional encoding time : 0.000
% 0.97/0.71 % Propositional solver time : 0.000
% 0.97/0.71 % Success case prop preproc time : 0.000
% 0.97/0.71 % Success case prop encoding time : 0.000
% 0.97/0.71 % Success case prop solver time : 0.000
% 0.97/0.71 % Current number of processed clauses : 317
% 0.97/0.71 % Positive orientable unit clauses : 62
% 0.97/0.71 % Positive unorientable unit clauses: 1
% 0.97/0.71 % Negative unit clauses : 3
% 0.97/0.71 % Non-unit-clauses : 251
% 0.97/0.71 % Current number of unprocessed clauses: 721
% 0.97/0.71 % ...number of literals in the above : 2100
% 0.97/0.71 % Current number of archived formulas : 0
% 0.97/0.71 % Current number of archived clauses : 49
% 0.97/0.71 % Clause-clause subsumption calls (NU) : 9253
% 0.97/0.71 % Rec. Clause-clause subsumption calls : 5938
% 0.97/0.71 % Non-unit clause-clause subsumptions : 219
% 0.97/0.71 % Unit Clause-clause subsumption calls : 204
% 0.97/0.71 % Rewrite failures with RHS unbound : 0
% 0.97/0.71 % BW rewrite match attempts : 28
% 0.97/0.71 % BW rewrite match successes : 18
% 0.97/0.71 % Condensation attempts : 0
% 0.97/0.71 % Condensation successes : 0
% 0.97/0.71 % Termbank termtop insertions : 49382
% 0.97/0.71 % Search garbage collected termcells : 185
% 0.97/0.71
% 0.97/0.71 % -------------------------------------------------
% 0.97/0.71 % User time : 0.086 s
% 0.97/0.71 % System time : 0.010 s
% 0.97/0.71 % Total time : 0.096 s
% 0.97/0.71 % Maximum resident set size: 3488 pages
% 0.97/0.71
% 0.97/0.71 % -------------------------------------------------
% 0.97/0.71 % User time : 0.509 s
% 0.97/0.71 % System time : 0.040 s
% 0.97/0.71 % Total time : 0.549 s
% 0.97/0.71 % Maximum resident set size: 4608 pages
% 0.97/0.71 % E exiting
%------------------------------------------------------------------------------