%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET187-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:16:48 PM UTC 2026
% Result : Unsatisfiable 1.03s 0.65s
% Output : CNFRefutation 1.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 38 ( 11 unt; 5 nHn; 31 RR)
% Number of literals : 71 ( 14 equ; 36 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 61 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
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(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_property5_1,negated_conjecture,
subclass(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property5_1) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
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(prove_subclass_property5_2,negated_conjecture,
intersection(complement(y),x) != null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property5_2) ).
cnf(c_0_9,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_10,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_11,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_12,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_9 ).
cnf(c_0_13,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_14,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_10 ).
cnf(c_0_15,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_16,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_11 ).
cnf(c_0_17,plain,
( member(regular(intersection(X1,X2)),X2)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
subclass(x,y),
prove_subclass_property5_1 ).
cnf(c_0_19,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_20,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( ~ member(regular(intersection(X1,complement(X2))),X2)
| intersection(X1,complement(X2)) = null_class ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( ~ member(X1,x)
| member(X1,y) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_23,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_19 ).
cnf(c_0_24,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_25,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_26,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(regular(intersection(X1,complement(y))),x)
| intersection(X1,complement(y)) = null_class ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( member(regular(intersection(X1,X2)),X1)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_29,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_26 ).
cnf(c_0_31,negated_conjecture,
intersection(x,complement(y)) = null_class,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_29]),c_0_20]) ).
cnf(c_0_33,negated_conjecture,
( ~ member(X1,x)
| ~ member(X1,complement(y)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_34,negated_conjecture,
intersection(complement(y),x) != null_class,
inference(fof_simplification,[status(thm)],[prove_subclass_property5_2]) ).
cnf(c_0_35,negated_conjecture,
( ~ member(regular(intersection(complement(y),X1)),x)
| intersection(complement(y),X1) = null_class ),
inference(spm,[status(thm)],[c_0_33,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
intersection(complement(y),x) != null_class,
c_0_34 ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_17]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET187-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n001.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 05:04:59 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.52 Running first-order theorem proving
% 0.25/0.52 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
% 1.03/0.65 % Version: 3.5.1
% 1.03/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.03/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.03/0.65 % Starting new_bool_3 with 300s (1) cores
% 1.03/0.65 % Starting new_bool_1 with 300s (1) cores
% 1.03/0.65 % Starting sh5l with 300s (1) cores
% 1.03/0.65 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2248011 completed with status 0
% 1.03/0.65 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.03/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.03/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.03/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.03/0.65 % No SInE strategy applied
% 1.03/0.65 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.03/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.03/0.65 % Starting SubtermCWHack with 136s (1) cores
% 1.03/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.03/0.65 % Starting new_bool_3 with 311s (1) cores
% 1.03/0.65 % Starting new_bool_1 with 308s (1) cores
% 1.03/0.65 % Starting sh5l with 304s (1) cores
% 1.03/0.65 % sh5l with pid 2248022 completed with status 0
% 1.03/0.65 % Result found by sh5l
% 1.03/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.03/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.03/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.03/0.65 % No SInE strategy applied
% 1.03/0.65 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.03/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.03/0.65 % Starting SubtermCWHack with 136s (1) cores
% 1.03/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.03/0.65 % Starting new_bool_3 with 311s (1) cores
% 1.03/0.65 % Starting new_bool_1 with 308s (1) cores
% 1.03/0.65 % Starting sh5l with 304s (1) cores
% 1.03/0.65 % Preprocessing time : 0.005 s
% 1.03/0.65 % Presaturation interreduction done
% 1.03/0.65
% 1.03/0.65 % Proof found!
% 1.03/0.65 % SZS status Unsatisfiable
% 1.03/0.65 % SZS output start CNFRefutation
% See solution above
% 1.03/0.65 % Parsed axioms : 114
% 1.03/0.65 % Removed by relevancy pruning/SinE : 0
% 1.03/0.65 % Initial clauses : 114
% 1.03/0.65 % Removed in clause preprocessing : 17
% 1.03/0.65 % Initial clauses in saturation : 97
% 1.03/0.65 % Processed clauses : 630
% 1.03/0.65 % ...of these trivial : 1
% 1.03/0.65 % ...subsumed : 257
% 1.03/0.65 % ...remaining for further processing : 372
% 1.03/0.65 % Other redundant clauses eliminated : 4
% 1.03/0.65 % Clauses deleted for lack of memory : 0
% 1.03/0.65 % Backward-subsumed : 7
% 1.03/0.65 % Backward-rewritten : 12
% 1.03/0.65 % Generated clauses : 1178
% 1.03/0.65 % ...of the previous two non-redundant : 988
% 1.03/0.65 % ...aggressively subsumed : 0
% 1.03/0.65 % Contextual simplify-reflections : 9
% 1.03/0.65 % Paramodulations : 1174
% 1.03/0.65 % Factorizations : 0
% 1.03/0.65 % NegExts : 0
% 1.03/0.65 % Equation resolutions : 4
% 1.03/0.65 % Disequality decompositions : 0
% 1.03/0.65 % Total rewrite steps : 608
% 1.03/0.65 % ...of those cached : 562
% 1.03/0.65 % Propositional unsat checks : 0
% 1.03/0.65 % Propositional check models : 0
% 1.03/0.65 % Propositional check unsatisfiable : 0
% 1.03/0.65 % Propositional clauses : 0
% 1.03/0.65 % Propositional clauses after purity: 0
% 1.03/0.65 % Propositional unsat core size : 0
% 1.03/0.65 % Propositional preprocessing time : 0.000
% 1.03/0.65 % Propositional encoding time : 0.000
% 1.03/0.65 % Propositional solver time : 0.000
% 1.03/0.65 % Success case prop preproc time : 0.000
% 1.03/0.65 % Success case prop encoding time : 0.000
% 1.03/0.65 % Success case prop solver time : 0.000
% 1.03/0.65 % Current number of processed clauses : 253
% 1.03/0.65 % Positive orientable unit clauses : 36
% 1.03/0.65 % Positive unorientable unit clauses: 1
% 1.03/0.65 % Negative unit clauses : 2
% 1.03/0.65 % Non-unit-clauses : 214
% 1.03/0.65 % Current number of unprocessed clauses: 532
% 1.03/0.65 % ...number of literals in the above : 1649
% 1.03/0.65 % Current number of archived formulas : 0
% 1.03/0.65 % Current number of archived clauses : 132
% 1.03/0.65 % Clause-clause subsumption calls (NU) : 8993
% 1.03/0.65 % Rec. Clause-clause subsumption calls : 5520
% 1.03/0.65 % Non-unit clause-clause subsumptions : 219
% 1.03/0.65 % Unit Clause-clause subsumption calls : 171
% 1.03/0.65 % Rewrite failures with RHS unbound : 0
% 1.03/0.65 % BW rewrite match attempts : 22
% 1.03/0.65 % BW rewrite match successes : 11
% 1.03/0.65 % Condensation attempts : 630
% 1.03/0.65 % Condensation successes : 9
% 1.03/0.65 % Termbank termtop insertions : 40305
% 1.03/0.65 % Search garbage collected termcells : 185
% 1.03/0.65
% 1.03/0.65 % -------------------------------------------------
% 1.03/0.65 % User time : 0.095 s
% 1.03/0.65 % System time : 0.006 s
% 1.03/0.65 % Total time : 0.101 s
% 1.03/0.65 % Maximum resident set size: 4000 pages
% 1.03/0.65
% 1.03/0.65 % -------------------------------------------------
% 1.03/0.65 % User time : 0.448 s
% 1.03/0.65 % System time : 0.040 s
% 1.03/0.65 % Total time : 0.488 s
% 1.03/0.65 % Maximum resident set size: 4608 pages
% 1.03/0.65 % E exiting
%------------------------------------------------------------------------------