%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET262-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 : n012.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:00 PM UTC 2026
% Result : Unsatisfiable 0.64s 0.51s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of clauses : 57 ( 18 unt; 10 nHn; 32 RR)
% Number of literals : 119 ( 23 equ; 59 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 2 con; 0-3 aty)
% Number of variables : 111 ( 13 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(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(domain2,axiom,
( ~ member(X1,universal_class)
| member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',domain2) ).
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(cartesian_product3,axiom,
( ~ member(X3,X4)
| ~ member(X1,X2)
| member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product3) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).
cnf(unordered_pair2,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(subclass_implies_equal,axiom,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(not_subclass_members2,axiom,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(not_subclass_members1,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(prove_domain_of_universal_class_1,negated_conjecture,
domain_of(universal_class) != universal_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_of_universal_class_1) ).
cnf(c_0_16,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_18,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_16 ).
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_17 ).
cnf(c_0_21,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_22,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ member(X1,universal_class)
| member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) = null_class ),
inference(fof_simplification,[status(thm)],[domain2]) ).
cnf(c_0_24,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
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,plain,
( ~ member(X1,universal_class)
| member(X1,domain_of(X2))
| restrict(X2,singleton(X1),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,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ member(X3,X4)
| ~ member(X1,X2)
| member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
inference(fof_simplification,[status(thm)],[cartesian_product3]) ).
cnf(c_0_32,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_33,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_26 ).
cnf(c_0_34,plain,
( ~ member(X1,universal_class)
| member(X1,domain_of(X2))
| intersection(X2,cross_product(unordered_pair(X1,X1),universal_class)) = null_class ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_35,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_30]),c_0_22]) ).
cnf(c_0_36,plain,
( ~ member(X3,X4)
| ~ member(X1,X2)
| member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
c_0_31 ).
cnf(c_0_37,plain,
unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = ordered_pair(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_28]),c_0_28]) ).
cnf(c_0_38,plain,
( ~ member(X3,X2)
| ~ member(X1,universal_class)
| ~ member(X3,cross_product(unordered_pair(X1,X1),universal_class))
| member(X1,domain_of(X2)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_39,plain,
( ~ member(X1,X2)
| ~ member(X3,X4)
| member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X3,X3))),cross_product(X2,X4)) ),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( ~ member(X4,universal_class)
| ~ member(X1,universal_class)
| ~ member(X3,unordered_pair(X1,X1))
| ~ member(unordered_pair(unordered_pair(X3,X3),unordered_pair(X3,unordered_pair(X4,X4))),X2)
| member(X1,domain_of(X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
cnf(c_0_42,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_43,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_44,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_45,plain,
( ~ member(X1,universal_class)
| ~ member(X2,unordered_pair(X1,X1))
| member(X1,domain_of(universal_class)) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_46,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_42 ).
cnf(c_0_47,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_48,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_43 ).
cnf(c_0_49,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_44 ).
cnf(c_0_50,plain,
( ~ member(X1,universal_class)
| member(X1,domain_of(universal_class)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_22,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
domain_of(universal_class) != universal_class,
inference(fof_simplification,[status(thm)],[prove_domain_of_universal_class_1]) ).
cnf(c_0_53,plain,
( ~ subclass(universal_class,X1)
| universal_class = X1 ),
inference(spm,[status(thm)],[c_0_48,c_0_19]) ).
cnf(c_0_54,plain,
subclass(X1,domain_of(universal_class)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_55,negated_conjecture,
domain_of(universal_class) != universal_class,
c_0_52 ).
cnf(c_0_56,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET262-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Mon Sep 21 05:03:21 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.32 Running first-order theorem proving
% 0.06/0.32 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.64/0.51 % Version: 3.5.1
% 0.64/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.64/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.64/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.64/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.64/0.51 % Starting sh5l with 300s (1) cores
% 0.64/0.51 % new_bool_3 with pid 1612163 completed with status 9
% 0.64/0.51 % new_bool_1 with pid 1612164 completed with status 9
% 0.64/0.51 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1612162 completed with status 0
% 0.64/0.51 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.64/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.64/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.64/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.64/0.51 % No SInE strategy applied
% 0.64/0.51 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.64/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.64/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.64/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.64/0.51 % Starting new_bool_3 with 311s (1) cores
% 0.64/0.51 % Starting new_bool_1 with 308s (1) cores
% 0.64/0.51 % Starting sh5l with 304s (1) cores
% 0.64/0.51 % sh5l with pid 1612175 completed with status 0
% 0.64/0.51 % Result found by sh5l
% 0.64/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.64/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.64/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.64/0.51 % No SInE strategy applied
% 0.64/0.51 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.64/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.64/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.64/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.64/0.51 % Starting new_bool_3 with 311s (1) cores
% 0.64/0.51 % Starting new_bool_1 with 308s (1) cores
% 0.64/0.51 % Starting sh5l with 304s (1) cores
% 0.64/0.51 % Preprocessing time : 0.002 s
% 0.64/0.51 % Presaturation interreduction done
% 0.64/0.51
% 0.64/0.51 % Proof found!
% 0.64/0.51 % SZS status Unsatisfiable
% 0.64/0.51 % SZS output start CNFRefutation
% See solution above
% 0.64/0.51 % Parsed axioms : 113
% 0.64/0.51 % Removed by relevancy pruning/SinE : 0
% 0.64/0.51 % Initial clauses : 113
% 0.64/0.51 % Removed in clause preprocessing : 17
% 0.64/0.51 % Initial clauses in saturation : 96
% 0.64/0.51 % Processed clauses : 2374
% 0.64/0.51 % ...of these trivial : 1
% 0.64/0.51 % ...subsumed : 1620
% 0.64/0.51 % ...remaining for further processing : 753
% 0.64/0.51 % Other redundant clauses eliminated : 8
% 0.64/0.51 % Clauses deleted for lack of memory : 0
% 0.64/0.51 % Backward-subsumed : 35
% 0.64/0.51 % Backward-rewritten : 42
% 0.64/0.51 % Generated clauses : 8301
% 0.64/0.51 % ...of the previous two non-redundant : 7352
% 0.64/0.51 % ...aggressively subsumed : 0
% 0.64/0.51 % Contextual simplify-reflections : 20
% 0.64/0.51 % Paramodulations : 8289
% 0.64/0.51 % Factorizations : 4
% 0.64/0.51 % NegExts : 0
% 0.64/0.51 % Equation resolutions : 8
% 0.64/0.51 % Disequality decompositions : 0
% 0.64/0.51 % Total rewrite steps : 3651
% 0.64/0.51 % ...of those cached : 3428
% 0.64/0.51 % Propositional unsat checks : 0
% 0.64/0.51 % Propositional check models : 0
% 0.64/0.51 % Propositional check unsatisfiable : 0
% 0.64/0.51 % Propositional clauses : 0
% 0.64/0.51 % Propositional clauses after purity: 0
% 0.64/0.51 % Propositional unsat core size : 0
% 0.64/0.51 % Propositional preprocessing time : 0.000
% 0.64/0.51 % Propositional encoding time : 0.000
% 0.64/0.51 % Propositional solver time : 0.000
% 0.64/0.51 % Success case prop preproc time : 0.000
% 0.64/0.51 % Success case prop encoding time : 0.000
% 0.64/0.51 % Success case prop solver time : 0.000
% 0.64/0.51 % Current number of processed clauses : 577
% 0.64/0.51 % Positive orientable unit clauses : 49
% 0.64/0.51 % Positive unorientable unit clauses: 1
% 0.64/0.51 % Negative unit clauses : 3
% 0.64/0.51 % Non-unit-clauses : 524
% 0.64/0.51 % Current number of unprocessed clauses: 5059
% 0.64/0.51 % ...number of literals in the above : 17097
% 0.64/0.51 % Current number of archived formulas : 0
% 0.64/0.51 % Current number of archived clauses : 189
% 0.64/0.51 % Clause-clause subsumption calls (NU) : 58966
% 0.64/0.51 % Rec. Clause-clause subsumption calls : 41335
% 0.64/0.51 % Non-unit clause-clause subsumptions : 1536
% 0.64/0.51 % Unit Clause-clause subsumption calls : 1134
% 0.64/0.51 % Rewrite failures with RHS unbound : 0
% 0.64/0.51 % BW rewrite match attempts : 54
% 0.64/0.51 % BW rewrite match successes : 29
% 0.64/0.51 % Condensation attempts : 2374
% 0.64/0.51 % Condensation successes : 64
% 0.64/0.51 % Termbank termtop insertions : 178585
% 0.64/0.51 % Search garbage collected termcells : 185
% 0.64/0.51
% 0.64/0.51 % -------------------------------------------------
% 0.64/0.51 % User time : 0.162 s
% 0.64/0.51 % System time : 0.005 s
% 0.64/0.51 % Total time : 0.167 s
% 0.64/0.51 % Maximum resident set size: 3736 pages
% 0.64/0.51
% 0.64/0.51 % -------------------------------------------------
% 0.64/0.51 % User time : 0.817 s
% 0.64/0.51 % System time : 0.060 s
% 0.64/0.51 % Total time : 0.876 s
% 0.64/0.51 % Maximum resident set size: 4608 pages
% 0.64/0.51 % E exiting
%------------------------------------------------------------------------------