%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET079-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 : 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:13:28 PM UTC 2026
% Result : Unsatisfiable 0.14s 5.63s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 12 unt; 3 nHn; 17 RR)
% Number of literals : 45 ( 9 equ; 19 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 7 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(unordered_pair3,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(prove_corollary_to_set_in_its_singleton_2,negated_conjecture,
singleton(x) = null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_set_in_its_singleton_2) ).
cnf(prove_corollary_to_set_in_its_singleton_1,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_set_in_its_singleton_1) ).
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,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
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,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_13,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_9 ).
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_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
c_0_12 ).
cnf(c_0_17,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_18,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_20,plain,
( ~ member(X1,universal_class)
| member(X1,singleton(X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
singleton(x) = null_class,
prove_corollary_to_set_in_its_singleton_2 ).
cnf(c_0_22,negated_conjecture,
member(x,universal_class),
prove_corollary_to_set_in_its_singleton_1 ).
cnf(c_0_23,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
member(x,null_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_23]),c_0_15]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET079-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.11/5.55 % Computer : n014.cluster.edu
% 0.11/5.55 % Model : x86_64 x86_64
% 0.11/5.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.55 % Memory : 8046.5625MB
% 0.11/5.55 % OS : Linux 6.8.0-71-generic
% 0.11/5.55 % CPULimit : 300
% 0.11/5.55 % WCLimit : 300
% 0.11/5.55 % DateTime : Mon Sep 21 04:50:42 UTC 2026
% 0.11/5.55 % CPUTime :
% 0.11/5.55 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.60 Running first-order theorem proving
% 0.14/5.60 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/5.63 % Version: 3.5.1
% 0.14/5.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/5.63 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.63 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.63 % Starting sh5l with 300s (1) cores
% 0.14/5.63 % sh5l with pid 3174686 completed with status 0
% 0.14/5.63 % Result found by sh5l
% 0.14/5.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/5.63 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.63 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.63 % Starting sh5l with 300s (1) cores
% 0.14/5.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/5.63 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/5.63 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.14/5.63 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.63 % Starting SubtermCWHack with 28s (1) cores
% 0.14/5.63 % SubtermCWHack with pid 3174689 completed with status 0
% 0.14/5.63 % Result found by SubtermCWHack
% 0.14/5.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/5.63 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.63 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.63 % Starting sh5l with 300s (1) cores
% 0.14/5.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/5.63 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/5.63 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.14/5.63 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.63 % Starting SubtermCWHack with 28s (1) cores
% 0.14/5.63 % Preprocessing time : 0.002 s
% 0.14/5.63
% 0.14/5.63 % Proof found!
% 0.14/5.63 % SZS status Unsatisfiable
% 0.14/5.63 % SZS output start CNFRefutation
% See solution above
% 0.14/5.63 % Parsed axioms : 93
% 0.14/5.63 % Removed by relevancy pruning/SinE : 9
% 0.14/5.63 % Initial clauses : 84
% 0.14/5.63 % Removed in clause preprocessing : 0
% 0.14/5.63 % Initial clauses in saturation : 84
% 0.14/5.63 % Processed clauses : 84
% 0.14/5.63 % ...of these trivial : 0
% 0.14/5.63 % ...subsumed : 8
% 0.14/5.63 % ...remaining for further processing : 76
% 0.14/5.63 % Other redundant clauses eliminated : 2
% 0.14/5.63 % Clauses deleted for lack of memory : 0
% 0.14/5.63 % Backward-subsumed : 0
% 0.14/5.63 % Backward-rewritten : 1
% 0.14/5.63 % Generated clauses : 97
% 0.14/5.63 % ...of the previous two non-redundant : 78
% 0.14/5.63 % ...aggressively subsumed : 0
% 0.14/5.63 % Contextual simplify-reflections : 1
% 0.14/5.63 % Paramodulations : 94
% 0.14/5.63 % Factorizations : 0
% 0.14/5.63 % NegExts : 0
% 0.14/5.63 % Equation resolutions : 2
% 0.14/5.63 % Disequality decompositions : 0
% 0.14/5.63 % Total rewrite steps : 12
% 0.14/5.63 % ...of those cached : 3
% 0.14/5.63 % Propositional unsat checks : 0
% 0.14/5.63 % Propositional check models : 0
% 0.14/5.63 % Propositional check unsatisfiable : 0
% 0.14/5.63 % Propositional clauses : 0
% 0.14/5.63 % Propositional clauses after purity: 0
% 0.14/5.63 % Propositional unsat core size : 0
% 0.14/5.63 % Propositional preprocessing time : 0.000
% 0.14/5.63 % Propositional encoding time : 0.000
% 0.14/5.63 % Propositional solver time : 0.000
% 0.14/5.63 % Success case prop preproc time : 0.000
% 0.14/5.63 % Success case prop encoding time : 0.000
% 0.14/5.63 % Success case prop solver time : 0.000
% 0.14/5.63 % Current number of processed clauses : 72
% 0.14/5.63 % Positive orientable unit clauses : 28
% 0.14/5.63 % Positive unorientable unit clauses: 0
% 0.14/5.63 % Negative unit clauses : 1
% 0.14/5.63 % Non-unit-clauses : 43
% 0.14/5.63 % Current number of unprocessed clauses: 78
% 0.14/5.63 % ...number of literals in the above : 188
% 0.14/5.63 % Current number of archived formulas : 0
% 0.14/5.63 % Current number of archived clauses : 2
% 0.14/5.63 % Clause-clause subsumption calls (NU) : 409
% 0.14/5.63 % Rec. Clause-clause subsumption calls : 365
% 0.14/5.63 % Non-unit clause-clause subsumptions : 9
% 0.14/5.63 % Unit Clause-clause subsumption calls : 73
% 0.14/5.63 % Rewrite failures with RHS unbound : 0
% 0.14/5.63 % BW rewrite match attempts : 6
% 0.14/5.63 % BW rewrite match successes : 1
% 0.14/5.63 % Condensation attempts : 0
% 0.14/5.63 % Condensation successes : 0
% 0.14/5.63 % Termbank termtop insertions : 3347
% 0.14/5.63 % Search garbage collected termcells : 190
% 0.14/5.63
% 0.14/5.63 % -------------------------------------------------
% 0.14/5.63 % User time : 0.008 s
% 0.14/5.63 % System time : 0.003 s
% 0.14/5.63 % Total time : 0.011 s
% 0.14/5.63 % Maximum resident set size: 3720 pages
% 0.14/5.63
% 0.14/5.63 % -------------------------------------------------
% 0.14/5.63 % User time : 0.011 s
% 0.14/5.63 % System time : 0.008 s
% 0.14/5.63 % Total time : 0.019 s
% 0.14/5.63 % Maximum resident set size: 4608 pages
% 0.14/5.63 % E exiting
%------------------------------------------------------------------------------