%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET516-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 : n005.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 0.03s 0.43s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 43 ( 15 unt; 10 nHn; 28 RR)
% Number of literals : 80 ( 27 equ; 31 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 62 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
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_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
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(prove_corollary_to_no_class_belongs_to_itself_1,negated_conjecture,
singleton(x) = x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_to_no_class_belongs_to_itself_1) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(unordered_pair3,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
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(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(c_0_11,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_12,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_13,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_11 ).
cnf(c_0_14,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_15,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_16,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_12 ).
cnf(c_0_17,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_18,plain,
( ~ member(X1,singleton(X2))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
singleton(x) = x,
prove_corollary_to_no_class_belongs_to_itself_1 ).
cnf(c_0_20,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_15 ).
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_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( ~ member(X1,x)
| X1 = x ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
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,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_27,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
cnf(c_0_28,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_29,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
regularity2 ).
cnf(c_0_30,negated_conjecture,
( x = null_class
| regular(x) = x ),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_31,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
c_0_26 ).
cnf(c_0_33,plain,
member(singleton(X1),universal_class),
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_34,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_28 ).
cnf(c_0_35,negated_conjecture,
( x = null_class
| intersection(x,x) = null_class ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_31]),c_0_22]) ).
cnf(c_0_37,plain,
( ~ member(X1,universal_class)
| member(X1,singleton(X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_14]) ).
cnf(c_0_38,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_33,c_0_19]) ).
cnf(c_0_39,negated_conjecture,
( ~ member(X1,x)
| x = null_class ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
member(x,x),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_19]),c_0_38])]) ).
cnf(c_0_41,negated_conjecture,
x = null_class,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_41]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET516-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n005.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.03/0.35 % DateTime : Mon Sep 21 05:22:47 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.39 Running first-order theorem proving
% 0.03/0.39 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.03/0.43 % Version: 3.5.1
% 0.03/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.03/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.03/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.43 % Starting sh5l with 300s (1) cores
% 0.03/0.43 % sh5l with pid 2634290 completed with status 0
% 0.03/0.43 % Result found by sh5l
% 0.03/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.03/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.03/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.43 % Starting sh5l with 300s (1) cores
% 0.03/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.03/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.03/0.43 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.03/0.43 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.03/0.43 % SubtermCWHack with pid 2634293 completed with status 0
% 0.03/0.43 % Result found by SubtermCWHack
% 0.03/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.03/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.03/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.43 % Starting sh5l with 300s (1) cores
% 0.03/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.03/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.03/0.43 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.03/0.43 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.03/0.43 % Preprocessing time : 0.002 s
% 0.03/0.43
% 0.03/0.43 % Proof found!
% 0.03/0.43 % SZS status Unsatisfiable
% 0.03/0.43 % SZS output start CNFRefutation
% See solution above
% 0.03/0.43 % Parsed axioms : 113
% 0.03/0.43 % Removed by relevancy pruning/SinE : 14
% 0.03/0.43 % Initial clauses : 99
% 0.03/0.43 % Removed in clause preprocessing : 0
% 0.03/0.43 % Initial clauses in saturation : 99
% 0.03/0.43 % Processed clauses : 145
% 0.03/0.43 % ...of these trivial : 0
% 0.03/0.43 % ...subsumed : 18
% 0.03/0.43 % ...remaining for further processing : 127
% 0.03/0.43 % Other redundant clauses eliminated : 2
% 0.03/0.43 % Clauses deleted for lack of memory : 0
% 0.03/0.43 % Backward-subsumed : 0
% 0.03/0.43 % Backward-rewritten : 20
% 0.03/0.43 % Generated clauses : 288
% 0.03/0.43 % ...of the previous two non-redundant : 238
% 0.03/0.43 % ...aggressively subsumed : 0
% 0.03/0.43 % Contextual simplify-reflections : 1
% 0.03/0.43 % Paramodulations : 286
% 0.03/0.43 % Factorizations : 0
% 0.03/0.43 % NegExts : 0
% 0.03/0.43 % Equation resolutions : 2
% 0.03/0.43 % Disequality decompositions : 0
% 0.03/0.43 % Total rewrite steps : 110
% 0.03/0.43 % ...of those cached : 82
% 0.03/0.43 % Propositional unsat checks : 0
% 0.03/0.43 % Propositional check models : 0
% 0.03/0.43 % Propositional check unsatisfiable : 0
% 0.03/0.43 % Propositional clauses : 0
% 0.03/0.43 % Propositional clauses after purity: 0
% 0.03/0.43 % Propositional unsat core size : 0
% 0.03/0.43 % Propositional preprocessing time : 0.000
% 0.03/0.43 % Propositional encoding time : 0.000
% 0.03/0.43 % Propositional solver time : 0.000
% 0.03/0.43 % Success case prop preproc time : 0.000
% 0.03/0.43 % Success case prop encoding time : 0.000
% 0.03/0.43 % Success case prop solver time : 0.000
% 0.03/0.43 % Current number of processed clauses : 105
% 0.03/0.43 % Positive orientable unit clauses : 39
% 0.03/0.43 % Positive unorientable unit clauses: 1
% 0.03/0.43 % Negative unit clauses : 1
% 0.03/0.43 % Non-unit-clauses : 64
% 0.03/0.43 % Current number of unprocessed clauses: 184
% 0.03/0.43 % ...number of literals in the above : 371
% 0.03/0.43 % Current number of archived formulas : 0
% 0.03/0.43 % Current number of archived clauses : 20
% 0.03/0.43 % Clause-clause subsumption calls (NU) : 908
% 0.03/0.43 % Rec. Clause-clause subsumption calls : 839
% 0.03/0.43 % Non-unit clause-clause subsumptions : 13
% 0.03/0.43 % Unit Clause-clause subsumption calls : 115
% 0.03/0.43 % Rewrite failures with RHS unbound : 0
% 0.03/0.43 % BW rewrite match attempts : 7
% 0.03/0.43 % BW rewrite match successes : 2
% 0.03/0.43 % Condensation attempts : 0
% 0.03/0.43 % Condensation successes : 0
% 0.03/0.43 % Termbank termtop insertions : 5654
% 0.03/0.43 % Search garbage collected termcells : 227
% 0.03/0.43
% 0.03/0.43 % -------------------------------------------------
% 0.03/0.43 % User time : 0.009 s
% 0.03/0.43 % System time : 0.008 s
% 0.03/0.43 % Total time : 0.017 s
% 0.03/0.43 % Maximum resident set size: 3736 pages
% 0.03/0.43
% 0.03/0.43 % -------------------------------------------------
% 0.03/0.43 % User time : 0.011 s
% 0.03/0.43 % System time : 0.014 s
% 0.03/0.43 % Total time : 0.025 s
% 0.03/0.43 % Maximum resident set size: 4864 pages
% 0.03/0.43 % E exiting
%------------------------------------------------------------------------------