%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET134-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 : n016.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:13:42 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.61s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of clauses : 55 ( 22 unt; 9 nHn; 34 RR)
% Number of literals : 97 ( 22 equ; 38 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 79 ( 11 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(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
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(definition_of_set_builder,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_of_set_builder) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(subclass_implies_equal,axiom,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
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(prove_corollary_2_to_member_of_triple_2,negated_conjecture,
set_builder(u,set_builder(y,set_builder(z,null_class))) = null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_2_to_member_of_triple_2) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(unordered_pair2,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(prove_corollary_2_to_member_of_triple_1,negated_conjecture,
member(u,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_2_to_member_of_triple_1) ).
cnf(c_0_15,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_16,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_17,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_15 ).
cnf(c_0_18,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_19,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_16 ).
cnf(c_0_20,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_21,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_24,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_25,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_24 ).
cnf(c_0_27,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_25]),c_0_21]) ).
cnf(c_0_28,plain,
( member(regular(complement(complement(X1))),X1)
| complement(complement(X1)) = null_class ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_23]) ).
cnf(c_0_29,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_30,plain,
complement(complement(null_class)) = null_class,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_29 ).
cnf(c_0_32,plain,
( ~ member(X1,universal_class)
| member(X1,complement(null_class)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_30]),c_0_27]) ).
cnf(c_0_33,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
definition_of_set_builder ).
cnf(c_0_34,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_35,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_36,plain,
( ~ member(not_subclass_element(X1,complement(null_class)),universal_class)
| subclass(X1,complement(null_class)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_38,negated_conjecture,
set_builder(u,set_builder(y,set_builder(z,null_class))) = null_class,
prove_corollary_2_to_member_of_triple_2 ).
cnf(c_0_39,plain,
union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_41,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_35 ).
cnf(c_0_42,plain,
subclass(universal_class,complement(null_class)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))) = null_class,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_39]),c_0_39]),c_0_40]),c_0_40]),c_0_40]) ).
cnf(c_0_44,plain,
complement(null_class) = universal_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_18])]) ).
cnf(c_0_45,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_46,negated_conjecture,
complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),universal_class)))))))) = null_class,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_45 ).
cnf(c_0_48,negated_conjecture,
( ~ member(X1,universal_class)
| member(X1,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),universal_class)))))))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_46]),c_0_27]) ).
cnf(c_0_49,negated_conjecture,
( ~ member(X1,universal_class)
| member(X1,complement(unordered_pair(u,u))) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_51,negated_conjecture,
~ member(X1,unordered_pair(u,u)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_49]),c_0_21]) ).
cnf(c_0_52,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_50 ).
cnf(c_0_53,negated_conjecture,
member(u,universal_class),
prove_corollary_2_to_member_of_triple_1 ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET134-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.46 % Computer : n016.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 05:00:37 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.52 Running first-order theorem proving
% 0.21/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
% 0.24/0.61 % Version: 3.5.1
% 0.24/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.61 % Starting sh5l with 300s (1) cores
% 0.24/0.61 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1608241 completed with status 0
% 0.24/0.61 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.61 % No SInE strategy applied
% 0.24/0.61 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.24/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.61 % Starting new_bool_3 with 311s (1) cores
% 0.24/0.61 % Starting new_bool_1 with 308s (1) cores
% 0.24/0.61 % Starting sh5l with 304s (1) cores
% 0.24/0.61 % sh5l with pid 1608252 completed with status 0
% 0.24/0.61 % Result found by sh5l
% 0.24/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.61 % No SInE strategy applied
% 0.24/0.61 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.24/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.61 % Starting new_bool_3 with 311s (1) cores
% 0.24/0.61 % Starting new_bool_1 with 308s (1) cores
% 0.24/0.61 % Starting sh5l with 304s (1) cores
% 0.24/0.61 % Preprocessing time : 0.002 s
% 0.24/0.61 % Presaturation interreduction done
% 0.24/0.61
% 0.24/0.61 % Proof found!
% 0.24/0.61 % SZS status Unsatisfiable
% 0.24/0.61 % SZS output start CNFRefutation
% See solution above
% 0.24/0.61 % Parsed axioms : 94
% 0.24/0.61 % Removed by relevancy pruning/SinE : 0
% 0.24/0.61 % Initial clauses : 94
% 0.24/0.61 % Removed in clause preprocessing : 16
% 0.24/0.61 % Initial clauses in saturation : 78
% 0.24/0.61 % Processed clauses : 335
% 0.24/0.61 % ...of these trivial : 2
% 0.24/0.61 % ...subsumed : 67
% 0.24/0.61 % ...remaining for further processing : 266
% 0.24/0.61 % Other redundant clauses eliminated : 3
% 0.24/0.61 % Clauses deleted for lack of memory : 0
% 0.24/0.61 % Backward-subsumed : 9
% 0.24/0.61 % Backward-rewritten : 11
% 0.24/0.61 % Generated clauses : 509
% 0.24/0.61 % ...of the previous two non-redundant : 419
% 0.24/0.61 % ...aggressively subsumed : 0
% 0.24/0.61 % Contextual simplify-reflections : 7
% 0.24/0.61 % Paramodulations : 506
% 0.24/0.61 % Factorizations : 0
% 0.24/0.61 % NegExts : 0
% 0.24/0.61 % Equation resolutions : 3
% 0.24/0.61 % Disequality decompositions : 0
% 0.24/0.61 % Total rewrite steps : 277
% 0.24/0.61 % ...of those cached : 251
% 0.24/0.61 % Propositional unsat checks : 0
% 0.24/0.61 % Propositional check models : 0
% 0.24/0.61 % Propositional check unsatisfiable : 0
% 0.24/0.61 % Propositional clauses : 0
% 0.24/0.61 % Propositional clauses after purity: 0
% 0.24/0.61 % Propositional unsat core size : 0
% 0.24/0.61 % Propositional preprocessing time : 0.000
% 0.24/0.61 % Propositional encoding time : 0.000
% 0.24/0.61 % Propositional solver time : 0.000
% 0.24/0.61 % Success case prop preproc time : 0.000
% 0.24/0.61 % Success case prop encoding time : 0.000
% 0.24/0.61 % Success case prop solver time : 0.000
% 0.24/0.61 % Current number of processed clauses : 166
% 0.24/0.61 % Positive orientable unit clauses : 28
% 0.24/0.61 % Positive unorientable unit clauses: 1
% 0.24/0.61 % Negative unit clauses : 2
% 0.24/0.61 % Non-unit-clauses : 135
% 0.24/0.61 % Current number of unprocessed clauses: 214
% 0.24/0.61 % ...number of literals in the above : 592
% 0.24/0.61 % Current number of archived formulas : 0
% 0.24/0.61 % Current number of archived clauses : 113
% 0.24/0.61 % Clause-clause subsumption calls (NU) : 3735
% 0.24/0.61 % Rec. Clause-clause subsumption calls : 2742
% 0.24/0.61 % Non-unit clause-clause subsumptions : 62
% 0.24/0.61 % Unit Clause-clause subsumption calls : 252
% 0.24/0.61 % Rewrite failures with RHS unbound : 0
% 0.24/0.61 % BW rewrite match attempts : 16
% 0.24/0.61 % BW rewrite match successes : 8
% 0.24/0.61 % Condensation attempts : 335
% 0.24/0.61 % Condensation successes : 5
% 0.24/0.61 % Termbank termtop insertions : 15168
% 0.24/0.61 % Search garbage collected termcells : 154
% 0.24/0.61
% 0.24/0.61 % -------------------------------------------------
% 0.24/0.61 % User time : 0.030 s
% 0.24/0.61 % System time : 0.008 s
% 0.24/0.61 % Total time : 0.039 s
% 0.24/0.61 % Maximum resident set size: 3720 pages
% 0.24/0.61
% 0.24/0.61 % -------------------------------------------------
% 0.24/0.61 % User time : 0.099 s
% 0.24/0.61 % System time : 0.027 s
% 0.24/0.61 % Total time : 0.126 s
% 0.24/0.61 % Maximum resident set size: 4864 pages
% 0.24/0.61 % E exiting
%------------------------------------------------------------------------------