%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET151-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 : n005.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:45 PM UTC 2026
% Result : Unsatisfiable 0.31s 0.68s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 9 unt; 10 nHn; 21 RR)
% Number of literals : 68 ( 12 equ; 31 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 5 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(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(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(not_subclass_members2,axiom,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
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(not_subclass_members1,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(subclass_implies_equal,axiom,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(prove_complement_of_null_class_1,negated_conjecture,
complement(null_class) != universal_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_complement_of_null_class_1) ).
cnf(c_0_9,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_10,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_11,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_9 ).
cnf(c_0_12,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_13,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_10 ).
cnf(c_0_14,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_15,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_19,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_20,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_21,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_22,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_18 ).
cnf(c_0_24,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_19 ).
cnf(c_0_25,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_26,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_21 ).
cnf(c_0_27,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_22]),c_0_15]) ).
cnf(c_0_28,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,negated_conjecture,
complement(null_class) != universal_class,
inference(fof_simplification,[status(thm)],[prove_complement_of_null_class_1]) ).
cnf(c_0_30,plain,
( ~ subclass(universal_class,X1)
| universal_class = X1 ),
inference(spm,[status(thm)],[c_0_26,c_0_12]) ).
cnf(c_0_31,plain,
subclass(X1,complement(null_class)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
complement(null_class) != universal_class,
c_0_29 ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET151-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.19/0.46 % Computer : n005.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 04:56:48 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.54 Running first-order theorem proving
% 0.25/0.55 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.31/0.68 % Version: 3.5.1
% 0.31/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.68 % Starting sh5l with 300s (1) cores
% 0.31/0.68 % sh5l with pid 2601632 completed with status 0
% 0.31/0.68 % Result found by sh5l
% 0.31/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.68 % Starting sh5l with 300s (1) cores
% 0.31/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.31/0.68 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.31/0.68 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.31/0.68 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.31/0.68 % Starting SubtermCWHack with 28s (1) cores
% 0.31/0.68 % SubtermCWHack with pid 2601635 completed with status 0
% 0.31/0.68 % Result found by SubtermCWHack
% 0.31/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.68 % Starting sh5l with 300s (1) cores
% 0.31/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.31/0.68 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.31/0.68 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.31/0.68 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.31/0.68 % Starting SubtermCWHack with 28s (1) cores
% 0.31/0.68 % Preprocessing time : 0.004 s
% 0.31/0.68
% 0.31/0.68 % Proof found!
% 0.31/0.68 % SZS status Unsatisfiable
% 0.31/0.68 % SZS output start CNFRefutation
% See solution above
% 0.31/0.68 % Parsed axioms : 113
% 0.31/0.68 % Removed by relevancy pruning/SinE : 14
% 0.31/0.68 % Initial clauses : 99
% 0.31/0.68 % Removed in clause preprocessing : 0
% 0.31/0.68 % Initial clauses in saturation : 99
% 0.31/0.68 % Processed clauses : 562
% 0.31/0.68 % ...of these trivial : 3
% 0.31/0.68 % ...subsumed : 208
% 0.31/0.68 % ...remaining for further processing : 351
% 0.31/0.68 % Other redundant clauses eliminated : 3
% 0.31/0.68 % Clauses deleted for lack of memory : 0
% 0.31/0.68 % Backward-subsumed : 16
% 0.31/0.68 % Backward-rewritten : 7
% 0.31/0.68 % Generated clauses : 2024
% 0.31/0.68 % ...of the previous two non-redundant : 1724
% 0.31/0.68 % ...aggressively subsumed : 0
% 0.31/0.68 % Contextual simplify-reflections : 2
% 0.31/0.68 % Paramodulations : 2021
% 0.31/0.68 % Factorizations : 0
% 0.31/0.68 % NegExts : 0
% 0.31/0.68 % Equation resolutions : 3
% 0.31/0.68 % Disequality decompositions : 0
% 0.31/0.68 % Total rewrite steps : 422
% 0.31/0.68 % ...of those cached : 327
% 0.31/0.68 % Propositional unsat checks : 0
% 0.31/0.68 % Propositional check models : 0
% 0.31/0.68 % Propositional check unsatisfiable : 0
% 0.31/0.68 % Propositional clauses : 0
% 0.31/0.68 % Propositional clauses after purity: 0
% 0.31/0.68 % Propositional unsat core size : 0
% 0.31/0.68 % Propositional preprocessing time : 0.000
% 0.31/0.68 % Propositional encoding time : 0.000
% 0.31/0.68 % Propositional solver time : 0.000
% 0.31/0.68 % Success case prop preproc time : 0.000
% 0.31/0.68 % Success case prop encoding time : 0.000
% 0.31/0.68 % Success case prop solver time : 0.000
% 0.31/0.68 % Current number of processed clauses : 325
% 0.31/0.68 % Positive orientable unit clauses : 77
% 0.31/0.68 % Positive unorientable unit clauses: 8
% 0.31/0.68 % Negative unit clauses : 10
% 0.31/0.68 % Non-unit-clauses : 230
% 0.31/0.68 % Current number of unprocessed clauses: 1222
% 0.31/0.68 % ...number of literals in the above : 3101
% 0.31/0.68 % Current number of archived formulas : 0
% 0.31/0.68 % Current number of archived clauses : 23
% 0.31/0.68 % Clause-clause subsumption calls (NU) : 9514
% 0.31/0.68 % Rec. Clause-clause subsumption calls : 7913
% 0.31/0.68 % Non-unit clause-clause subsumptions : 147
% 0.31/0.68 % Unit Clause-clause subsumption calls : 624
% 0.31/0.68 % Rewrite failures with RHS unbound : 50
% 0.31/0.68 % BW rewrite match attempts : 27
% 0.31/0.68 % BW rewrite match successes : 14
% 0.31/0.68 % Condensation attempts : 0
% 0.31/0.68 % Condensation successes : 0
% 0.31/0.68 % Termbank termtop insertions : 26213
% 0.31/0.68 % Search garbage collected termcells : 229
% 0.31/0.68
% 0.31/0.68 % -------------------------------------------------
% 0.31/0.68 % User time : 0.079 s
% 0.31/0.68 % System time : 0.005 s
% 0.31/0.68 % Total time : 0.084 s
% 0.31/0.68 % Maximum resident set size: 3992 pages
% 0.31/0.68
% 0.31/0.68 % -------------------------------------------------
% 0.31/0.68 % User time : 0.086 s
% 0.31/0.68 % System time : 0.010 s
% 0.31/0.68 % Total time : 0.096 s
% 0.31/0.68 % Maximum resident set size: 4864 pages
% 0.31/0.68 % E exiting
%------------------------------------------------------------------------------