%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU229+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:38 PM UTC 2026
% Result : Theorem 1.58s 0.95s
% Output : CNFRefutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 12 unt; 0 def)
% Number of atoms : 103 ( 50 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 123 ( 52 ~; 46 |; 21 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 95 ( 16 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_enumset1,axiom,
! [X1,X2,X3,X4] :
( X4 = unordered_triple(X1,X2,X3)
<=> ! [X5] :
( in(X5,X4)
<=> ~ ( X5 != X3
& X5 != X2
& X5 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_enumset1) ).
fof(t7_tarski,axiom,
! [X1,X2] :
~ ( ! [X3] :
~ ( ! [X4] :
~ ( in(X4,X3)
& in(X4,X2) )
& in(X3,X2) )
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_tarski) ).
fof(t3_ordinal1,conjecture,
! [X1,X2,X3] :
~ ( in(X3,X1)
& in(X2,X3)
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_ordinal1) ).
fof(c_0_3,plain,
! [X1,X2,X3,X4] :
( X4 = unordered_triple(X1,X2,X3)
<=> ! [X5] :
( in(X5,X4)
<=> ~ ( X5 != X3
& X5 != X2
& X5 != X1 ) ) ),
inference(fof_simplification,[status(thm)],[d1_enumset1]) ).
fof(c_0_4,plain,
! [X11,X12,X13,X14,X15,X16,X17,X18,X19,X20] :
( ( X20 = unordered_triple(X17,X18,X19)
| esk1_4(X17,X18,X19,X20) = X19
| esk1_4(X17,X18,X19,X20) = X18
| esk1_4(X17,X18,X19,X20) = X17
| in(esk1_4(X17,X18,X19,X20),X20) )
& ( X20 = unordered_triple(X17,X18,X19)
| ~ in(esk1_4(X17,X18,X19,X20),X20)
| esk1_4(X17,X18,X19,X20) != X19 )
& ( X20 = unordered_triple(X17,X18,X19)
| ~ in(esk1_4(X17,X18,X19,X20),X20)
| esk1_4(X17,X18,X19,X20) != X18 )
& ( X20 = unordered_triple(X17,X18,X19)
| ~ in(esk1_4(X17,X18,X19,X20),X20)
| esk1_4(X17,X18,X19,X20) != X17 )
& ( X14 != unordered_triple(X11,X12,X13)
| in(X16,X14)
| X16 != X13 )
& ( X14 != unordered_triple(X11,X12,X13)
| in(X16,X14)
| X16 != X12 )
& ( X14 != unordered_triple(X11,X12,X13)
| in(X16,X14)
| X16 != X11 )
& ( X14 != unordered_triple(X11,X12,X13)
| X15 = X13
| X15 = X12
| X15 = X11
| ~ in(X15,X14) ) ),
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)],[c_0_3])])])])])])]) ).
fof(c_0_5,plain,
! [X43,X44,X46] :
( ( ~ in(X43,X44)
| ~ in(X46,esk15_2(X43,X44))
| ~ in(X46,X44) )
& ( ~ in(X43,X44)
| in(esk15_2(X43,X44),X44) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_tarski])])])])])]) ).
cnf(c_0_6,plain,
( X3 != unordered_triple(X4,X2,X5)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ~ in(X3,X2)
| ~ in(X1,esk15_2(X3,X2))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
in(X1,unordered_triple(X2,X1,X3)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])]) ).
cnf(c_0_9,plain,
( X2 != unordered_triple(X3,X4,X5)
| ~ in(X1,X2)
| X1 = X5
| X1 = X4
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( ~ in(X1,X2)
| in(esk15_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( ~ in(X1,unordered_triple(X3,X2,X4))
| ~ in(X1,esk15_2(X2,unordered_triple(X3,X2,X4))) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( ~ in(X1,unordered_triple(X4,X3,X2))
| X1 = X4
| X1 = X3
| X1 = X2 ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
in(esk15_2(X1,unordered_triple(X2,X1,X3)),unordered_triple(X2,X1,X3)),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( in(X3,X1)
& in(X2,X3)
& in(X1,X2) ),
inference(assume_negation,[status(cth)],[t3_ordinal1]) ).
cnf(c_0_15,plain,
( X3 != unordered_triple(X2,X4,X5)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
~ in(X1,esk15_2(X1,unordered_triple(X2,X1,X3))),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_17,plain,
( esk15_2(X1,unordered_triple(X2,X1,X3)) = X2
| esk15_2(X1,unordered_triple(X2,X1,X3)) = X1
| esk15_2(X1,unordered_triple(X2,X1,X3)) = X3 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_18,negated_conjecture,
( in(esk14_0,esk12_0)
& in(esk13_0,esk14_0)
& in(esk12_0,esk13_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_19,plain,
in(X1,unordered_triple(X1,X2,X3)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_15])]) ).
cnf(c_0_20,plain,
( ~ in(X1,X2)
| esk15_2(X1,unordered_triple(X2,X1,X3)) = X3
| esk15_2(X1,unordered_triple(X2,X1,X3)) = X1 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
in(esk14_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( X3 != unordered_triple(X4,X5,X2)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_23,plain,
~ in(X1,esk15_2(X2,unordered_triple(X1,X2,X3))),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( esk15_2(esk14_0,unordered_triple(esk12_0,esk14_0,X1)) = X1
| esk15_2(esk14_0,unordered_triple(esk12_0,esk14_0,X1)) = esk14_0 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
in(X1,unordered_triple(X2,X3,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])]) ).
cnf(c_0_26,negated_conjecture,
( ~ in(esk12_0,X1)
| esk15_2(esk14_0,unordered_triple(esk12_0,esk14_0,X1)) = esk14_0 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
in(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
~ in(X1,esk15_2(X2,unordered_triple(X3,X2,X1))),
inference(spm,[status(thm)],[c_0_11,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
esk15_2(esk14_0,unordered_triple(esk12_0,esk14_0,esk13_0)) = esk14_0,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
in(esk13_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU229+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n004.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 06:01:05 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.28/0.52 Running first-order theorem proving
% 0.28/0.52 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
% 1.58/0.95 % Version: 3.5.1
% 1.58/0.95 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.58/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.58/0.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.58/0.95 % Starting new_bool_3 with 300s (1) cores
% 1.58/0.95 % Starting new_bool_1 with 300s (1) cores
% 1.58/0.95 % Starting sh5l with 300s (1) cores
% 1.58/0.95 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2402723 completed with status 0
% 1.58/0.95 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.58/0.95 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.58/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.58/0.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.58/0.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.58/0.95 % No SInE strategy applied
% 1.58/0.95 % Search class: FGHSF-FFMM32-SFFFFFNN
% 1.58/0.95 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.58/0.95 % Starting SubtermCWHack with 136s (1) cores
% 1.58/0.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.58/0.95 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 1.58/0.95 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 1.58/0.95 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 1.58/0.95 % G-E--_208_C18_F1_SE_CS_SP_PS_S2g with pid 2402730 completed with status 0
% 1.58/0.95 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2g
% 1.58/0.95 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.58/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.58/0.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.58/0.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.58/0.95 % No SInE strategy applied
% 1.58/0.95 % Search class: FGHSF-FFMM32-SFFFFFNN
% 1.58/0.95 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.58/0.95 % Starting SubtermCWHack with 136s (1) cores
% 1.58/0.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.58/0.95 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 1.58/0.95 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 1.58/0.95 % Preprocessing time : 0.002 s
% 1.58/0.95 % Presaturation interreduction done
% 1.58/0.95
% 1.58/0.95 % Proof found!
% 1.58/0.95 % SZS status Theorem
% 1.58/0.95 % SZS output start CNFRefutation
% See solution above
% 1.58/0.95 % Parsed axioms : 28
% 1.58/0.95 % Removed by relevancy pruning/SinE : 0
% 1.58/0.95 % Initial clauses : 53
% 1.58/0.95 % Removed in clause preprocessing : 5
% 1.58/0.95 % Initial clauses in saturation : 48
% 1.58/0.95 % Processed clauses : 2311
% 1.58/0.95 % ...of these trivial : 4
% 1.58/0.95 % ...subsumed : 1543
% 1.58/0.95 % ...remaining for further processing : 764
% 1.58/0.95 % Other redundant clauses eliminated : 576
% 1.58/0.95 % Clauses deleted for lack of memory : 0
% 1.58/0.95 % Backward-subsumed : 28
% 1.58/0.95 % Backward-rewritten : 6
% 1.58/0.95 % Generated clauses : 6285
% 1.58/0.95 % ...of the previous two non-redundant : 5265
% 1.58/0.95 % ...aggressively subsumed : 0
% 1.58/0.95 % Contextual simplify-reflections : 6
% 1.58/0.95 % Paramodulations : 5338
% 1.58/0.95 % Factorizations : 374
% 1.58/0.95 % NegExts : 0
% 1.58/0.95 % Equation resolutions : 576
% 1.58/0.95 % Disequality decompositions : 0
% 1.58/0.95 % Total rewrite steps : 1762
% 1.58/0.95 % ...of those cached : 1475
% 1.58/0.95 % Propositional unsat checks : 0
% 1.58/0.95 % Propositional check models : 0
% 1.58/0.95 % Propositional check unsatisfiable : 0
% 1.58/0.95 % Propositional clauses : 0
% 1.58/0.95 % Propositional clauses after purity: 0
% 1.58/0.95 % Propositional unsat core size : 0
% 1.58/0.95 % Propositional preprocessing time : 0.000
% 1.58/0.95 % Propositional encoding time : 0.000
% 1.58/0.95 % Propositional solver time : 0.000
% 1.58/0.95 % Success case prop preproc time : 0.000
% 1.58/0.95 % Success case prop encoding time : 0.000
% 1.58/0.95 % Success case prop solver time : 0.000
% 1.58/0.95 % Current number of processed clauses : 681
% 1.58/0.95 % Positive orientable unit clauses : 107
% 1.58/0.95 % Positive unorientable unit clauses: 0
% 1.58/0.95 % Negative unit clauses : 410
% 1.58/0.95 % Non-unit-clauses : 164
% 1.58/0.95 % Current number of unprocessed clauses: 3032
% 1.58/0.95 % ...number of literals in the above : 11397
% 1.58/0.95 % Current number of archived formulas : 0
% 1.58/0.95 % Current number of archived clauses : 79
% 1.58/0.95 % Clause-clause subsumption calls (NU) : 7240
% 1.58/0.95 % Rec. Clause-clause subsumption calls : 1595
% 1.58/0.95 % Non-unit clause-clause subsumptions : 81
% 1.58/0.95 % Unit Clause-clause subsumption calls : 49855
% 1.58/0.95 % Rewrite failures with RHS unbound : 0
% 1.58/0.95 % BW rewrite match attempts : 298
% 1.58/0.95 % BW rewrite match successes : 3
% 1.58/0.95 % Condensation attempts : 0
% 1.58/0.95 % Condensation successes : 0
% 1.58/0.95 % Termbank termtop insertions : 101282
% 1.58/0.95 % Search garbage collected termcells : 471
% 1.58/0.95
% 1.58/0.95 % -------------------------------------------------
% 1.58/0.95 % User time : 0.276 s
% 1.58/0.95 % System time : 0.018 s
% 1.58/0.95 % Total time : 0.294 s
% 1.58/0.95 % Maximum resident set size: 3648 pages
% 1.58/0.95
% 1.58/0.95 % -------------------------------------------------
% 1.58/0.95 % User time : 1.414 s
% 1.58/0.95 % System time : 0.066 s
% 1.58/0.95 % Total time : 1.481 s
% 1.58/0.95 % Maximum resident set size: 4864 pages
% 1.58/0.95 % E exiting
%------------------------------------------------------------------------------