%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SEU234+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 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 : Sun Sep 27 08:45:31 AM UTC 2026
% Result : Theorem 0.13s 0.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 5
% Syntax : Number of formulae : 53 ( 7 unt; 0 def)
% Number of atoms : 190 ( 26 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 199 ( 62 ~; 91 |; 36 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 57 ( 0 sgn 38 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_ordinal1,axiom,
! [A] :
( epsilon_transitive(A)
<=> ! [B] :
( in(B,A)
=> subset(B,A) ) ),
file('theBenchmark.p',d2_ordinal1) ).
fof(d3_ordinal1,axiom,
! [A] :
( epsilon_connected(A)
<=> ! [B,C] :
~ ( ~ in(C,B)
& B != C
& ~ in(B,C)
& in(C,A)
& in(B,A) ) ),
file('theBenchmark.p',d3_ordinal1) ).
fof(d4_ordinal1,axiom,
! [A] :
( ordinal(A)
<=> ( epsilon_connected(A)
& epsilon_transitive(A) ) ),
file('theBenchmark.p',d4_ordinal1) ).
fof(t24_ordinal1,axiom,
! [A] :
( ordinal(A)
=> ! [B] :
( ordinal(B)
=> ~ ( ~ in(B,A)
& A != B
& ~ in(A,B) ) ) ),
file('theBenchmark.p',t24_ordinal1) ).
fof(t31_ordinal1,conjecture,
! [A] :
( ! [B] :
( in(B,A)
=> ( subset(B,A)
& ordinal(B) ) )
=> ordinal(A) ),
file('theBenchmark.p',t31_ordinal1) ).
fof(t31_ordinal1_neg,negated_conjecture,
~ ! [A] :
( ! [B] :
( in(B,A)
=> ( subset(B,A)
& ordinal(B) ) )
=> ordinal(A) ),
inference(assume_negation,[status(cth)],[t31_ordinal1]) ).
cnf(c_49,plain,
( ~ epsilon_connected(A)
| ~ epsilon_transitive(A)
| ordinal(A) ),
inference(clausify,[status(thm)],[d4_ordinal1]) ).
fof(nnf_8,plain,
! [A] :
( ( ? [B] :
( ~ subset(B,A)
& in(B,A) )
| epsilon_transitive(A) )
& ( ! [X0] :
( subset(X0,A)
| ~ in(X0,A) )
| ~ epsilon_transitive(A) ) ),
inference(fof_nnf,[status(thm)],[d2_ordinal1]) ).
fof(sk_d2_ordinal1_sk,plain,
! [A] :
( ( ( ~ subset(sK0(A),A)
& in(sK0(A),A) )
| epsilon_transitive(A) )
& ( ! [X0] :
( subset(X0,A)
| ~ in(X0,A) )
| ~ epsilon_transitive(A) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(B,sK0(A))],[nnf_8]) ).
fof(sk_d2_ordinal1,plain,
( ! [VAR_0] :
( ~ subset(sK0(VAR_0),VAR_0)
| epsilon_transitive(VAR_0) )
& ! [VAR_0] :
( in(sK0(VAR_0),VAR_0)
| epsilon_transitive(VAR_0) )
& ! [VAR_0,VAR_1] :
( subset(VAR_1,VAR_0)
| ~ in(VAR_1,VAR_0)
| ~ epsilon_transitive(VAR_0) ) ),
inference(cnf_transformation,[status(thm)],[sk_d2_ordinal1_sk]) ).
cnf(c_55,plain,
( ~ subset(sK0(A),A)
| epsilon_transitive(A) ),
inference(split_conjunct,[status(thm)],[sk_d2_ordinal1]) ).
cnf(c_56,plain,
( in(sK0(A),A)
| epsilon_transitive(A) ),
inference(split_conjunct,[status(thm)],[sk_d2_ordinal1]) ).
fof(nnf_40,plain,
? [A] :
( ~ ordinal(A)
& ! [B] :
( ( subset(B,A)
& ordinal(B) )
| ~ in(B,A) ) ),
inference(fof_nnf,[status(thm)],[t31_ordinal1_neg]) ).
fof(sk_t31_ordinal1_neg_sk,plain,
( ~ ordinal(sK1)
& ! [B] :
( ( subset(B,sK1)
& ordinal(B) )
| ~ in(B,sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(A,sK1)],[nnf_40]) ).
fof(sk_t31_ordinal1_neg,plain,
( ~ ordinal(sK1)
& ! [VAR_0] :
( subset(VAR_0,sK1)
| ~ in(VAR_0,sK1) )
& ! [VAR_0] :
( ordinal(VAR_0)
| ~ in(VAR_0,sK1) ) ),
inference(cnf_transformation,[status(thm)],[sk_t31_ordinal1_neg_sk]) ).
cnf(c_74,negated_conjecture,
~ ordinal(sK1),
inference(split_conjunct,[status(thm)],[sk_t31_ordinal1_neg]) ).
cnf(c_75,negated_conjecture,
( subset(A,sK1)
| ~ in(A,sK1) ),
inference(split_conjunct,[status(thm)],[sk_t31_ordinal1_neg]) ).
cnf(c_76,negated_conjecture,
( ordinal(A)
| ~ in(A,sK1) ),
inference(split_conjunct,[status(thm)],[sk_t31_ordinal1_neg]) ).
cnf(c_85,plain,
( in(B,A)
| B = A
| in(A,B)
| ~ ordinal(B)
| ~ ordinal(A) ),
inference(clausify,[status(thm)],[t24_ordinal1]) ).
fof(nnf_9,plain,
! [A] :
( ( ? [B,C] :
( ~ in(C,B)
& C != B
& ~ in(B,C)
& in(C,A)
& in(B,A) )
| epsilon_connected(A) )
& ( ! [X0,X1] :
( in(X1,X0)
| X1 = X0
| in(X0,X1)
| ~ in(X1,A)
| ~ in(X0,A) )
| ~ epsilon_connected(A) ) ),
inference(fof_nnf,[status(thm)],[d3_ordinal1]) ).
fof(sk_d3_ordinal1_sk,plain,
! [A] :
( ( ( ~ in(sK2(A),sK3(A))
& sK2(A) != sK3(A)
& ~ in(sK3(A),sK2(A))
& in(sK2(A),A)
& in(sK3(A),A) )
| epsilon_connected(A) )
& ( ! [X0,X1] :
( in(X1,X0)
| X1 = X0
| in(X0,X1)
| ~ in(X1,A)
| ~ in(X0,A) )
| ~ epsilon_connected(A) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK2]),skolemize(B,sK3(A)),skolemize(C,sK2(A))],[nnf_9]) ).
fof(sk_d3_ordinal1,plain,
( ! [VAR_0] :
( ~ in(sK2(VAR_0),sK3(VAR_0))
| epsilon_connected(VAR_0) )
& ! [VAR_0] :
( sK2(VAR_0) != sK3(VAR_0)
| epsilon_connected(VAR_0) )
& ! [VAR_0] :
( ~ in(sK3(VAR_0),sK2(VAR_0))
| epsilon_connected(VAR_0) )
& ! [VAR_0] :
( in(sK2(VAR_0),VAR_0)
| epsilon_connected(VAR_0) )
& ! [VAR_0] :
( in(sK3(VAR_0),VAR_0)
| epsilon_connected(VAR_0) )
& ! [VAR_0,VAR_1,VAR_2] :
( in(VAR_2,VAR_1)
| VAR_2 = VAR_1
| in(VAR_1,VAR_2)
| ~ in(VAR_2,VAR_0)
| ~ in(VAR_1,VAR_0)
| ~ epsilon_connected(VAR_0) ) ),
inference(cnf_transformation,[status(thm)],[sk_d3_ordinal1_sk]) ).
cnf(c_106,plain,
( ~ in(sK2(A),sK3(A))
| epsilon_connected(A) ),
inference(split_conjunct,[status(thm)],[sk_d3_ordinal1]) ).
cnf(c_107,plain,
( sK2(A) != sK3(A)
| epsilon_connected(A) ),
inference(split_conjunct,[status(thm)],[sk_d3_ordinal1]) ).
cnf(c_108,plain,
( ~ in(sK3(A),sK2(A))
| epsilon_connected(A) ),
inference(split_conjunct,[status(thm)],[sk_d3_ordinal1]) ).
cnf(c_109,plain,
( in(sK2(A),A)
| epsilon_connected(A) ),
inference(split_conjunct,[status(thm)],[sk_d3_ordinal1]) ).
cnf(c_110,plain,
( in(sK3(A),A)
| epsilon_connected(A) ),
inference(split_conjunct,[status(thm)],[sk_d3_ordinal1]) ).
cnf(c_119,plain,
( ~ epsilon_connected(A)
| ordinal(A)
| ~ subset(sK0(A),A) ),
inference(resolve,[status(thm)],[c_55,c_49]) ).
cnf(c_120,plain,
( ~ epsilon_connected(A)
| ordinal(A)
| in(sK0(A),A) ),
inference(resolve,[status(thm)],[c_56,c_49]) ).
cnf(c_149,plain,
( ordinal(sK2(sK1))
| epsilon_connected(sK1) ),
inference(resolve,[status(thm)],[c_109,c_76]) ).
cnf(c_154,plain,
( ordinal(sK3(sK1))
| epsilon_connected(sK1) ),
inference(resolve,[status(thm)],[c_110,c_76]) ).
cnf(c_514,plain,
( epsilon_connected(sK1)
| in(A,sK2(sK1))
| A = sK2(sK1)
| in(sK2(sK1),A)
| ~ ordinal(A) ),
inference(resolve,[status(thm)],[c_85,c_149]) ).
cnf(c_515,plain,
( epsilon_connected(sK1)
| epsilon_connected(sK1)
| in(sK3(sK1),sK2(sK1))
| sK3(sK1) = sK2(sK1)
| in(sK2(sK1),sK3(sK1)) ),
inference(resolve,[status(thm)],[c_514,c_154]) ).
cnf(c_516,plain,
( epsilon_connected(sK1)
| epsilon_connected(sK1)
| in(sK3(sK1),sK2(sK1))
| sK2(sK1) = sK3(sK1)
| in(sK2(sK1),sK3(sK1)) ),
inference(copy,[status(thm)],[c_515]) ).
cnf(c_196,plain,
( epsilon_connected(sK1)
| in(sK3(sK1),sK2(sK1))
| sK2(sK1) = sK3(sK1)
| in(sK2(sK1),sK3(sK1)) ),
inference(copy,[status(thm)],[c_516]) ).
cnf(c_517,plain,
( epsilon_connected(sK1)
| epsilon_connected(sK1)
| in(sK3(sK1),sK2(sK1))
| sK2(sK1) = sK3(sK1) ),
inference(resolve,[status(thm)],[c_196,c_106]) ).
cnf(c_426,plain,
( epsilon_connected(sK1)
| in(sK3(sK1),sK2(sK1))
| sK2(sK1) = sK3(sK1) ),
inference(copy,[status(thm)],[c_517]) ).
cnf(c_518,plain,
( epsilon_connected(sK1)
| epsilon_connected(sK1)
| sK2(sK1) = sK3(sK1) ),
inference(resolve,[status(thm)],[c_426,c_108]) ).
cnf(c_483,plain,
( epsilon_connected(sK1)
| sK2(sK1) = sK3(sK1) ),
inference(copy,[status(thm)],[c_518]) ).
cnf(c_519,plain,
( ordinal(sK1)
| in(sK0(sK1),sK1)
| sK2(sK1) = sK3(sK1) ),
inference(resolve,[status(thm)],[c_483,c_120]) ).
cnf(c_485,negated_conjecture,
( in(sK0(sK1),sK1)
| sK2(sK1) = sK3(sK1) ),
inference(resolve,[status(thm)],[c_74,c_519]) ).
cnf(c_491,plain,
( subset(sK0(sK1),sK1)
| sK2(sK1) = sK3(sK1) ),
inference(resolve,[status(thm)],[c_485,c_75]) ).
cnf(c_520,plain,
( sK2(sK1) = sK3(sK1)
| ~ epsilon_connected(sK1)
| ordinal(sK1) ),
inference(resolve,[status(thm)],[c_119,c_491]) ).
cnf(c_521,plain,
( sK2(sK1) = sK3(sK1)
| sK2(sK1) = sK3(sK1)
| ordinal(sK1) ),
inference(resolve,[status(thm)],[c_520,c_483]) ).
cnf(c_522,plain,
( sK2(sK1) = sK3(sK1)
| ordinal(sK1) ),
inference(copy,[status(thm)],[c_521]) ).
cnf(c_503,negated_conjecture,
sK2(sK1) = sK3(sK1),
inference(resolve,[status(thm)],[c_74,c_522]) ).
cnf(c_504,plain,
epsilon_connected(sK1),
inference(resolve,[status(thm)],[c_503,c_107]) ).
cnf(c_523,plain,
( ordinal(sK1)
| in(sK0(sK1),sK1) ),
inference(resolve,[status(thm)],[c_504,c_120]) ).
cnf(c_506,negated_conjecture,
in(sK0(sK1),sK1),
inference(resolve,[status(thm)],[c_74,c_523]) ).
cnf(c_524,negated_conjecture,
( ~ epsilon_connected(sK1)
| ~ subset(sK0(sK1),sK1) ),
inference(resolve,[status(thm)],[c_119,c_74]) ).
cnf(c_507,negated_conjecture,
~ subset(sK0(sK1),sK1),
inference(resolve,[status(thm)],[c_524,c_504]) ).
cnf(c_525,negated_conjecture,
subset(sK0(sK1),sK1),
inference(resolve,[status(thm)],[c_506,c_75]) ).
cnf(c_513,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_507,c_525]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU234+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n006.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 26 08:55:25 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35 % Process 868769 was started by sandbox2 on n006,
% 0.09/0.35 % Sat Sep 26 08:55:25 2026
% 0.09/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.36
% 0.09/0.36 % From the command line: assign(max_seconds, 300).
% 0.13/0.44
% 0.13/0.44 % SZS status Theorem for theBenchmark
% 0.13/0.44
% 0.13/0.44 % Proof 1 at 0.05 (+ 0.02) seconds.
% 0.13/0.44 % Length of proof is 31.
% 0.13/0.44 % Level of proof is 11.
% 0.13/0.44 % Maximum clause weight is 27.000.
% 0.13/0.44 % Given clauses 218.
% 0.13/0.44
% 0.13/0.44 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------