%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET096-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 : n006.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:33 PM UTC 2026
% Result : Unsatisfiable 3.07s 0.96s
% Output : CNFRefutation 3.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 37 ( 16 unt; 9 nHn; 29 RR)
% Number of literals : 68 ( 25 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 47 ( 0 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(prove_two_subsets_of_singleton_1,negated_conjecture,
subclass(x,singleton(y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_two_subsets_of_singleton_1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
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(prove_two_subsets_of_singleton_3,negated_conjecture,
singleton(y) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_two_subsets_of_singleton_3) ).
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(prove_two_subsets_of_singleton_2,negated_conjecture,
x != null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_two_subsets_of_singleton_2) ).
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(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(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(c_0_10,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_11,negated_conjecture,
subclass(x,singleton(y)),
prove_two_subsets_of_singleton_1 ).
cnf(c_0_12,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_13,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_14,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_10 ).
cnf(c_0_15,negated_conjecture,
subclass(x,unordered_pair(y,y)),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
singleton(y) != x,
inference(fof_simplification,[status(thm)],[prove_two_subsets_of_singleton_3]) ).
cnf(c_0_17,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_13 ).
cnf(c_0_18,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_19,negated_conjecture,
( ~ member(X1,x)
| member(X1,unordered_pair(y,y)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
x != null_class,
inference(fof_simplification,[status(thm)],[prove_two_subsets_of_singleton_2]) ).
cnf(c_0_21,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_22,negated_conjecture,
singleton(y) != x,
c_0_16 ).
cnf(c_0_23,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_24,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_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( ~ member(X1,x)
| X1 = y ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_26,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_27,negated_conjecture,
x != null_class,
c_0_20 ).
cnf(c_0_28,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_21 ).
cnf(c_0_29,negated_conjecture,
unordered_pair(y,y) != x,
inference(rw,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_30,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_23 ).
cnf(c_0_31,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_24])]) ).
cnf(c_0_32,negated_conjecture,
regular(x) = y,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_33,negated_conjecture,
~ subclass(unordered_pair(y,y),x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_15]),c_0_29]) ).
cnf(c_0_34,plain,
( ~ member(X1,X2)
| subclass(unordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
member(y,x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_32]),c_0_27]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET096-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n006.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 04:51:57 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.52 Running first-order theorem proving
% 0.26/0.52 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
% 3.07/0.96 % Version: 3.5.1
% 3.07/0.96 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.07/0.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.07/0.96 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.07/0.96 % Starting new_bool_3 with 300s (1) cores
% 3.07/0.96 % Starting new_bool_1 with 300s (1) cores
% 3.07/0.96 % Starting sh5l with 300s (1) cores
% 3.07/0.96 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2039730 completed with status 0
% 3.07/0.96 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.07/0.96 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.07/0.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.07/0.96 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.07/0.96 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.07/0.96 % No SInE strategy applied
% 3.07/0.96 % Search class: FGHSM-FFLM31-DFFFFFNN
% 3.07/0.96 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.07/0.96 % Starting SubtermCWHack with 136s (1) cores
% 3.07/0.96 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.07/0.96 % Starting new_bool_3 with 311s (1) cores
% 3.07/0.96 % Starting new_bool_1 with 308s (1) cores
% 3.07/0.96 % Starting sh5l with 304s (1) cores
% 3.07/0.96 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2039738 completed with status 0
% 3.07/0.96 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.07/0.96 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.07/0.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.07/0.96 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.07/0.96 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.07/0.96 % No SInE strategy applied
% 3.07/0.96 % Search class: FGHSM-FFLM31-DFFFFFNN
% 3.07/0.96 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.07/0.96 % Starting SubtermCWHack with 136s (1) cores
% 3.07/0.96 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.07/0.96 % Preprocessing time : 0.002 s
% 3.07/0.96 % Presaturation interreduction done
% 3.07/0.96
% 3.07/0.96 % Proof found!
% 3.07/0.96 % SZS status Unsatisfiable
% 3.07/0.96 % SZS output start CNFRefutation
% See solution above
% 3.07/0.97 % Parsed axioms : 94
% 3.07/0.97 % Removed by relevancy pruning/SinE : 0
% 3.07/0.97 % Initial clauses : 94
% 3.07/0.97 % Removed in clause preprocessing : 15
% 3.07/0.97 % Initial clauses in saturation : 79
% 3.07/0.97 % Processed clauses : 3704
% 3.07/0.97 % ...of these trivial : 18
% 3.07/0.97 % ...subsumed : 2526
% 3.07/0.97 % ...remaining for further processing : 1160
% 3.07/0.97 % Other redundant clauses eliminated : 13
% 3.07/0.97 % Clauses deleted for lack of memory : 0
% 3.07/0.97 % Backward-subsumed : 88
% 3.07/0.97 % Backward-rewritten : 101
% 3.07/0.97 % Generated clauses : 14164
% 3.07/0.97 % ...of the previous two non-redundant : 12099
% 3.07/0.97 % ...aggressively subsumed : 0
% 3.07/0.97 % Contextual simplify-reflections : 12
% 3.07/0.97 % Paramodulations : 14138
% 3.07/0.97 % Factorizations : 13
% 3.07/0.97 % NegExts : 0
% 3.07/0.97 % Equation resolutions : 13
% 3.07/0.97 % Disequality decompositions : 0
% 3.07/0.97 % Total rewrite steps : 3724
% 3.07/0.97 % ...of those cached : 3481
% 3.07/0.97 % Propositional unsat checks : 0
% 3.07/0.97 % Propositional check models : 0
% 3.07/0.97 % Propositional check unsatisfiable : 0
% 3.07/0.97 % Propositional clauses : 0
% 3.07/0.97 % Propositional clauses after purity: 0
% 3.07/0.97 % Propositional unsat core size : 0
% 3.07/0.97 % Propositional preprocessing time : 0.000
% 3.07/0.97 % Propositional encoding time : 0.000
% 3.07/0.97 % Propositional solver time : 0.000
% 3.07/0.97 % Success case prop preproc time : 0.000
% 3.07/0.97 % Success case prop encoding time : 0.000
% 3.07/0.97 % Success case prop solver time : 0.000
% 3.07/0.97 % Current number of processed clauses : 890
% 3.07/0.97 % Positive orientable unit clauses : 74
% 3.07/0.97 % Positive unorientable unit clauses: 1
% 3.07/0.97 % Negative unit clauses : 18
% 3.07/0.97 % Non-unit-clauses : 797
% 3.07/0.97 % Current number of unprocessed clauses: 8297
% 3.07/0.97 % ...number of literals in the above : 28336
% 3.07/0.97 % Current number of archived formulas : 0
% 3.07/0.97 % Current number of archived clauses : 282
% 3.07/0.97 % Clause-clause subsumption calls (NU) : 116276
% 3.07/0.97 % Rec. Clause-clause subsumption calls : 77446
% 3.07/0.97 % Non-unit clause-clause subsumptions : 1983
% 3.07/0.97 % Unit Clause-clause subsumption calls : 3934
% 3.07/0.97 % Rewrite failures with RHS unbound : 0
% 3.07/0.97 % BW rewrite match attempts : 140
% 3.07/0.97 % BW rewrite match successes : 51
% 3.07/0.97 % Condensation attempts : 0
% 3.07/0.97 % Condensation successes : 0
% 3.07/0.97 % Termbank termtop insertions : 421644
% 3.07/0.97 % Search garbage collected termcells : 158
% 3.07/0.97
% 3.07/0.97 % -------------------------------------------------
% 3.07/0.97 % User time : 0.395 s
% 3.07/0.97 % System time : 0.012 s
% 3.07/0.97 % Total time : 0.408 s
% 3.07/0.97 % Maximum resident set size: 3720 pages
% 3.07/0.97
% 3.07/0.97 % -------------------------------------------------
% 3.07/0.97 % User time : 1.946 s
% 3.07/0.97 % System time : 0.086 s
% 3.07/0.97 % Total time : 2.032 s
% 3.07/0.97 % Maximum resident set size: 4864 pages
% 3.07/0.97 % E exiting
%------------------------------------------------------------------------------