%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU229+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 : n011.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:24:21 PM UTC 2026
% Result : Theorem 0.96s 0.59s
% Output : CNFRefutation 0.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 7 unt; 0 def)
% Number of atoms : 112 ( 55 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 138 ( 57 ~; 56 |; 21 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 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 : 92 ( 12 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/sandbox/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/sandbox/benchmark/theBenchmark.p',t7_tarski) ).
fof(t3_ordinal1,conjecture,
! [X1,X2,X3] :
~ ( in(X3,X1)
& in(X2,X3)
& in(X1,X2) ),
file('/export/starexec/sandbox/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])])])])])])]) ).
cnf(c_0_5,plain,
( X2 != unordered_triple(X3,X4,X5)
| ~ in(X1,X2)
| X1 = X5
| X1 = X4
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,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_7,plain,
( ~ in(X1,unordered_triple(X4,X3,X2))
| X1 = X4
| X1 = X3
| X1 = X2 ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ in(X1,X2)
| in(esk15_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( X3 != unordered_triple(X4,X5,X2)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( ~ in(X1,unordered_triple(X2,X3,X4))
| esk15_2(X1,unordered_triple(X2,X3,X4)) = X2
| esk15_2(X1,unordered_triple(X2,X3,X4)) = X3
| esk15_2(X1,unordered_triple(X2,X3,X4)) = X4 ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
in(X1,unordered_triple(X2,X3,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_12,plain,
( ~ in(X3,X2)
| ~ in(X1,esk15_2(X3,X2))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( esk15_2(X1,unordered_triple(X2,X3,X1)) = X1
| esk15_2(X1,unordered_triple(X2,X3,X1)) = X3
| esk15_2(X1,unordered_triple(X2,X3,X1)) = X2 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( X3 != unordered_triple(X2,X4,X5)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( in(X3,X1)
& in(X2,X3)
& in(X1,X2) ),
inference(assume_negation,[status(cth)],[t3_ordinal1]) ).
cnf(c_0_16,plain,
( ~ in(X4,X1)
| ~ in(X4,unordered_triple(X2,X3,X1))
| esk15_2(X1,unordered_triple(X2,X3,X1)) = X2
| esk15_2(X1,unordered_triple(X2,X3,X1)) = X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11])]) ).
cnf(c_0_17,plain,
in(X1,unordered_triple(X1,X2,X3)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_14])]) ).
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_15])])]) ).
cnf(c_0_19,plain,
( ~ in(X2,X1)
| esk15_2(X1,unordered_triple(X2,X3,X1)) = X3
| esk15_2(X1,unordered_triple(X2,X3,X1)) = X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
in(esk14_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( esk15_2(esk12_0,unordered_triple(esk14_0,X1,esk12_0)) = X1
| esk15_2(esk12_0,unordered_triple(esk14_0,X1,esk12_0)) = esk14_0 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
( X3 != unordered_triple(X4,X2,X5)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_23,negated_conjecture,
( ~ in(X2,esk14_0)
| ~ in(X2,unordered_triple(esk14_0,X1,esk12_0))
| esk15_2(esk12_0,unordered_triple(esk14_0,X1,esk12_0)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_11])]) ).
cnf(c_0_24,plain,
in(X1,unordered_triple(X2,X1,X3)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
( ~ in(X1,esk14_0)
| esk15_2(esk12_0,unordered_triple(esk14_0,X1,esk12_0)) = X1 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( ~ in(X1,X2)
| ~ in(X2,esk14_0)
| ~ in(X1,unordered_triple(esk14_0,X2,esk12_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_25]),c_0_11])]) ).
cnf(c_0_27,negated_conjecture,
( ~ in(esk12_0,X1)
| ~ in(X1,esk14_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_11]) ).
cnf(c_0_28,negated_conjecture,
in(esk13_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,negated_conjecture,
in(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU229+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n011.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 06:01:11 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.42 Running first-order theorem proving
% 0.11/0.42 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.96/0.59 % Version: 3.5.1
% 0.96/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.96/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.96/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.96/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.96/0.59 % Starting sh5l with 300s (1) cores
% 0.96/0.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1128391 completed with status 0
% 0.96/0.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.96/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.96/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.96/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.96/0.59 % No SInE strategy applied
% 0.96/0.59 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.96/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.96/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.96/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.96/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.96/0.59 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.96/0.59 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.96/0.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1128399 completed with status 0
% 0.96/0.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.96/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.96/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.96/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.96/0.59 % No SInE strategy applied
% 0.96/0.59 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.96/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.96/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.96/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.96/0.59 % Preprocessing time : 0.001 s
% 0.96/0.59 % Presaturation interreduction done
% 0.96/0.59
% 0.96/0.59 % Proof found!
% 0.96/0.59 % SZS status Theorem
% 0.96/0.59 % SZS output start CNFRefutation
% See solution above
% 0.96/0.59 % Parsed axioms : 28
% 0.96/0.59 % Removed by relevancy pruning/SinE : 0
% 0.96/0.59 % Initial clauses : 53
% 0.96/0.59 % Removed in clause preprocessing : 5
% 0.96/0.59 % Initial clauses in saturation : 48
% 0.96/0.59 % Processed clauses : 1863
% 0.96/0.59 % ...of these trivial : 14
% 0.96/0.59 % ...subsumed : 1195
% 0.96/0.59 % ...remaining for further processing : 654
% 0.96/0.59 % Other redundant clauses eliminated : 686
% 0.96/0.59 % Clauses deleted for lack of memory : 0
% 0.96/0.59 % Backward-subsumed : 70
% 0.96/0.59 % Backward-rewritten : 19
% 0.96/0.59 % Generated clauses : 10556
% 0.96/0.59 % ...of the previous two non-redundant : 9514
% 0.96/0.59 % ...aggressively subsumed : 0
% 0.96/0.59 % Contextual simplify-reflections : 14
% 0.96/0.59 % Paramodulations : 9398
% 0.96/0.59 % Factorizations : 475
% 0.96/0.59 % NegExts : 0
% 0.96/0.59 % Equation resolutions : 686
% 0.96/0.59 % Disequality decompositions : 0
% 0.96/0.59 % Total rewrite steps : 3971
% 0.96/0.59 % ...of those cached : 3719
% 0.96/0.59 % Propositional unsat checks : 0
% 0.96/0.59 % Propositional check models : 0
% 0.96/0.59 % Propositional check unsatisfiable : 0
% 0.96/0.59 % Propositional clauses : 0
% 0.96/0.59 % Propositional clauses after purity: 0
% 0.96/0.59 % Propositional unsat core size : 0
% 0.96/0.59 % Propositional preprocessing time : 0.000
% 0.96/0.59 % Propositional encoding time : 0.000
% 0.96/0.59 % Propositional solver time : 0.000
% 0.96/0.59 % Success case prop preproc time : 0.000
% 0.96/0.59 % Success case prop encoding time : 0.000
% 0.96/0.59 % Success case prop solver time : 0.000
% 0.96/0.59 % Current number of processed clauses : 516
% 0.96/0.59 % Positive orientable unit clauses : 42
% 0.96/0.59 % Positive unorientable unit clauses: 0
% 0.96/0.59 % Negative unit clauses : 62
% 0.96/0.59 % Non-unit-clauses : 412
% 0.96/0.59 % Current number of unprocessed clauses: 7559
% 0.96/0.59 % ...number of literals in the above : 36225
% 0.96/0.59 % Current number of archived formulas : 0
% 0.96/0.59 % Current number of archived clauses : 134
% 0.96/0.59 % Clause-clause subsumption calls (NU) : 67190
% 0.96/0.59 % Rec. Clause-clause subsumption calls : 32364
% 0.96/0.59 % Non-unit clause-clause subsumptions : 410
% 0.96/0.59 % Unit Clause-clause subsumption calls : 4324
% 0.96/0.59 % Rewrite failures with RHS unbound : 0
% 0.96/0.59 % BW rewrite match attempts : 29
% 0.96/0.59 % BW rewrite match successes : 8
% 0.96/0.59 % Condensation attempts : 0
% 0.96/0.59 % Condensation successes : 0
% 0.96/0.59 % Termbank termtop insertions : 213059
% 0.96/0.59 % Search garbage collected termcells : 471
% 0.96/0.59
% 0.96/0.59 % -------------------------------------------------
% 0.96/0.59 % User time : 0.144 s
% 0.96/0.59 % System time : 0.015 s
% 0.96/0.59 % Total time : 0.159 s
% 0.96/0.59 % Maximum resident set size: 3648 pages
% 0.96/0.59
% 0.96/0.59 % -------------------------------------------------
% 0.96/0.59 % User time : 0.662 s
% 0.96/0.59 % System time : 0.047 s
% 0.96/0.59 % Total time : 0.708 s
% 0.96/0.59 % Maximum resident set size: 4864 pages
% 0.96/0.59 % E exiting
%------------------------------------------------------------------------------