%------------------------------------------------------------------------------
% File : E---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 : n018.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:18 PM UTC 2026
% Result : Unsatisfiable 1.07s 0.65s
% Output : CNFRefutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 52 ( 13 unt; 20 nHn; 32 RR)
% Number of literals : 109 ( 35 equ; 45 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 83 ( 5 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(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(regularity2,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity2) ).
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(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
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(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(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(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(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
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(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_15,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_13 ).
cnf(c_0_16,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_14 ).
cnf(c_0_18,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_19,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_22,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_23,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_22 ).
cnf(c_0_25,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
regularity2 ).
cnf(c_0_26,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_19]) ).
cnf(c_0_27,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_28,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_29,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_30,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_31,plain,
( ~ member(X2,X1)
| ~ member(X2,regular(X1))
| X1 = null_class ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_32,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_27 ).
cnf(c_0_33,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_28 ).
cnf(c_0_34,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_35,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_30 ).
cnf(c_0_36,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_37,plain,
( ~ member(not_subclass_element(regular(X1),X2),X1)
| subclass(regular(X1),X2)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_38,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_39,plain,
( unordered_pair(X1,X2) = null_class
| regular(unordered_pair(X1,X2)) = X1
| regular(unordered_pair(X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_35,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,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_36 ).
cnf(c_0_42,plain,
( subclass(regular(X1),complement(X1))
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,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_44,negated_conjecture,
singleton(universal_class) != null_class,
c_0_40 ).
cnf(c_0_45,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_46,plain,
( ~ subclass(universal_class,X1)
| universal_class = X1 ),
inference(spm,[status(thm)],[c_0_41,c_0_16]) ).
cnf(c_0_47,plain,
( subclass(X1,complement(unordered_pair(X1,X1)))
| unordered_pair(X1,X1) = null_class ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
unordered_pair(universal_class,universal_class) != null_class,
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
complement(unordered_pair(universal_class,universal_class)) = universal_class,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_50,plain,
~ member(X1,unordered_pair(universal_class,universal_class)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_49]),c_0_19]) ).
cnf(c_0_51,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_18]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET510-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42 % Computer : n018.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Mon Sep 21 05:24:29 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.07/0.65 % Version: 3.5.1
% 1.07/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.07/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.07/0.65 % Starting new_bool_3 with 300s (1) cores
% 1.07/0.65 % Starting new_bool_1 with 300s (1) cores
% 1.07/0.65 % Starting sh5l with 300s (1) cores
% 1.07/0.65 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1045454 completed with status 0
% 1.07/0.65 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.07/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.07/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.07/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.07/0.65 % No SInE strategy applied
% 1.07/0.65 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.07/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.07/0.65 % Starting SubtermCWHack with 136s (1) cores
% 1.07/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.07/0.65 % Starting new_bool_3 with 311s (1) cores
% 1.07/0.65 % Starting new_bool_1 with 308s (1) cores
% 1.07/0.65 % Starting sh5l with 304s (1) cores
% 1.07/0.65 % SubtermCWHack with pid 1045461 completed with status 0
% 1.07/0.65 % Result found by SubtermCWHack
% 1.07/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.07/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.07/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.07/0.65 % No SInE strategy applied
% 1.07/0.65 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.07/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.07/0.65 % Starting SubtermCWHack with 136s (1) cores
% 1.07/0.65 % Preprocessing time : 0.004 s
% 1.07/0.65
% 1.07/0.65 % Proof found!
% 1.07/0.65 % SZS status Unsatisfiable
% 1.07/0.65 % SZS output start CNFRefutation
% See solution above
% 1.07/0.65 % Parsed axioms : 113
% 1.07/0.65 % Removed by relevancy pruning/SinE : 0
% 1.07/0.65 % Initial clauses : 113
% 1.07/0.65 % Removed in clause preprocessing : 17
% 1.07/0.65 % Initial clauses in saturation : 96
% 1.07/0.65 % Processed clauses : 789
% 1.07/0.65 % ...of these trivial : 3
% 1.07/0.65 % ...subsumed : 369
% 1.07/0.65 % ...remaining for further processing : 417
% 1.07/0.65 % Other redundant clauses eliminated : 8
% 1.07/0.65 % Clauses deleted for lack of memory : 0
% 1.07/0.65 % Backward-subsumed : 8
% 1.07/0.66 % Backward-rewritten : 15
% 1.07/0.66 % Generated clauses : 2612
% 1.07/0.66 % ...of the previous two non-redundant : 2141
% 1.07/0.66 % ...aggressively subsumed : 0
% 1.07/0.66 % Contextual simplify-reflections : 8
% 1.07/0.66 % Paramodulations : 2600
% 1.07/0.66 % Factorizations : 4
% 1.07/0.66 % NegExts : 0
% 1.07/0.66 % Equation resolutions : 8
% 1.07/0.66 % Disequality decompositions : 0
% 1.07/0.66 % Total rewrite steps : 719
% 1.07/0.66 % ...of those cached : 593
% 1.07/0.66 % Propositional unsat checks : 0
% 1.07/0.66 % Propositional check models : 0
% 1.07/0.66 % Propositional check unsatisfiable : 0
% 1.07/0.66 % Propositional clauses : 0
% 1.07/0.66 % Propositional clauses after purity: 0
% 1.07/0.66 % Propositional unsat core size : 0
% 1.07/0.66 % Propositional preprocessing time : 0.000
% 1.07/0.66 % Propositional encoding time : 0.000
% 1.07/0.66 % Propositional solver time : 0.000
% 1.07/0.66 % Success case prop preproc time : 0.000
% 1.07/0.66 % Success case prop encoding time : 0.000
% 1.07/0.66 % Success case prop solver time : 0.000
% 1.07/0.66 % Current number of processed clauses : 390
% 1.07/0.66 % Positive orientable unit clauses : 77
% 1.07/0.66 % Positive unorientable unit clauses: 1
% 1.07/0.66 % Negative unit clauses : 4
% 1.07/0.66 % Non-unit-clauses : 308
% 1.07/0.66 % Current number of unprocessed clauses: 1431
% 1.07/0.66 % ...number of literals in the above : 4062
% 1.07/0.66 % Current number of archived formulas : 0
% 1.07/0.66 % Current number of archived clauses : 40
% 1.07/0.66 % Clause-clause subsumption calls (NU) : 9976
% 1.07/0.66 % Rec. Clause-clause subsumption calls : 6625
% 1.07/0.66 % Non-unit clause-clause subsumptions : 286
% 1.07/0.66 % Unit Clause-clause subsumption calls : 655
% 1.07/0.66 % Rewrite failures with RHS unbound : 0
% 1.07/0.66 % BW rewrite match attempts : 43
% 1.07/0.66 % BW rewrite match successes : 16
% 1.07/0.66 % Condensation attempts : 0
% 1.07/0.66 % Condensation successes : 0
% 1.07/0.66 % Termbank termtop insertions : 68264
% 1.07/0.66 % Search garbage collected termcells : 185
% 1.07/0.66
% 1.07/0.66 % -------------------------------------------------
% 1.07/0.66 % User time : 0.113 s
% 1.07/0.66 % System time : 0.014 s
% 1.07/0.66 % Total time : 0.127 s
% 1.07/0.66 % Maximum resident set size: 3736 pages
% 1.07/0.66
% 1.07/0.66 % -------------------------------------------------
% 1.07/0.66 % User time : 0.557 s
% 1.07/0.66 % System time : 0.054 s
% 1.07/0.66 % Total time : 0.611 s
% 1.07/0.66 % Maximum resident set size: 4608 pages
% 1.07/0.66 % E exiting
%------------------------------------------------------------------------------