%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET067-7 : 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 : 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:13:24 PM UTC 2026
% Result : Unsatisfiable 0.21s 10.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 16 unt; 13 nHn; 23 RR)
% Number of literals : 77 ( 18 equ; 27 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; 5 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/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(choice2,axiom,
( ~ member(X1,universal_class)
| member(apply(choice,X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',choice2) ).
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(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
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(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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(prove_singleton_in_unordered_pair1_1,negated_conjecture,
~ subclass(singleton(x),unordered_pair(x,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair1_1) ).
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(null_class_is_subclass,axiom,
subclass(null_class,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_class_is_subclass) ).
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(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_11 ).
cnf(c_0_13,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_14,plain,
( ~ member(X1,universal_class)
| member(apply(choice,X1),X1)
| X1 = null_class ),
inference(fof_simplification,[status(thm)],[choice2]) ).
cnf(c_0_15,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
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,singleton(X2))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ member(X1,universal_class)
| member(apply(choice,X1),X1)
| X1 = null_class ),
c_0_14 ).
cnf(c_0_19,plain,
member(singleton(X1),universal_class),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_20,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_21,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_22,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_16 ).
cnf(c_0_23,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_24,plain,
( singleton(X1) = null_class
| apply(choice,singleton(X1)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_25,negated_conjecture,
~ subclass(singleton(x),unordered_pair(x,y)),
inference(fof_simplification,[status(thm)],[prove_singleton_in_unordered_pair1_1]) ).
cnf(c_0_26,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_20 ).
cnf(c_0_27,plain,
( subclass(singleton(X1),X2)
| not_subclass_element(singleton(X1),X2) = X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_28,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( member(X1,singleton(X1))
| singleton(X1) = null_class ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_24]),c_0_19])]) ).
cnf(c_0_30,negated_conjecture,
~ subclass(singleton(x),unordered_pair(x,y)),
c_0_25 ).
cnf(c_0_31,plain,
( ~ member(X1,X2)
| subclass(singleton(X1),X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( member(X1,universal_class)
| singleton(X1) = null_class ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
~ subclass(unordered_pair(x,x),unordered_pair(x,y)),
inference(rw,[status(thm)],[c_0_30,c_0_13]) ).
cnf(c_0_34,plain,
( ~ member(X1,X2)
| subclass(unordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_13]) ).
cnf(c_0_35,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_36,plain,
( member(X1,universal_class)
| unordered_pair(X1,X1) = null_class ),
inference(spm,[status(thm)],[c_0_13,c_0_32]) ).
cnf(c_0_37,axiom,
subclass(null_class,X1),
null_class_is_subclass ).
cnf(c_0_38,negated_conjecture,
~ member(x,unordered_pair(x,y)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_35 ).
cnf(c_0_40,negated_conjecture,
member(x,universal_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_36]),c_0_37])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET067-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/10.45 % Computer : n018.cluster.edu
% 0.18/10.45 % Model : x86_64 x86_64
% 0.18/10.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/10.45 % Memory : 8046.5625MB
% 0.18/10.45 % OS : Linux 6.8.0-71-generic
% 0.18/10.45 % CPULimit : 300
% 0.18/10.45 % WCLimit : 300
% 0.18/10.45 % DateTime : Mon Sep 21 04:51:54 UTC 2026
% 0.18/10.45 % CPUTime :
% 0.18/10.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/10.49 Running first-order theorem proving
% 0.18/10.50 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.21/10.55 % Version: 3.5.1
% 0.21/10.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/10.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/10.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/10.55 % Starting new_bool_3 with 300s (1) cores
% 0.21/10.55 % Starting new_bool_1 with 300s (1) cores
% 0.21/10.55 % Starting sh5l with 300s (1) cores
% 0.21/10.55 % sh5l with pid 997564 completed with status 0
% 0.21/10.55 % Result found by sh5l
% 0.21/10.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/10.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/10.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/10.55 % Starting new_bool_3 with 300s (1) cores
% 0.21/10.55 % Starting new_bool_1 with 300s (1) cores
% 0.21/10.55 % Starting sh5l with 300s (1) cores
% 0.21/10.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.21/10.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/10.55 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.21/10.55 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.21/10.55 % Starting SubtermCWHack with 28s (1) cores
% 0.21/10.55 % SubtermCWHack with pid 997565 completed with status 0
% 0.21/10.55 % Result found by SubtermCWHack
% 0.21/10.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/10.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/10.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/10.55 % Starting new_bool_3 with 300s (1) cores
% 0.21/10.55 % Starting new_bool_1 with 300s (1) cores
% 0.21/10.55 % Starting sh5l with 300s (1) cores
% 0.21/10.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.21/10.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/10.55 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.21/10.55 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.21/10.55 % Starting SubtermCWHack with 28s (1) cores
% 0.21/10.55 % Preprocessing time : 0.003 s
% 0.21/10.55
% 0.21/10.55 % Proof found!
% 0.21/10.55 % SZS status Unsatisfiable
% 0.21/10.55 % SZS output start CNFRefutation
% See solution above
% 0.21/10.55 % Parsed axioms : 109
% 0.21/10.55 % Removed by relevancy pruning/SinE : 9
% 0.21/10.55 % Initial clauses : 100
% 0.21/10.55 % Removed in clause preprocessing : 0
% 0.21/10.55 % Initial clauses in saturation : 100
% 0.21/10.55 % Processed clauses : 391
% 0.21/10.55 % ...of these trivial : 5
% 0.21/10.55 % ...subsumed : 156
% 0.21/10.55 % ...remaining for further processing : 230
% 0.21/10.55 % Other redundant clauses eliminated : 3
% 0.21/10.55 % Clauses deleted for lack of memory : 0
% 0.21/10.55 % Backward-subsumed : 0
% 0.21/10.55 % Backward-rewritten : 2
% 0.21/10.55 % Generated clauses : 975
% 0.21/10.55 % ...of the previous two non-redundant : 801
% 0.21/10.55 % ...aggressively subsumed : 0
% 0.21/10.55 % Contextual simplify-reflections : 0
% 0.21/10.55 % Paramodulations : 970
% 0.21/10.55 % Factorizations : 2
% 0.21/10.55 % NegExts : 0
% 0.21/10.55 % Equation resolutions : 3
% 0.21/10.55 % Disequality decompositions : 0
% 0.21/10.55 % Total rewrite steps : 203
% 0.21/10.55 % ...of those cached : 136
% 0.21/10.55 % Propositional unsat checks : 0
% 0.21/10.55 % Propositional check models : 0
% 0.21/10.55 % Propositional check unsatisfiable : 0
% 0.21/10.55 % Propositional clauses : 0
% 0.21/10.55 % Propositional clauses after purity: 0
% 0.21/10.55 % Propositional unsat core size : 0
% 0.21/10.55 % Propositional preprocessing time : 0.000
% 0.21/10.55 % Propositional encoding time : 0.000
% 0.21/10.55 % Propositional solver time : 0.000
% 0.21/10.55 % Success case prop preproc time : 0.000
% 0.21/10.55 % Success case prop encoding time : 0.000
% 0.21/10.55 % Success case prop solver time : 0.000
% 0.21/10.55 % Current number of processed clauses : 225
% 0.21/10.55 % Positive orientable unit clauses : 55
% 0.21/10.55 % Positive unorientable unit clauses: 3
% 0.21/10.55 % Negative unit clauses : 5
% 0.21/10.55 % Non-unit-clauses : 162
% 0.21/10.55 % Current number of unprocessed clauses: 510
% 0.21/10.55 % ...number of literals in the above : 1325
% 0.21/10.55 % Current number of archived formulas : 0
% 0.21/10.55 % Current number of archived clauses : 2
% 0.21/10.55 % Clause-clause subsumption calls (NU) : 4381
% 0.21/10.55 % Rec. Clause-clause subsumption calls : 4045
% 0.21/10.55 % Non-unit clause-clause subsumptions : 130
% 0.21/10.55 % Unit Clause-clause subsumption calls : 353
% 0.21/10.55 % Rewrite failures with RHS unbound : 0
% 0.21/10.55 % BW rewrite match attempts : 15
% 0.21/10.55 % BW rewrite match successes : 12
% 0.21/10.55 % Condensation attempts : 0
% 0.21/10.55 % Condensation successes : 0
% 0.21/10.55 % Termbank termtop insertions : 13003
% 0.21/10.55 % Search garbage collected termcells : 214
% 0.21/10.55
% 0.21/10.55 % -------------------------------------------------
% 0.21/10.55 % User time : 0.023 s
% 0.21/10.55 % System time : 0.006 s
% 0.21/10.55 % Total time : 0.029 s
% 0.21/10.55 % Maximum resident set size: 3724 pages
% 0.21/10.55
% 0.21/10.55 % -------------------------------------------------
% 0.21/10.55 % User time : 0.028 s
% 0.21/10.55 % System time : 0.009 s
% 0.21/10.55 % Total time : 0.037 s
% 0.21/10.55 % Maximum resident set size: 4608 pages
% 0.21/10.55 % E exiting
%------------------------------------------------------------------------------