%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET287-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:14:01 PM UTC 2026
% Result : Unsatisfiable 1.03s 0.66s
% Output : CNFRefutation 1.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 54 ( 22 unt; 5 nHn; 39 RR)
% Number of literals : 92 ( 29 equ; 47 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 : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 90 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(prove_domain_property8_1,negated_conjecture,
subclass(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_property8_1) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(domain1,axiom,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',domain1) ).
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction2) ).
cnf(prove_domain_property8_2,negated_conjecture,
domain_of(intersection(complement(y),x)) != null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_property8_2) ).
cnf(c_0_13,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_14,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_15,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_16,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_13 ).
cnf(c_0_17,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_18,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_14 ).
cnf(c_0_19,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_20,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_15 ).
cnf(c_0_21,plain,
( member(regular(intersection(X1,X2)),X2)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
subclass(x,y),
prove_domain_property8_1 ).
cnf(c_0_23,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_24,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( ~ member(regular(intersection(X1,complement(X2))),X2)
| intersection(X1,complement(X2)) = null_class ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( ~ member(X1,x)
| member(X1,y) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_27,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_23 ).
cnf(c_0_28,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_29,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_30,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
inference(fof_simplification,[status(thm)],[domain1]) ).
cnf(c_0_31,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_32,negated_conjecture,
( ~ member(regular(intersection(X1,complement(y))),x)
| intersection(X1,complement(y)) = null_class ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( member(regular(intersection(X1,X2)),X1)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_34,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
c_0_30 ).
cnf(c_0_36,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_37,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_38,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_39,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_31 ).
cnf(c_0_40,negated_conjecture,
intersection(x,complement(y)) = null_class,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_34]),c_0_24]) ).
cnf(c_0_42,plain,
( ~ member(X2,domain_of(X1))
| intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != null_class ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_43,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( ~ member(X1,x)
| ~ member(X1,complement(y)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_45,plain,
( ~ member(X1,domain_of(X2))
| intersection(cross_product(unordered_pair(X1,X1),universal_class),X2) != null_class ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
intersection(X1,null_class) = null_class,
inference(spm,[status(thm)],[c_0_41,c_0_21]) ).
cnf(c_0_47,negated_conjecture,
domain_of(intersection(complement(y),x)) != null_class,
inference(fof_simplification,[status(thm)],[prove_domain_property8_2]) ).
cnf(c_0_48,negated_conjecture,
( ~ member(regular(intersection(complement(y),X1)),x)
| intersection(complement(y),X1) = null_class ),
inference(spm,[status(thm)],[c_0_44,c_0_33]) ).
cnf(c_0_49,plain,
~ member(X1,domain_of(null_class)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
domain_of(intersection(complement(y),x)) != null_class,
c_0_47 ).
cnf(c_0_51,negated_conjecture,
intersection(complement(y),x) = null_class,
inference(spm,[status(thm)],[c_0_48,c_0_21]) ).
cnf(c_0_52,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_49,c_0_17]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET287-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n020.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 05:06:17 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.51 Running first-order theorem proving
% 0.25/0.51 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 1.03/0.66 % Version: 3.5.1
% 1.03/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.03/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.03/0.66 % Starting new_bool_3 with 300s (1) cores
% 1.03/0.66 % Starting new_bool_1 with 300s (1) cores
% 1.03/0.66 % Starting sh5l with 300s (1) cores
% 1.03/0.66 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2066515 completed with status 0
% 1.03/0.66 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.03/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.03/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.03/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.03/0.66 % No SInE strategy applied
% 1.03/0.66 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.03/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.03/0.66 % Starting SubtermCWHack with 136s (1) cores
% 1.03/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.03/0.66 % Starting new_bool_3 with 311s (1) cores
% 1.03/0.66 % Starting new_bool_1 with 308s (1) cores
% 1.03/0.66 % Starting sh5l with 304s (1) cores
% 1.03/0.66 % sh5l with pid 2066526 completed with status 0
% 1.03/0.66 % Result found by sh5l
% 1.03/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.03/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.03/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.03/0.66 % No SInE strategy applied
% 1.03/0.66 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.03/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.03/0.66 % Starting SubtermCWHack with 136s (1) cores
% 1.03/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.03/0.66 % Starting new_bool_3 with 311s (1) cores
% 1.03/0.66 % Starting new_bool_1 with 308s (1) cores
% 1.03/0.66 % Starting sh5l with 304s (1) cores
% 1.03/0.66 % Preprocessing time : 0.005 s
% 1.03/0.66 % Presaturation interreduction done
% 1.03/0.66
% 1.03/0.66 % Proof found!
% 1.03/0.66 % SZS status Unsatisfiable
% 1.03/0.66 % SZS output start CNFRefutation
% See solution above
% 1.03/0.66 % Parsed axioms : 114
% 1.03/0.66 % Removed by relevancy pruning/SinE : 0
% 1.03/0.66 % Initial clauses : 114
% 1.03/0.66 % Removed in clause preprocessing : 17
% 1.03/0.66 % Initial clauses in saturation : 97
% 1.03/0.66 % Processed clauses : 744
% 1.03/0.66 % ...of these trivial : 2
% 1.03/0.66 % ...subsumed : 328
% 1.03/0.66 % ...remaining for further processing : 414
% 1.03/0.66 % Other redundant clauses eliminated : 8
% 1.03/0.66 % Clauses deleted for lack of memory : 0
% 1.03/0.66 % Backward-subsumed : 13
% 1.03/0.66 % Backward-rewritten : 14
% 1.03/0.66 % Generated clauses : 1567
% 1.03/0.66 % ...of the previous two non-redundant : 1295
% 1.03/0.66 % ...aggressively subsumed : 0
% 1.03/0.66 % Contextual simplify-reflections : 10
% 1.03/0.66 % Paramodulations : 1555
% 1.03/0.66 % Factorizations : 4
% 1.03/0.66 % NegExts : 0
% 1.03/0.66 % Equation resolutions : 8
% 1.03/0.66 % Disequality decompositions : 0
% 1.03/0.66 % Total rewrite steps : 787
% 1.03/0.66 % ...of those cached : 729
% 1.03/0.66 % Propositional unsat checks : 0
% 1.03/0.66 % Propositional check models : 0
% 1.03/0.66 % Propositional check unsatisfiable : 0
% 1.03/0.66 % Propositional clauses : 0
% 1.03/0.66 % Propositional clauses after purity: 0
% 1.03/0.66 % Propositional unsat core size : 0
% 1.03/0.66 % Propositional preprocessing time : 0.000
% 1.03/0.66 % Propositional encoding time : 0.000
% 1.03/0.66 % Propositional solver time : 0.000
% 1.03/0.66 % Success case prop preproc time : 0.000
% 1.03/0.66 % Success case prop encoding time : 0.000
% 1.03/0.66 % Success case prop solver time : 0.000
% 1.03/0.66 % Current number of processed clauses : 287
% 1.03/0.66 % Positive orientable unit clauses : 40
% 1.03/0.66 % Positive unorientable unit clauses: 1
% 1.03/0.66 % Negative unit clauses : 2
% 1.03/0.66 % Non-unit-clauses : 244
% 1.03/0.66 % Current number of unprocessed clauses: 725
% 1.03/0.66 % ...number of literals in the above : 2196
% 1.03/0.66 % Current number of archived formulas : 0
% 1.03/0.66 % Current number of archived clauses : 140
% 1.03/0.66 % Clause-clause subsumption calls (NU) : 10653
% 1.03/0.66 % Rec. Clause-clause subsumption calls : 6626
% 1.03/0.66 % Non-unit clause-clause subsumptions : 287
% 1.03/0.66 % Unit Clause-clause subsumption calls : 245
% 1.03/0.66 % Rewrite failures with RHS unbound : 0
% 1.03/0.66 % BW rewrite match attempts : 23
% 1.03/0.66 % BW rewrite match successes : 13
% 1.03/0.66 % Condensation attempts : 744
% 1.03/0.66 % Condensation successes : 15
% 1.03/0.66 % Termbank termtop insertions : 46743
% 1.03/0.66 % Search garbage collected termcells : 185
% 1.03/0.66
% 1.03/0.66 % -------------------------------------------------
% 1.03/0.66 % User time : 0.111 s
% 1.03/0.66 % System time : 0.006 s
% 1.03/0.66 % Total time : 0.117 s
% 1.03/0.66 % Maximum resident set size: 4000 pages
% 1.03/0.66
% 1.03/0.66 % -------------------------------------------------
% 1.03/0.66 % User time : 0.532 s
% 1.03/0.66 % System time : 0.034 s
% 1.03/0.66 % Total time : 0.566 s
% 1.03/0.66 % Maximum resident set size: 4608 pages
% 1.03/0.66 % E exiting
%------------------------------------------------------------------------------