%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET191-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 : n026.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:49 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.59s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 15 unt; 9 nHn; 30 RR)
% Number of literals : 79 ( 11 equ; 37 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 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(prove_subclass_property8_1,negated_conjecture,
union(complement(x),y) = universal_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property8_1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
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_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(prove_subclass_property8_2,negated_conjecture,
~ subclass(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property8_2) ).
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(c_0_11,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_12,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_13,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_11 ).
cnf(c_0_14,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_15,negated_conjecture,
union(complement(x),y) = universal_class,
prove_subclass_property8_1 ).
cnf(c_0_16,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_12 ).
cnf(c_0_18,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_19,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
complement(intersection(complement(complement(x)),complement(y))) = universal_class,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_23,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_24,negated_conjecture,
~ member(X1,intersection(complement(complement(x)),complement(y))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_19]) ).
cnf(c_0_25,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
intersection(complement(complement(x)),complement(y)) = null_class,
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_28,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_25]),c_0_19]) ).
cnf(c_0_29,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(X1,complement(y))
| ~ member(X1,complement(complement(x))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_31,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_29 ).
cnf(c_0_32,negated_conjecture,
( ~ member(X1,complement(y))
| member(X1,complement(x)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19]) ).
cnf(c_0_33,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(X1,universal_class)
| member(X1,y)
| member(X1,complement(x)) ),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_35,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_33 ).
cnf(c_0_36,negated_conjecture,
( ~ member(X1,x)
| member(X1,y) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_34]),c_0_19]) ).
cnf(c_0_37,negated_conjecture,
~ subclass(x,y),
inference(fof_simplification,[status(thm)],[prove_subclass_property8_2]) ).
cnf(c_0_38,negated_conjecture,
( ~ member(not_subclass_element(X1,y),x)
| subclass(X1,y) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_40,negated_conjecture,
~ subclass(x,y),
c_0_37 ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET191-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.38 % Computer : n026.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 05:02:51 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 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.23/0.59 % Version: 3.5.1
% 0.23/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.59 % Starting sh5l with 300s (1) cores
% 0.23/0.59 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1425646 completed with status 0
% 0.23/0.59 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.23/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.59 % No SInE strategy applied
% 0.23/0.59 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.23/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.59 % Starting new_bool_3 with 311s (1) cores
% 0.23/0.59 % Starting new_bool_1 with 308s (1) cores
% 0.23/0.59 % Starting sh5l with 304s (1) cores
% 0.23/0.59 % SubtermCWHack with pid 1425653 completed with status 0
% 0.23/0.59 % Result found by SubtermCWHack
% 0.23/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.59 % No SInE strategy applied
% 0.23/0.59 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.23/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.59 % Preprocessing time : 0.004 s
% 0.23/0.59
% 0.23/0.59 % Proof found!
% 0.23/0.59 % SZS status Unsatisfiable
% 0.23/0.59 % SZS output start CNFRefutation
% See solution above
% 0.23/0.59 % Parsed axioms : 114
% 0.23/0.59 % Removed by relevancy pruning/SinE : 0
% 0.23/0.59 % Initial clauses : 114
% 0.23/0.59 % Removed in clause preprocessing : 17
% 0.23/0.59 % Initial clauses in saturation : 97
% 0.23/0.59 % Processed clauses : 200
% 0.23/0.59 % ...of these trivial : 0
% 0.23/0.59 % ...subsumed : 52
% 0.23/0.59 % ...remaining for further processing : 148
% 0.23/0.59 % Other redundant clauses eliminated : 2
% 0.23/0.59 % Clauses deleted for lack of memory : 0
% 0.23/0.59 % Backward-subsumed : 1
% 0.23/0.59 % Backward-rewritten : 6
% 0.23/0.59 % Generated clauses : 345
% 0.23/0.59 % ...of the previous two non-redundant : 313
% 0.23/0.59 % ...aggressively subsumed : 0
% 0.23/0.59 % Contextual simplify-reflections : 4
% 0.23/0.59 % Paramodulations : 343
% 0.23/0.59 % Factorizations : 0
% 0.23/0.59 % NegExts : 0
% 0.23/0.59 % Equation resolutions : 2
% 0.23/0.59 % Disequality decompositions : 0
% 0.23/0.59 % Total rewrite steps : 33
% 0.23/0.59 % ...of those cached : 17
% 0.23/0.59 % Propositional unsat checks : 0
% 0.23/0.59 % Propositional check models : 0
% 0.23/0.59 % Propositional check unsatisfiable : 0
% 0.23/0.59 % Propositional clauses : 0
% 0.23/0.59 % Propositional clauses after purity: 0
% 0.23/0.59 % Propositional unsat core size : 0
% 0.23/0.59 % Propositional preprocessing time : 0.000
% 0.23/0.59 % Propositional encoding time : 0.000
% 0.23/0.59 % Propositional solver time : 0.000
% 0.23/0.59 % Success case prop preproc time : 0.000
% 0.23/0.59 % Success case prop encoding time : 0.000
% 0.23/0.59 % Success case prop solver time : 0.000
% 0.23/0.59 % Current number of processed clauses : 139
% 0.23/0.59 % Positive orientable unit clauses : 28
% 0.23/0.59 % Positive unorientable unit clauses: 1
% 0.23/0.59 % Negative unit clauses : 2
% 0.23/0.59 % Non-unit-clauses : 108
% 0.23/0.59 % Current number of unprocessed clauses: 204
% 0.23/0.59 % ...number of literals in the above : 517
% 0.23/0.59 % Current number of archived formulas : 0
% 0.23/0.59 % Current number of archived clauses : 24
% 0.23/0.59 % Clause-clause subsumption calls (NU) : 1524
% 0.23/0.59 % Rec. Clause-clause subsumption calls : 976
% 0.23/0.59 % Non-unit clause-clause subsumptions : 41
% 0.23/0.59 % Unit Clause-clause subsumption calls : 78
% 0.23/0.59 % Rewrite failures with RHS unbound : 0
% 0.23/0.59 % BW rewrite match attempts : 8
% 0.23/0.59 % BW rewrite match successes : 5
% 0.23/0.59 % Condensation attempts : 0
% 0.23/0.59 % Condensation successes : 0
% 0.23/0.59 % Termbank termtop insertions : 9396
% 0.23/0.59 % Search garbage collected termcells : 185
% 0.23/0.59
% 0.23/0.59 % -------------------------------------------------
% 0.23/0.59 % User time : 0.033 s
% 0.23/0.59 % System time : 0.005 s
% 0.23/0.59 % Total time : 0.038 s
% 0.23/0.59 % Maximum resident set size: 3996 pages
% 0.23/0.59
% 0.23/0.59 % -------------------------------------------------
% 0.23/0.59 % User time : 0.172 s
% 0.23/0.59 % System time : 0.035 s
% 0.23/0.59 % Total time : 0.207 s
% 0.23/0.59 % Maximum resident set size: 4864 pages
% 0.23/0.59 % E exiting
%------------------------------------------------------------------------------