%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET192-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 : n001.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:52 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 8 unt; 7 nHn; 19 RR)
% Number of literals : 54 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 3 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(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(prove_subclass_property9_1,negated_conjecture,
subclass(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property9_1) ).
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(prove_subclass_property9_2,negated_conjecture,
~ subclass(complement(y),complement(x)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property9_2) ).
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,X2)
| ~ member(X1,complement(X2)) ),
c_0_9 ).
cnf(c_0_13,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_14,negated_conjecture,
subclass(x,y),
prove_subclass_property9_1 ).
cnf(c_0_15,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_16,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(X1,x)
| member(X1,y) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_20,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_15 ).
cnf(c_0_21,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_16 ).
cnf(c_0_22,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_23,negated_conjecture,
~ subclass(complement(y),complement(x)),
inference(fof_simplification,[status(thm)],[prove_subclass_property9_2]) ).
cnf(c_0_24,negated_conjecture,
( ~ member(not_subclass_element(complement(y),X1),x)
| subclass(complement(y),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ subclass(complement(y),complement(x)),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET192-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.13/0.39 % Computer : n001.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 21 05:05:28 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.44 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.19/0.50 % Version: 3.5.1
% 0.19/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 % Starting sh5l with 300s (1) cores
% 0.19/0.50 % new_bool_3 with pid 2249337 completed with status 9
% 0.19/0.50 % new_bool_1 with pid 2249338 completed with status 9
% 0.19/0.50 % sh5l with pid 2249339 completed with status 0
% 0.19/0.50 % Result found by sh5l
% 0.19/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 % Starting sh5l with 300s (1) cores
% 0.19/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.19/0.50 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.19/0.50 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 % Starting SubtermCWHack with 28s (1) cores
% 0.19/0.50 % SubtermCWHack with pid 2249342 completed with status 0
% 0.19/0.50 % Result found by SubtermCWHack
% 0.19/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 % Starting sh5l with 300s (1) cores
% 0.19/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.19/0.50 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.19/0.50 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 % Starting SubtermCWHack with 28s (1) cores
% 0.19/0.50 % Preprocessing time : 0.002 s
% 0.19/0.50
% 0.19/0.50 % Proof found!
% 0.19/0.50 % SZS status Unsatisfiable
% 0.19/0.50 % SZS output start CNFRefutation
% See solution above
% 0.19/0.50 % Parsed axioms : 114
% 0.19/0.50 % Removed by relevancy pruning/SinE : 14
% 0.19/0.50 % Initial clauses : 100
% 0.19/0.50 % Removed in clause preprocessing : 0
% 0.19/0.50 % Initial clauses in saturation : 100
% 0.19/0.50 % Processed clauses : 561
% 0.19/0.50 % ...of these trivial : 2
% 0.19/0.50 % ...subsumed : 207
% 0.19/0.50 % ...remaining for further processing : 352
% 0.19/0.50 % Other redundant clauses eliminated : 3
% 0.19/0.50 % Clauses deleted for lack of memory : 0
% 0.19/0.50 % Backward-subsumed : 14
% 0.19/0.50 % Backward-rewritten : 7
% 0.19/0.50 % Generated clauses : 2011
% 0.19/0.50 % ...of the previous two non-redundant : 1706
% 0.19/0.50 % ...aggressively subsumed : 0
% 0.19/0.50 % Contextual simplify-reflections : 2
% 0.19/0.50 % Paramodulations : 2008
% 0.19/0.50 % Factorizations : 0
% 0.19/0.50 % NegExts : 0
% 0.19/0.50 % Equation resolutions : 3
% 0.19/0.50 % Disequality decompositions : 0
% 0.19/0.50 % Total rewrite steps : 417
% 0.19/0.50 % ...of those cached : 325
% 0.19/0.50 % Propositional unsat checks : 0
% 0.19/0.50 % Propositional check models : 0
% 0.19/0.50 % Propositional check unsatisfiable : 0
% 0.19/0.50 % Propositional clauses : 0
% 0.19/0.50 % Propositional clauses after purity: 0
% 0.19/0.50 % Propositional unsat core size : 0
% 0.19/0.50 % Propositional preprocessing time : 0.000
% 0.19/0.50 % Propositional encoding time : 0.000
% 0.19/0.50 % Propositional solver time : 0.000
% 0.19/0.50 % Success case prop preproc time : 0.000
% 0.19/0.50 % Success case prop encoding time : 0.000
% 0.19/0.50 % Success case prop solver time : 0.000
% 0.19/0.50 % Current number of processed clauses : 328
% 0.19/0.50 % Positive orientable unit clauses : 77
% 0.19/0.50 % Positive unorientable unit clauses: 7
% 0.19/0.50 % Negative unit clauses : 10
% 0.19/0.50 % Non-unit-clauses : 234
% 0.19/0.50 % Current number of unprocessed clauses: 1183
% 0.19/0.50 % ...number of literals in the above : 3059
% 0.19/0.50 % Current number of archived formulas : 0
% 0.19/0.50 % Current number of archived clauses : 21
% 0.19/0.50 % Clause-clause subsumption calls (NU) : 9454
% 0.19/0.50 % Rec. Clause-clause subsumption calls : 8053
% 0.19/0.50 % Non-unit clause-clause subsumptions : 147
% 0.19/0.50 % Unit Clause-clause subsumption calls : 670
% 0.19/0.50 % Rewrite failures with RHS unbound : 48
% 0.19/0.50 % BW rewrite match attempts : 32
% 0.19/0.50 % BW rewrite match successes : 13
% 0.19/0.50 % Condensation attempts : 0
% 0.19/0.50 % Condensation successes : 0
% 0.19/0.50 % Termbank termtop insertions : 26166
% 0.19/0.50 % Search garbage collected termcells : 229
% 0.19/0.50
% 0.19/0.50 % -------------------------------------------------
% 0.19/0.50 % User time : 0.045 s
% 0.19/0.50 % System time : 0.005 s
% 0.19/0.50 % Total time : 0.051 s
% 0.19/0.50 % Maximum resident set size: 3692 pages
% 0.19/0.50
% 0.19/0.50 % -------------------------------------------------
% 0.19/0.50 % User time : 0.101 s
% 0.19/0.50 % System time : 0.044 s
% 0.19/0.50 % Total time : 0.145 s
% 0.19/0.50 % Maximum resident set size: 4864 pages
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------