%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET098-7 : 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 : n014.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:32 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.51s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 14 unt; 5 nHn; 17 RR)
% Number of literals : 32 ( 14 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_corollary_1_to_number_of_elements_in_class_1,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_number_of_elements_in_class_1) ).
cnf(null_class_is_unique,axiom,
( member(not_subclass_element(X1,null_class),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_class_is_unique) ).
cnf(prove_corollary_1_to_number_of_elements_in_class_2,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_number_of_elements_in_class_2) ).
cnf(prove_corollary_1_to_number_of_elements_in_class_3,negated_conjecture,
x != null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_number_of_elements_in_class_3) ).
cnf(existence_of_null_class,axiom,
~ member(X1,null_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_null_class) ).
cnf(number_of_elements_in_class,axiom,
( X1 = null_class
| singleton(not_subclass_element(X1,null_class)) = X1
| member(not_subclass_element(intersection(complement(singleton(not_subclass_element(X1,null_class))),X1),null_class),intersection(complement(singleton(not_subclass_element(X1,null_class))),X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',number_of_elements_in_class) ).
cnf(c_0_7,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_8,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),x),
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_number_of_elements_in_class_1]) ).
cnf(c_0_9,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_7 ).
cnf(c_0_10,axiom,
( member(not_subclass_element(X1,null_class),X1)
| X1 = null_class ),
null_class_is_unique ).
cnf(c_0_11,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),x),
c_0_8 ).
cnf(c_0_12,plain,
( member(not_subclass_element(intersection(X1,X2),null_class),X2)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_number_of_elements_in_class_2]) ).
cnf(c_0_14,negated_conjecture,
x != null_class,
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_number_of_elements_in_class_3]) ).
cnf(c_0_15,plain,
~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[existence_of_null_class]) ).
cnf(c_0_16,axiom,
( X1 = null_class
| singleton(not_subclass_element(X1,null_class)) = X1
| member(not_subclass_element(intersection(complement(singleton(not_subclass_element(X1,null_class))),X1),null_class),intersection(complement(singleton(not_subclass_element(X1,null_class))),X1)) ),
number_of_elements_in_class ).
cnf(c_0_17,negated_conjecture,
intersection(complement(singleton(not_subclass_element(x,null_class))),x) = null_class,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
c_0_13 ).
cnf(c_0_19,negated_conjecture,
x != null_class,
c_0_14 ).
cnf(c_0_20,plain,
~ member(X1,null_class),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET098-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n014.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 04:52:34 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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.13/0.51 % Version: 3.5.1
% 0.13/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.51 % Starting sh5l with 300s (1) cores
% 0.13/0.51 % new_bool_1 with pid 3178654 completed with status 0
% 0.13/0.51 % Result found by new_bool_1
% 0.13/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.51 % Search class: FGHSM-FFMF21-MFFFFFNN
% 0.13/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.51 % SubtermCWHack with pid 3178660 completed with status 0
% 0.13/0.51 % Result found by SubtermCWHack
% 0.13/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.51 % Search class: FGHSM-FFMF21-MFFFFFNN
% 0.13/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.51 % Preprocessing time : 0.002 s
% 0.13/0.51
% 0.13/0.51 % Proof found!
% 0.13/0.51 % SZS status Unsatisfiable
% 0.13/0.51 % SZS output start CNFRefutation
% See solution above
% 0.13/0.51 % Parsed axioms : 144
% 0.13/0.51 % Removed by relevancy pruning/SinE : 79
% 0.13/0.51 % Initial clauses : 65
% 0.13/0.51 % Removed in clause preprocessing : 0
% 0.13/0.51 % Initial clauses in saturation : 65
% 0.13/0.51 % Processed clauses : 290
% 0.13/0.51 % ...of these trivial : 10
% 0.13/0.51 % ...subsumed : 144
% 0.13/0.51 % ...remaining for further processing : 136
% 0.13/0.51 % Other redundant clauses eliminated : 2
% 0.13/0.51 % Clauses deleted for lack of memory : 0
% 0.13/0.51 % Backward-subsumed : 1
% 0.13/0.51 % Backward-rewritten : 1
% 0.13/0.51 % Generated clauses : 891
% 0.13/0.51 % ...of the previous two non-redundant : 574
% 0.13/0.51 % ...aggressively subsumed : 0
% 0.13/0.51 % Contextual simplify-reflections : 0
% 0.13/0.51 % Paramodulations : 886
% 0.13/0.51 % Factorizations : 2
% 0.13/0.51 % NegExts : 0
% 0.13/0.51 % Equation resolutions : 3
% 0.13/0.51 % Disequality decompositions : 0
% 0.13/0.51 % Total rewrite steps : 332
% 0.13/0.51 % ...of those cached : 256
% 0.13/0.51 % Propositional unsat checks : 0
% 0.13/0.51 % Propositional check models : 0
% 0.13/0.51 % Propositional check unsatisfiable : 0
% 0.13/0.51 % Propositional clauses : 0
% 0.13/0.51 % Propositional clauses after purity: 0
% 0.13/0.51 % Propositional unsat core size : 0
% 0.13/0.51 % Propositional preprocessing time : 0.000
% 0.13/0.51 % Propositional encoding time : 0.000
% 0.13/0.51 % Propositional solver time : 0.000
% 0.13/0.51 % Success case prop preproc time : 0.000
% 0.13/0.51 % Success case prop encoding time : 0.000
% 0.13/0.51 % Success case prop solver time : 0.000
% 0.13/0.51 % Current number of processed clauses : 132
% 0.13/0.51 % Positive orientable unit clauses : 31
% 0.13/0.51 % Positive unorientable unit clauses: 1
% 0.13/0.51 % Negative unit clauses : 6
% 0.13/0.51 % Non-unit-clauses : 94
% 0.13/0.51 % Current number of unprocessed clauses: 343
% 0.13/0.51 % ...number of literals in the above : 1085
% 0.13/0.51 % Current number of archived formulas : 0
% 0.13/0.51 % Current number of archived clauses : 2
% 0.13/0.51 % Clause-clause subsumption calls (NU) : 1010
% 0.13/0.51 % Rec. Clause-clause subsumption calls : 910
% 0.13/0.51 % Non-unit clause-clause subsumptions : 123
% 0.13/0.51 % Unit Clause-clause subsumption calls : 54
% 0.13/0.51 % Rewrite failures with RHS unbound : 0
% 0.13/0.51 % BW rewrite match attempts : 13
% 0.13/0.51 % BW rewrite match successes : 7
% 0.13/0.51 % Condensation attempts : 0
% 0.13/0.51 % Condensation successes : 0
% 0.13/0.51 % Termbank termtop insertions : 10688
% 0.13/0.51 % Search garbage collected termcells : 476
% 0.13/0.51
% 0.13/0.51 % -------------------------------------------------
% 0.13/0.51 % User time : 0.018 s
% 0.13/0.51 % System time : 0.005 s
% 0.13/0.51 % Total time : 0.022 s
% 0.13/0.51 % Maximum resident set size: 3748 pages
% 0.13/0.51
% 0.13/0.51 % -------------------------------------------------
% 0.13/0.51 % User time : 0.025 s
% 0.13/0.51 % System time : 0.011 s
% 0.13/0.51 % Total time : 0.036 s
% 0.13/0.51 % Maximum resident set size: 4608 pages
% 0.13/0.51 % E exiting
%------------------------------------------------------------------------------