%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET506-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 : n018.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:14:17 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.65s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 9 unt; 4 nHn; 15 RR)
% Number of literals : 36 ( 8 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 25 ( 4 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(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(prove_universal_class_not_null_class_1,negated_conjecture,
universal_class = null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_universal_class_not_null_class_1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(omega_in_universal,axiom,
member(omega,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',omega_in_universal) ).
cnf(c_0_6,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_7,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_8,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_9,negated_conjecture,
universal_class = null_class,
prove_universal_class_not_null_class_1 ).
cnf(c_0_10,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_6 ).
cnf(c_0_11,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_12,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_7 ).
cnf(c_0_13,plain,
( member(regular(X1),X1)
| X1 = universal_class ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = universal_class ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( member(regular(X1),universal_class)
| X1 = universal_class ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_17,plain,
complement(universal_class) = universal_class,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
member(omega,universal_class),
omega_in_universal ).
cnf(c_0_19,plain,
~ member(X1,universal_class),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[c_0_18,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET506-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.10/0.57 % Computer : n018.cluster.edu
% 0.10/0.57 % Model : x86_64 x86_64
% 0.10/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57 % Memory : 8046.5625MB
% 0.10/0.57 % OS : Linux 6.8.0-71-generic
% 0.10/0.57 % CPULimit : 300
% 0.10/0.57 % WCLimit : 300
% 0.10/0.57 % DateTime : Mon Sep 21 05:24:45 UTC 2026
% 0.10/0.57 % CPUTime :
% 0.10/0.57 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.62 Running first-order theorem proving
% 0.10/0.62 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.14/0.65 % Version: 3.5.1
% 0.14/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.65 % Starting sh5l with 300s (1) cores
% 0.14/0.65 % sh5l with pid 1046362 completed with status 0
% 0.14/0.65 % Result found by sh5l
% 0.14/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.65 % Starting sh5l with 300s (1) cores
% 0.14/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.65 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.65 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.14/0.65 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.65 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.65 % SubtermCWHack with pid 1046370 completed with status 0
% 0.14/0.65 % Result found by SubtermCWHack
% 0.14/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.65 % Starting sh5l with 300s (1) cores
% 0.14/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.65 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.65 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.14/0.65 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.65 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.65 % Preprocessing time : 0.002 s
% 0.14/0.65
% 0.14/0.65 % Proof found!
% 0.14/0.65 % SZS status Unsatisfiable
% 0.14/0.65 % SZS output start CNFRefutation
% See solution above
% 0.14/0.65 % Parsed axioms : 113
% 0.14/0.65 % Removed by relevancy pruning/SinE : 14
% 0.14/0.65 % Initial clauses : 99
% 0.14/0.65 % Removed in clause preprocessing : 0
% 0.14/0.65 % Initial clauses in saturation : 99
% 0.14/0.65 % Processed clauses : 92
% 0.14/0.65 % ...of these trivial : 0
% 0.14/0.65 % ...subsumed : 10
% 0.14/0.65 % ...remaining for further processing : 82
% 0.14/0.65 % Other redundant clauses eliminated : 2
% 0.14/0.65 % Clauses deleted for lack of memory : 0
% 0.14/0.65 % Backward-subsumed : 7
% 0.14/0.65 % Backward-rewritten : 1
% 0.14/0.65 % Generated clauses : 113
% 0.14/0.65 % ...of the previous two non-redundant : 91
% 0.14/0.65 % ...aggressively subsumed : 0
% 0.14/0.65 % Contextual simplify-reflections : 0
% 0.14/0.65 % Paramodulations : 105
% 0.14/0.65 % Factorizations : 0
% 0.14/0.65 % NegExts : 0
% 0.14/0.65 % Equation resolutions : 2
% 0.14/0.65 % Disequality decompositions : 0
% 0.14/0.65 % Total rewrite steps : 16
% 0.14/0.65 % ...of those cached : 6
% 0.14/0.65 % Propositional unsat checks : 0
% 0.14/0.65 % Propositional check models : 0
% 0.14/0.65 % Propositional check unsatisfiable : 0
% 0.14/0.65 % Propositional clauses : 0
% 0.14/0.65 % Propositional clauses after purity: 0
% 0.14/0.65 % Propositional unsat core size : 0
% 0.14/0.65 % Propositional preprocessing time : 0.000
% 0.14/0.65 % Propositional encoding time : 0.000
% 0.14/0.65 % Propositional solver time : 0.000
% 0.14/0.65 % Success case prop preproc time : 0.000
% 0.14/0.65 % Success case prop encoding time : 0.000
% 0.14/0.65 % Success case prop solver time : 0.000
% 0.14/0.65 % Current number of processed clauses : 66
% 0.14/0.65 % Positive orientable unit clauses : 23
% 0.14/0.65 % Positive unorientable unit clauses: 0
% 0.14/0.65 % Negative unit clauses : 1
% 0.14/0.65 % Non-unit-clauses : 42
% 0.14/0.65 % Current number of unprocessed clauses: 96
% 0.14/0.65 % ...number of literals in the above : 222
% 0.14/0.65 % Current number of archived formulas : 0
% 0.14/0.65 % Current number of archived clauses : 14
% 0.14/0.65 % Clause-clause subsumption calls (NU) : 502
% 0.14/0.65 % Rec. Clause-clause subsumption calls : 450
% 0.14/0.65 % Non-unit clause-clause subsumptions : 10
% 0.14/0.65 % Unit Clause-clause subsumption calls : 50
% 0.14/0.65 % Rewrite failures with RHS unbound : 0
% 0.14/0.65 % BW rewrite match attempts : 6
% 0.14/0.65 % BW rewrite match successes : 1
% 0.14/0.65 % Condensation attempts : 0
% 0.14/0.65 % Condensation successes : 0
% 0.14/0.65 % Termbank termtop insertions : 3873
% 0.14/0.65 % Search garbage collected termcells : 227
% 0.14/0.65
% 0.14/0.65 % -------------------------------------------------
% 0.14/0.65 % User time : 0.009 s
% 0.14/0.65 % System time : 0.003 s
% 0.14/0.65 % Total time : 0.012 s
% 0.14/0.65 % Maximum resident set size: 3736 pages
% 0.14/0.65
% 0.14/0.65 % -------------------------------------------------
% 0.14/0.65 % User time : 0.014 s
% 0.14/0.65 % System time : 0.008 s
% 0.14/0.65 % Total time : 0.021 s
% 0.14/0.65 % Maximum resident set size: 4864 pages
% 0.14/0.65 % E exiting
%------------------------------------------------------------------------------