%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU142+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:28:13 PM UTC 2026
% Result : Theorem 0.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 75 ( 55 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 78 ( 26 ~; 40 |; 8 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-3 aty)
% Number of variables : 56 ( 3 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X2
| X4 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(t69_enumset1,conjecture,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(c_0_4,plain,
! [X15,X16,X17,X18,X19,X20,X21,X22] :
( ( X22 = unordered_pair(X20,X21)
| esk3_3(X20,X21,X22) = X21
| esk3_3(X20,X21,X22) = X20
| in(esk3_3(X20,X21,X22),X22) )
& ( X22 = unordered_pair(X20,X21)
| ~ in(esk3_3(X20,X21,X22),X22)
| esk3_3(X20,X21,X22) != X21 )
& ( X22 = unordered_pair(X20,X21)
| ~ in(esk3_3(X20,X21,X22),X22)
| esk3_3(X20,X21,X22) != X20 )
& ( X17 != unordered_pair(X15,X16)
| in(X19,X17)
| X19 != X16 )
& ( X17 != unordered_pair(X15,X16)
| in(X19,X17)
| X19 != X15 )
& ( X17 != unordered_pair(X15,X16)
| X18 = X16
| X18 = X15
| ~ in(X18,X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tarski])])])])])])]) ).
cnf(c_0_5,plain,
( X2 != unordered_pair(X3,X4)
| ~ in(X1,X2)
| X1 = X4
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X6,X7,X8,X9,X10,X11] :
( ( X11 = singleton(X10)
| esk2_2(X10,X11) = X10
| in(esk2_2(X10,X11),X11) )
& ( X11 = singleton(X10)
| esk2_2(X10,X11) != X10
| ~ in(esk2_2(X10,X11),X11) )
& ( X7 != singleton(X6)
| in(X9,X7)
| X9 != X6 )
& ( X7 != singleton(X6)
| X8 = X6
| ~ in(X8,X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tarski])])])])])])]) ).
cnf(c_0_7,plain,
( ~ in(X1,unordered_pair(X3,X2))
| X1 = X3
| X1 = X2 ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( X2 = singleton(X1)
| esk2_2(X1,X2) = X1
| in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( X3 != unordered_pair(X4,X2)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X13,X14] : unordered_pair(X13,X14) = unordered_pair(X14,X13),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_11,plain,
( unordered_pair(X2,X3) = singleton(X1)
| esk2_2(X1,unordered_pair(X2,X3)) = X3
| esk2_2(X1,unordered_pair(X2,X3)) = X2
| esk2_2(X1,unordered_pair(X2,X3)) = X1 ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_13,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] : unordered_pair(X1,X1) = singleton(X1),
inference(assume_negation,[status(cth)],[t69_enumset1]) ).
cnf(c_0_15,plain,
( esk2_2(X1,X2) != X1
| ~ in(esk2_2(X1,X2),X2)
| X2 = singleton(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( unordered_pair(X1,X2) = singleton(X1)
| esk2_2(X1,unordered_pair(X1,X2)) = X1
| esk2_2(X1,unordered_pair(X1,X2)) = X2 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_11])]) ).
cnf(c_0_17,plain,
in(X1,unordered_pair(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_18,negated_conjecture,
unordered_pair(esk1_0,esk1_0) != singleton(esk1_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_19,plain,
( unordered_pair(X1,X2) = singleton(X1)
| esk2_2(X1,unordered_pair(X1,X2)) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
unordered_pair(esk1_0,esk1_0) != singleton(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
unordered_pair(X1,X1) = singleton(X1),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_19]),c_0_12])])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU142+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n004.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 05:52:34 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 0.11/0.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % new_bool_3 with pid 2384902 completed with status 0
% 0.11/0.43 % Result found by new_bool_3
% 0.11/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.43 % Search class: FGHSF-FFSF32-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % SubtermCWHack with pid 2384910 completed with status 0
% 0.11/0.43 % Result found by SubtermCWHack
% 0.11/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.43 % Search class: FGHSF-FFSF32-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % Preprocessing time : 0.001 s
% 0.11/0.43
% 0.11/0.43 % Proof found!
% 0.11/0.43 % SZS status Theorem
% 0.11/0.43 % SZS output start CNFRefutation
% See solution above
% 0.11/0.43 % Parsed axioms : 8
% 0.11/0.43 % Removed by relevancy pruning/SinE : 2
% 0.11/0.43 % Initial clauses : 15
% 0.11/0.43 % Removed in clause preprocessing : 0
% 0.11/0.43 % Initial clauses in saturation : 15
% 0.11/0.43 % Processed clauses : 69
% 0.11/0.43 % ...of these trivial : 2
% 0.11/0.43 % ...subsumed : 21
% 0.11/0.43 % ...remaining for further processing : 46
% 0.11/0.43 % Other redundant clauses eliminated : 26
% 0.11/0.43 % Clauses deleted for lack of memory : 0
% 0.11/0.43 % Backward-subsumed : 1
% 0.11/0.43 % Backward-rewritten : 1
% 0.11/0.43 % Generated clauses : 185
% 0.11/0.43 % ...of the previous two non-redundant : 102
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 0
% 0.11/0.43 % Paramodulations : 148
% 0.11/0.43 % Factorizations : 14
% 0.11/0.43 % NegExts : 0
% 0.11/0.43 % Equation resolutions : 26
% 0.11/0.43 % Disequality decompositions : 0
% 0.11/0.43 % Total rewrite steps : 39
% 0.11/0.43 % ...of those cached : 31
% 0.11/0.43 % Propositional unsat checks : 0
% 0.11/0.43 % Propositional check models : 0
% 0.11/0.43 % Propositional check unsatisfiable : 0
% 0.11/0.43 % Propositional clauses : 0
% 0.11/0.43 % Propositional clauses after purity: 0
% 0.11/0.43 % Propositional unsat core size : 0
% 0.11/0.43 % Propositional preprocessing time : 0.000
% 0.11/0.43 % Propositional encoding time : 0.000
% 0.11/0.43 % Propositional solver time : 0.000
% 0.11/0.43 % Success case prop preproc time : 0.000
% 0.11/0.43 % Success case prop encoding time : 0.000
% 0.11/0.43 % Success case prop solver time : 0.000
% 0.11/0.43 % Current number of processed clauses : 39
% 0.11/0.43 % Positive orientable unit clauses : 3
% 0.11/0.43 % Positive unorientable unit clauses: 2
% 0.11/0.43 % Negative unit clauses : 3
% 0.11/0.43 % Non-unit-clauses : 31
% 0.11/0.43 % Current number of unprocessed clauses: 48
% 0.11/0.43 % ...number of literals in the above : 178
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 2
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 145
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 99
% 0.11/0.43 % Non-unit clause-clause subsumptions : 8
% 0.11/0.43 % Unit Clause-clause subsumption calls : 3
% 0.11/0.43 % Rewrite failures with RHS unbound : 0
% 0.11/0.43 % BW rewrite match attempts : 13
% 0.11/0.43 % BW rewrite match successes : 8
% 0.11/0.43 % Condensation attempts : 0
% 0.11/0.43 % Condensation successes : 0
% 0.11/0.43 % Termbank termtop insertions : 3016
% 0.11/0.43 % Search garbage collected termcells : 345
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.007 s
% 0.11/0.43 % System time : 0.003 s
% 0.11/0.43 % Total time : 0.010 s
% 0.11/0.43 % Maximum resident set size: 3632 pages
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.010 s
% 0.11/0.43 % System time : 0.006 s
% 0.11/0.43 % Total time : 0.016 s
% 0.11/0.43 % Maximum resident set size: 4608 pages
% 0.11/0.43 % E exiting
%------------------------------------------------------------------------------