%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET067-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 : n003.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:16:21 PM UTC 2026
% Result : Unsatisfiable 0.21s 5.68s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 32 ( 12 unt; 9 nHn; 17 RR)
% Number of literals : 59 ( 11 equ; 21 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 9 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(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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
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_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(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
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(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(c_0_8,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_9,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_10,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_8 ).
cnf(c_0_11,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_12,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_9 ).
cnf(c_0_13,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_14,negated_conjecture,
~ subclass(singleton(x),unordered_pair(x,y)),
inference(fof_simplification,[status(thm)],[prove_singleton_in_unordered_pair1_1]) ).
cnf(c_0_15,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( subclass(unordered_pair(X1,X2),X3)
| not_subclass_element(unordered_pair(X1,X2),X3) = X2
| not_subclass_element(unordered_pair(X1,X2),X3) = X1 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ subclass(singleton(x),unordered_pair(x,y)),
c_0_14 ).
cnf(c_0_18,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_19,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_20,plain,
( subclass(unordered_pair(X1,X1),X2)
| not_subclass_element(unordered_pair(X1,X1),X2) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_16])]) ).
cnf(c_0_21,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_22,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_23,negated_conjecture,
~ subclass(unordered_pair(x,x),unordered_pair(x,y)),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( subclass(unordered_pair(X1,X1),X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_21 ).
cnf(c_0_26,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( ~ member(X1,X2)
| subclass(unordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
member(x,unordered_pair(x,X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
subclass(unordered_pair(x,x),unordered_pair(x,X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET067-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.17/5.45 % Computer : n003.cluster.edu
% 0.17/5.45 % Model : x86_64 x86_64
% 0.17/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.45 % Memory : 8046.5625MB
% 0.17/5.45 % OS : Linux 6.8.0-71-generic
% 0.17/5.46 % CPULimit : 300
% 0.17/5.46 % WCLimit : 300
% 0.17/5.46 % DateTime : Mon Sep 21 04:51:21 UTC 2026
% 0.17/5.46 % CPUTime :
% 0.17/5.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/5.53 Running first-order theorem proving
% 0.21/5.53 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/5.68 % Version: 3.5.1
% 0.21/5.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/5.68 % Starting new_bool_3 with 300s (1) cores
% 0.21/5.68 % Starting new_bool_1 with 300s (1) cores
% 0.21/5.68 % Starting sh5l with 300s (1) cores
% 0.21/5.68 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3445178 completed with status 0
% 0.21/5.68 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/5.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/5.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/5.68 % No SInE strategy applied
% 0.21/5.68 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.21/5.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/5.68 % Starting SubtermCWHack with 136s (1) cores
% 0.21/5.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/5.68 % Starting new_bool_3 with 311s (1) cores
% 0.21/5.68 % Starting new_bool_1 with 308s (1) cores
% 0.21/5.68 % Starting sh5l with 304s (1) cores
% 0.21/5.68 % new_bool_1 with pid 3445188 completed with status 0
% 0.21/5.68 % Result found by new_bool_1
% 0.21/5.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/5.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/5.68 % No SInE strategy applied
% 0.21/5.68 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.21/5.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/5.68 % Starting SubtermCWHack with 136s (1) cores
% 0.21/5.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/5.68 % Starting new_bool_3 with 311s (1) cores
% 0.21/5.68 % Starting new_bool_1 with 308s (1) cores
% 0.21/5.68 % Preprocessing time : 0.004 s
% 0.21/5.68 % Presaturation interreduction done
% 0.21/5.68
% 0.21/5.68 % Proof found!
% 0.21/5.68 % SZS status Unsatisfiable
% 0.21/5.68 % SZS output start CNFRefutation
% See solution above
% 0.21/5.68 % Parsed axioms : 92
% 0.21/5.68 % Removed by relevancy pruning/SinE : 0
% 0.21/5.68 % Initial clauses : 92
% 0.21/5.68 % Removed in clause preprocessing : 15
% 0.21/5.68 % Initial clauses in saturation : 77
% 0.21/5.68 % Processed clauses : 542
% 0.21/5.68 % ...of these trivial : 3
% 0.21/5.68 % ...subsumed : 111
% 0.21/5.68 % ...remaining for further processing : 428
% 0.21/5.68 % Other redundant clauses eliminated : 7
% 0.21/5.68 % Clauses deleted for lack of memory : 0
% 0.21/5.68 % Backward-subsumed : 13
% 0.21/5.68 % Backward-rewritten : 7
% 0.21/5.68 % Generated clauses : 1548
% 0.21/5.68 % ...of the previous two non-redundant : 1221
% 0.21/5.68 % ...aggressively subsumed : 0
% 0.21/5.68 % Contextual simplify-reflections : 0
% 0.21/5.68 % Paramodulations : 1537
% 0.21/5.68 % Factorizations : 4
% 0.21/5.68 % NegExts : 0
% 0.21/5.68 % Equation resolutions : 7
% 0.21/5.68 % Disequality decompositions : 0
% 0.21/5.68 % Total rewrite steps : 388
% 0.21/5.68 % ...of those cached : 297
% 0.21/5.68 % Propositional unsat checks : 0
% 0.21/5.68 % Propositional check models : 0
% 0.21/5.68 % Propositional check unsatisfiable : 0
% 0.21/5.68 % Propositional clauses : 0
% 0.21/5.68 % Propositional clauses after purity: 0
% 0.21/5.68 % Propositional unsat core size : 0
% 0.21/5.68 % Propositional preprocessing time : 0.000
% 0.21/5.68 % Propositional encoding time : 0.000
% 0.21/5.68 % Propositional solver time : 0.000
% 0.21/5.68 % Success case prop preproc time : 0.000
% 0.21/5.68 % Success case prop encoding time : 0.000
% 0.21/5.68 % Success case prop solver time : 0.000
% 0.21/5.68 % Current number of processed clauses : 329
% 0.21/5.68 % Positive orientable unit clauses : 74
% 0.21/5.68 % Positive unorientable unit clauses: 1
% 0.21/5.68 % Negative unit clauses : 30
% 0.21/5.68 % Non-unit-clauses : 224
% 0.21/5.68 % Current number of unprocessed clauses: 824
% 0.21/5.68 % ...number of literals in the above : 1708
% 0.21/5.68 % Current number of archived formulas : 0
% 0.21/5.68 % Current number of archived clauses : 111
% 0.21/5.68 % Clause-clause subsumption calls (NU) : 7339
% 0.21/5.68 % Rec. Clause-clause subsumption calls : 4718
% 0.21/5.68 % Non-unit clause-clause subsumptions : 98
% 0.21/5.68 % Unit Clause-clause subsumption calls : 855
% 0.21/5.68 % Rewrite failures with RHS unbound : 0
% 0.21/5.68 % BW rewrite match attempts : 27
% 0.21/5.68 % BW rewrite match successes : 8
% 0.21/5.68 % Condensation attempts : 0
% 0.21/5.68 % Condensation successes : 0
% 0.21/5.68 % Termbank termtop insertions : 31743
% 0.21/5.68 % Search garbage collected termcells : 156
% 0.21/5.68
% 0.21/5.68 % -------------------------------------------------
% 0.21/5.68 % User time : 0.091 s
% 0.21/5.68 % System time : 0.011 s
% 0.21/5.68 % Total time : 0.103 s
% 0.21/5.68 % Maximum resident set size: 3924 pages
% 0.21/5.68
% 0.21/5.68 % -------------------------------------------------
% 0.21/5.68 % User time : 0.278 s
% 0.21/5.68 % System time : 0.037 s
% 0.21/5.68 % Total time : 0.315 s
% 0.21/5.68 % Maximum resident set size: 4864 pages
% 0.21/5.68 % E exiting
%------------------------------------------------------------------------------