%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET517-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 : n011.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:19 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.58s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 44 ( 18 unt; 10 nHn; 30 RR)
% Number of literals : 79 ( 30 equ; 29 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 : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_not_singleton_of_set_1,negated_conjecture,
singleton(member_of(x)) = x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_not_singleton_of_set_1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
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(unordered_pair_member,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(prove_not_singleton_of_set_2,negated_conjecture,
member_of(x) = x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_not_singleton_of_set_2) ).
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(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(regularity2,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity2) ).
cnf(unordered_pair3,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).
cnf(c_0_12,negated_conjecture,
singleton(member_of(x)) = x,
prove_not_singleton_of_set_1 ).
cnf(c_0_13,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_14,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_15,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_16,negated_conjecture,
unordered_pair(member_of(x),member_of(x)) = x,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
member_of(x) = x,
prove_not_singleton_of_set_2 ).
cnf(c_0_18,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_19,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_14 ).
cnf(c_0_20,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_21,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_15 ).
cnf(c_0_22,negated_conjecture,
unordered_pair(x,x) = x,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_23,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_18 ).
cnf(c_0_24,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_25,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( ~ member(X1,x)
| X1 = x ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_29,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_30,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
regularity2 ).
cnf(c_0_31,negated_conjecture,
( x = null_class
| regular(x) = x ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_32,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_34,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
cnf(c_0_35,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_29 ).
cnf(c_0_36,negated_conjecture,
( x = null_class
| intersection(x,x) = null_class ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_32]),c_0_25]) ).
cnf(c_0_38,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
c_0_33 ).
cnf(c_0_39,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_34,c_0_22]) ).
cnf(c_0_40,negated_conjecture,
( ~ member(X1,x)
| x = null_class ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_41,negated_conjecture,
member(x,x),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_22]),c_0_39])]) ).
cnf(c_0_42,negated_conjecture,
x = null_class,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_42]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET517-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 % Computer : n011.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.41 % DateTime : Mon Sep 21 05:23:12 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.14/0.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.49 Running first-order theorem proving
% 0.19/0.49 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.25/0.58 % Version: 3.5.1
% 0.25/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.58 % Starting sh5l with 300s (1) cores
% 0.25/0.58 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1049779 completed with status 0
% 0.25/0.58 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.25/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.58 % No SInE strategy applied
% 0.25/0.58 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.25/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.25/0.58 % Starting new_bool_3 with 311s (1) cores
% 0.25/0.58 % Starting new_bool_1 with 308s (1) cores
% 0.25/0.58 % Starting sh5l with 304s (1) cores
% 0.25/0.58 % SubtermCWHack with pid 1049785 completed with status 0
% 0.25/0.58 % Result found by SubtermCWHack
% 0.25/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.58 % No SInE strategy applied
% 0.25/0.58 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.25/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.58 % Preprocessing time : 0.004 s
% 0.25/0.58
% 0.25/0.58 % Proof found!
% 0.25/0.58 % SZS status Unsatisfiable
% 0.25/0.58 % SZS output start CNFRefutation
% See solution above
% 0.25/0.58 % Parsed axioms : 114
% 0.25/0.58 % Removed by relevancy pruning/SinE : 0
% 0.25/0.58 % Initial clauses : 114
% 0.25/0.58 % Removed in clause preprocessing : 17
% 0.25/0.58 % Initial clauses in saturation : 97
% 0.25/0.58 % Processed clauses : 102
% 0.25/0.58 % ...of these trivial : 0
% 0.25/0.58 % ...subsumed : 14
% 0.25/0.58 % ...remaining for further processing : 88
% 0.25/0.58 % Other redundant clauses eliminated : 2
% 0.25/0.58 % Clauses deleted for lack of memory : 0
% 0.25/0.58 % Backward-subsumed : 0
% 0.25/0.58 % Backward-rewritten : 15
% 0.25/0.58 % Generated clauses : 131
% 0.25/0.58 % ...of the previous two non-redundant : 114
% 0.25/0.58 % ...aggressively subsumed : 0
% 0.25/0.58 % Contextual simplify-reflections : 1
% 0.25/0.58 % Paramodulations : 129
% 0.25/0.58 % Factorizations : 0
% 0.25/0.58 % NegExts : 0
% 0.25/0.58 % Equation resolutions : 2
% 0.25/0.58 % Disequality decompositions : 0
% 0.25/0.58 % Total rewrite steps : 48
% 0.25/0.58 % ...of those cached : 36
% 0.25/0.58 % Propositional unsat checks : 0
% 0.25/0.58 % Propositional check models : 0
% 0.25/0.58 % Propositional check unsatisfiable : 0
% 0.25/0.58 % Propositional clauses : 0
% 0.25/0.58 % Propositional clauses after purity: 0
% 0.25/0.58 % Propositional unsat core size : 0
% 0.25/0.58 % Propositional preprocessing time : 0.000
% 0.25/0.58 % Propositional encoding time : 0.000
% 0.25/0.58 % Propositional solver time : 0.000
% 0.25/0.58 % Success case prop preproc time : 0.000
% 0.25/0.58 % Success case prop encoding time : 0.000
% 0.25/0.58 % Success case prop solver time : 0.000
% 0.25/0.58 % Current number of processed clauses : 71
% 0.25/0.58 % Positive orientable unit clauses : 24
% 0.25/0.58 % Positive unorientable unit clauses: 1
% 0.25/0.58 % Negative unit clauses : 1
% 0.25/0.58 % Non-unit-clauses : 45
% 0.25/0.58 % Current number of unprocessed clauses: 105
% 0.25/0.58 % ...number of literals in the above : 250
% 0.25/0.58 % Current number of archived formulas : 0
% 0.25/0.58 % Current number of archived clauses : 32
% 0.25/0.58 % Clause-clause subsumption calls (NU) : 415
% 0.25/0.58 % Rec. Clause-clause subsumption calls : 248
% 0.25/0.58 % Non-unit clause-clause subsumptions : 11
% 0.25/0.58 % Unit Clause-clause subsumption calls : 65
% 0.25/0.58 % Rewrite failures with RHS unbound : 0
% 0.25/0.58 % BW rewrite match attempts : 4
% 0.25/0.58 % BW rewrite match successes : 2
% 0.25/0.58 % Condensation attempts : 0
% 0.25/0.58 % Condensation successes : 0
% 0.25/0.58 % Termbank termtop insertions : 6237
% 0.25/0.58 % Search garbage collected termcells : 183
% 0.25/0.58
% 0.25/0.58 % -------------------------------------------------
% 0.25/0.58 % User time : 0.021 s
% 0.25/0.58 % System time : 0.006 s
% 0.25/0.58 % Total time : 0.027 s
% 0.25/0.58 % Maximum resident set size: 4000 pages
% 0.25/0.58
% 0.25/0.58 % -------------------------------------------------
% 0.25/0.58 % User time : 0.065 s
% 0.25/0.58 % System time : 0.025 s
% 0.25/0.58 % Total time : 0.089 s
% 0.25/0.58 % Maximum resident set size: 4864 pages
% 0.25/0.58 % E exiting
%------------------------------------------------------------------------------