%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET085-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 : 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:28 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.44s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 38 ( 18 unt; 5 nHn; 25 RR)
% Number of literals : 60 ( 25 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 38 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(only_member_in_singleton,axiom,
( ~ member(X1,singleton(X2))
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',only_member_in_singleton) ).
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(prove_singleton_in_unordered_pair3_1,negated_conjecture,
unordered_pair(y,z) = singleton(x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(prove_singleton_in_unordered_pair3_4,negated_conjecture,
x != z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_4) ).
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(unordered_pair_equals_singleton1,axiom,
( unordered_pair(X2,X1) = singleton(X2)
| member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_equals_singleton1) ).
cnf(prove_singleton_in_unordered_pair3_3,negated_conjecture,
x != y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_3) ).
cnf(corollary_to_unordered_pair_axiom2,axiom,
( unordered_pair(X2,X1) != null_class
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_to_unordered_pair_axiom2) ).
cnf(null_unordered_pair,axiom,
( member(X2,universal_class)
| member(X1,universal_class)
| unordered_pair(X1,X2) = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_unordered_pair) ).
cnf(prove_singleton_in_unordered_pair3_2,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_2) ).
cnf(c_0_11,plain,
( ~ member(X1,singleton(X2))
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[only_member_in_singleton]) ).
cnf(c_0_12,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_13,negated_conjecture,
unordered_pair(y,z) = singleton(x),
prove_singleton_in_unordered_pair3_1 ).
cnf(c_0_14,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_15,plain,
( ~ member(X1,singleton(X2))
| X1 = X2 ),
c_0_11 ).
cnf(c_0_16,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
unordered_pair(y,z) = unordered_pair(x,x),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
x != z,
inference(fof_simplification,[status(thm)],[prove_singleton_in_unordered_pair3_4]) ).
cnf(c_0_19,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_20,axiom,
( unordered_pair(X2,X1) = singleton(X2)
| member(X1,universal_class) ),
unordered_pair_equals_singleton1 ).
cnf(c_0_21,plain,
( ~ member(X1,unordered_pair(X2,X2))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( ~ member(z,universal_class)
| member(z,unordered_pair(x,x)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
x != z,
c_0_18 ).
cnf(c_0_24,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
x != y,
inference(fof_simplification,[status(thm)],[prove_singleton_in_unordered_pair3_3]) ).
cnf(c_0_26,plain,
( member(X2,universal_class)
| unordered_pair(X1,X1) = unordered_pair(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
~ member(z,universal_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(y,universal_class)
| member(y,unordered_pair(x,x)) ),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_29,negated_conjecture,
x != y,
c_0_25 ).
cnf(c_0_30,plain,
( unordered_pair(X2,X1) != null_class
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[corollary_to_unordered_pair_axiom2]) ).
cnf(c_0_31,axiom,
( member(X2,universal_class)
| member(X1,universal_class)
| unordered_pair(X1,X2) = null_class ),
null_unordered_pair ).
cnf(c_0_32,negated_conjecture,
unordered_pair(y,y) = unordered_pair(x,x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_26]),c_0_27]) ).
cnf(c_0_33,negated_conjecture,
~ member(y,universal_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_28]),c_0_29]) ).
cnf(c_0_34,plain,
( unordered_pair(X2,X1) != null_class
| ~ member(X1,universal_class) ),
c_0_30 ).
cnf(c_0_35,negated_conjecture,
unordered_pair(x,x) = null_class,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_36,negated_conjecture,
member(x,universal_class),
prove_singleton_in_unordered_pair3_2 ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET085-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 04:52:31 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.44 % Version: 3.5.1
% 0.09/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.44 % Starting sh5l with 300s (1) cores
% 0.09/0.44 % new_bool_3 with pid 3448077 completed with status 0
% 0.09/0.44 % Result found by new_bool_3
% 0.09/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.44 % Search class: FGHSM-FFMS21-MFFFFFNN
% 0.09/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.44 % SubtermCWHack with pid 3448082 completed with status 0
% 0.09/0.44 % Result found by SubtermCWHack
% 0.09/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.44 % Search class: FGHSM-FFMS21-MFFFFFNN
% 0.09/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.44 % Preprocessing time : 0.001 s
% 0.09/0.44
% 0.09/0.44 % Proof found!
% 0.09/0.44 % SZS status Unsatisfiable
% 0.09/0.44 % SZS output start CNFRefutation
% See solution above
% 0.09/0.44 % Parsed axioms : 132
% 0.09/0.44 % Removed by relevancy pruning/SinE : 83
% 0.09/0.44 % Initial clauses : 49
% 0.09/0.44 % Removed in clause preprocessing : 0
% 0.09/0.44 % Initial clauses in saturation : 49
% 0.09/0.44 % Processed clauses : 217
% 0.09/0.44 % ...of these trivial : 16
% 0.09/0.44 % ...subsumed : 103
% 0.09/0.44 % ...remaining for further processing : 98
% 0.09/0.44 % Other redundant clauses eliminated : 2
% 0.09/0.44 % Clauses deleted for lack of memory : 0
% 0.09/0.44 % Backward-subsumed : 7
% 0.09/0.44 % Backward-rewritten : 6
% 0.09/0.44 % Generated clauses : 859
% 0.09/0.44 % ...of the previous two non-redundant : 480
% 0.09/0.44 % ...aggressively subsumed : 0
% 0.09/0.44 % Contextual simplify-reflections : 0
% 0.09/0.44 % Paramodulations : 856
% 0.09/0.44 % Factorizations : 0
% 0.09/0.44 % NegExts : 0
% 0.09/0.44 % Equation resolutions : 3
% 0.09/0.44 % Disequality decompositions : 0
% 0.09/0.44 % Total rewrite steps : 410
% 0.09/0.44 % ...of those cached : 332
% 0.09/0.44 % Propositional unsat checks : 0
% 0.09/0.44 % Propositional check models : 0
% 0.09/0.44 % Propositional check unsatisfiable : 0
% 0.09/0.44 % Propositional clauses : 0
% 0.09/0.44 % Propositional clauses after purity: 0
% 0.09/0.44 % Propositional unsat core size : 0
% 0.09/0.44 % Propositional preprocessing time : 0.000
% 0.09/0.44 % Propositional encoding time : 0.000
% 0.09/0.44 % Propositional solver time : 0.000
% 0.09/0.44 % Success case prop preproc time : 0.000
% 0.09/0.44 % Success case prop encoding time : 0.000
% 0.09/0.44 % Success case prop solver time : 0.000
% 0.09/0.44 % Current number of processed clauses : 83
% 0.09/0.44 % Positive orientable unit clauses : 32
% 0.09/0.44 % Positive unorientable unit clauses: 2
% 0.09/0.44 % Negative unit clauses : 6
% 0.09/0.44 % Non-unit-clauses : 43
% 0.09/0.44 % Current number of unprocessed clauses: 296
% 0.09/0.44 % ...number of literals in the above : 722
% 0.09/0.44 % Current number of archived formulas : 0
% 0.09/0.44 % Current number of archived clauses : 13
% 0.09/0.44 % Clause-clause subsumption calls (NU) : 253
% 0.09/0.44 % Rec. Clause-clause subsumption calls : 234
% 0.09/0.44 % Non-unit clause-clause subsumptions : 93
% 0.09/0.44 % Unit Clause-clause subsumption calls : 54
% 0.09/0.44 % Rewrite failures with RHS unbound : 0
% 0.09/0.44 % BW rewrite match attempts : 26
% 0.09/0.44 % BW rewrite match successes : 13
% 0.09/0.44 % Condensation attempts : 0
% 0.09/0.44 % Condensation successes : 0
% 0.09/0.44 % Termbank termtop insertions : 7892
% 0.09/0.44 % Search garbage collected termcells : 459
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.007 s
% 0.09/0.44 % System time : 0.003 s
% 0.09/0.44 % Total time : 0.010 s
% 0.09/0.44 % Maximum resident set size: 3684 pages
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.011 s
% 0.09/0.44 % System time : 0.007 s
% 0.09/0.44 % Total time : 0.018 s
% 0.09/0.44 % Maximum resident set size: 4864 pages
% 0.09/0.44 % E exiting
%------------------------------------------------------------------------------