%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET510-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 : n006.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:17:15 PM UTC 2026
% Result : Unsatisfiable 0.24s 15.71s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 53 ( 19 unt; 14 nHn; 32 RR)
% Number of literals : 98 ( 46 equ; 42 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-3 aty)
% Number of variables : 92 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
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(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
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(unordered_pair_member,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
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(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(prove_corollary_to_singleton_is_null_class_1,negated_conjecture,
singleton(universal_class) != null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_to_singleton_is_null_class_1) ).
cnf(regularity2,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity2) ).
cnf(c_0_13,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_14,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_13 ).
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)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_19,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_16 ).
cnf(c_0_20,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( ~ member(regular(X1),complement(universal_class))
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_23,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
inference(fof_simplification,[status(thm)],[domain1]) ).
cnf(c_0_24,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_25,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_22 ).
cnf(c_0_26,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_27,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
c_0_23 ).
cnf(c_0_28,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_29,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_30,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_31,plain,
( ~ member(regular(X1),null_class)
| X1 = null_class ),
inference(rw,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_32,plain,
( member(regular(intersection(X1,X2)),X2)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_33,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_34,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_26 ).
cnf(c_0_35,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_27,c_0_28]),c_0_29]) ).
cnf(c_0_36,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_37,plain,
intersection(X1,null_class) = null_class,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_33 ).
cnf(c_0_39,plain,
( unordered_pair(X1,X2) = null_class
| regular(unordered_pair(X1,X2)) = X2
| regular(unordered_pair(X1,X2)) = X1 ),
inference(spm,[status(thm)],[c_0_34,c_0_18]) ).
cnf(c_0_40,negated_conjecture,
singleton(universal_class) != null_class,
inference(fof_simplification,[status(thm)],[prove_corollary_to_singleton_is_null_class_1]) ).
cnf(c_0_41,plain,
( intersection(X1,cross_product(unordered_pair(regular(domain_of(X1)),regular(domain_of(X1))),universal_class)) != null_class
| domain_of(X1) = null_class ),
inference(spm,[status(thm)],[c_0_35,c_0_18]) ).
cnf(c_0_42,plain,
intersection(null_class,cross_product(X1,X2)) = null_class,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
( ~ member(regular(X1),X2)
| member(regular(X1),intersection(X2,universal_class))
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_38,c_0_20]) ).
cnf(c_0_44,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
regularity2 ).
cnf(c_0_45,plain,
( unordered_pair(X1,X1) = null_class
| regular(unordered_pair(X1,X1)) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_39])]) ).
cnf(c_0_46,negated_conjecture,
singleton(universal_class) != null_class,
c_0_40 ).
cnf(c_0_47,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
( member(regular(X1),intersection(X1,universal_class))
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_43,c_0_18]) ).
cnf(c_0_49,plain,
( unordered_pair(X1,X1) = null_class
| intersection(unordered_pair(X1,X1),X1) = null_class ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
unordered_pair(universal_class,universal_class) != null_class,
inference(rw,[status(thm)],[c_0_46,c_0_28]) ).
cnf(c_0_51,plain,
~ member(X1,null_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_47]),c_0_42])]) ).
cnf(c_0_52,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET510-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/15.47 % Computer : n006.cluster.edu
% 0.18/15.47 % Model : x86_64 x86_64
% 0.18/15.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/15.47 % Memory : 8046.5625MB
% 0.18/15.47 % OS : Linux 6.8.0-71-generic
% 0.18/15.47 % CPULimit : 300
% 0.18/15.47 % WCLimit : 300
% 0.18/15.47 % DateTime : Mon Sep 21 05:22:27 UTC 2026
% 0.18/15.47 % CPUTime :
% 0.18/15.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/15.54 Running first-order theorem proving
% 0.24/15.54 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
% 0.24/15.71 % Version: 3.5.1
% 0.24/15.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/15.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/15.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/15.71 % Starting new_bool_3 with 300s (1) cores
% 0.24/15.71 % Starting new_bool_1 with 300s (1) cores
% 0.24/15.71 % Starting sh5l with 300s (1) cores
% 0.24/15.71 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2078228 completed with status 0
% 0.24/15.71 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/15.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/15.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/15.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/15.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/15.71 % No SInE strategy applied
% 0.24/15.71 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.24/15.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/15.71 % Starting SubtermCWHack with 136s (1) cores
% 0.24/15.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/15.71 % Starting new_bool_3 with 311s (1) cores
% 0.24/15.71 % Starting new_bool_1 with 308s (1) cores
% 0.24/15.71 % Starting sh5l with 304s (1) cores
% 0.24/15.71 % new_bool_3 with pid 2078237 completed with status 0
% 0.24/15.71 % Result found by new_bool_3
% 0.24/15.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/15.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/15.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/15.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/15.71 % No SInE strategy applied
% 0.24/15.71 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.24/15.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/15.71 % Starting SubtermCWHack with 136s (1) cores
% 0.24/15.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/15.71 % Starting new_bool_3 with 311s (1) cores
% 0.24/15.71 % Preprocessing time : 0.003 s
% 0.24/15.71 % Presaturation interreduction done
% 0.24/15.71
% 0.24/15.71 % Proof found!
% 0.24/15.71 % SZS status Unsatisfiable
% 0.24/15.71 % SZS output start CNFRefutation
% See solution above
% 0.24/15.71 % Parsed axioms : 113
% 0.24/15.71 % Removed by relevancy pruning/SinE : 0
% 0.24/15.71 % Initial clauses : 113
% 0.24/15.71 % Removed in clause preprocessing : 17
% 0.24/15.71 % Initial clauses in saturation : 96
% 0.24/15.71 % Processed clauses : 1074
% 0.24/15.71 % ...of these trivial : 19
% 0.24/15.71 % ...subsumed : 300
% 0.24/15.71 % ...remaining for further processing : 755
% 0.24/15.71 % Other redundant clauses eliminated : 8
% 0.24/15.71 % Clauses deleted for lack of memory : 0
% 0.24/15.71 % Backward-subsumed : 22
% 0.24/15.71 % Backward-rewritten : 25
% 0.24/15.71 % Generated clauses : 4748
% 0.24/15.71 % ...of the previous two non-redundant : 3874
% 0.24/15.71 % ...aggressively subsumed : 0
% 0.24/15.71 % Contextual simplify-reflections : 1
% 0.24/15.71 % Paramodulations : 4736
% 0.24/15.71 % Factorizations : 4
% 0.24/15.71 % NegExts : 0
% 0.24/15.71 % Equation resolutions : 8
% 0.24/15.71 % Disequality decompositions : 0
% 0.24/15.71 % Total rewrite steps : 1190
% 0.24/15.71 % ...of those cached : 973
% 0.24/15.71 % Propositional unsat checks : 0
% 0.24/15.71 % Propositional check models : 0
% 0.24/15.71 % Propositional check unsatisfiable : 0
% 0.24/15.71 % Propositional clauses : 0
% 0.24/15.71 % Propositional clauses after purity: 0
% 0.24/15.71 % Propositional unsat core size : 0
% 0.24/15.71 % Propositional preprocessing time : 0.000
% 0.24/15.71 % Propositional encoding time : 0.000
% 0.24/15.71 % Propositional solver time : 0.000
% 0.24/15.71 % Success case prop preproc time : 0.000
% 0.24/15.71 % Success case prop encoding time : 0.000
% 0.24/15.71 % Success case prop solver time : 0.000
% 0.24/15.71 % Current number of processed clauses : 609
% 0.24/15.71 % Positive orientable unit clauses : 141
% 0.24/15.71 % Positive unorientable unit clauses: 1
% 0.24/15.71 % Negative unit clauses : 97
% 0.24/15.71 % Non-unit-clauses : 370
% 0.24/15.71 % Current number of unprocessed clauses: 2959
% 0.24/15.71 % ...number of literals in the above : 5250
% 0.24/15.71 % Current number of archived formulas : 0
% 0.24/15.71 % Current number of archived clauses : 159
% 0.24/15.71 % Clause-clause subsumption calls (NU) : 14866
% 0.24/15.71 % Rec. Clause-clause subsumption calls : 9630
% 0.24/15.71 % Non-unit clause-clause subsumptions : 225
% 0.24/15.71 % Unit Clause-clause subsumption calls : 1218
% 0.24/15.71 % Rewrite failures with RHS unbound : 0
% 0.24/15.71 % BW rewrite match attempts : 194
% 0.24/15.71 % BW rewrite match successes : 11
% 0.24/15.71 % Condensation attempts : 0
% 0.24/15.71 % Condensation successes : 0
% 0.24/15.71 % Termbank termtop insertions : 90042
% 0.24/15.71 % Search garbage collected termcells : 185
% 0.24/15.71
% 0.24/15.71 % -------------------------------------------------
% 0.24/15.71 % User time : 0.110 s
% 0.24/15.71 % System time : 0.012 s
% 0.24/15.71 % Total time : 0.122 s
% 0.24/15.71 % Maximum resident set size: 3480 pages
% 0.24/15.71
% 0.24/15.71 % -------------------------------------------------
% 0.24/15.71 % User time : 0.477 s
% 0.24/15.71 % System time : 0.049 s
% 0.24/15.71 % Total time : 0.525 s
% 0.24/15.71 % Maximum resident set size: 4864 pages
% 0.24/15.71 % E exiting
%------------------------------------------------------------------------------