%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC104+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n013.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:56:50 AM UTC 2026
% Result : Theorem 43.23s 10.84s
% Output : CNFRefutation 43.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 44 ( 19 unt; 0 def)
% Number of atoms : 182 ( 66 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 217 ( 79 ~; 69 |; 53 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 26 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax5,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( frontsegP(U,V)
<=> ? [W] :
( app(V,W) = U
& ssList(W) ) ) ) ),
file('theBenchmark.p',ax5) ).
fof(ax15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('theBenchmark.p',ax15) ).
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( frontsegP(V,U)
& neq(U,nil) )
| ( nil = W
& nil != X )
| ! [Y] :
( ssList(Y)
=> ( ? [Z] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( leq(X2,Z)
& app(X3,cons(X2,nil)) = W
& ssList(X3) )
& ssItem(X2) )
& app(cons(Z,nil),X1) = Y
& ssList(X1) )
& ssItem(Z) )
| ~ totalorderedP(W)
| app(W,Y) != X ) )
| ~ neq(V,nil)
| U != W
| V != X ) ) ) ) ),
file('theBenchmark.p',co1) ).
fof(co1_neg,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( frontsegP(V,U)
& neq(U,nil) )
| ( nil = W
& nil != X )
| ! [Y] :
( ssList(Y)
=> ( ? [Z] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( leq(X2,Z)
& app(X3,cons(X2,nil)) = W
& ssList(X3) )
& ssItem(X2) )
& app(cons(Z,nil),X1) = Y
& ssList(X1) )
& ssItem(Z) )
| ~ totalorderedP(W)
| app(W,Y) != X ) )
| ~ neq(V,nil)
| U != W
| V != X ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(nnf_87,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ~ frontsegP(V,U)
| ~ neq(U,nil) )
& ( nil != W
| nil = X )
& ? [Y] :
( ! [Z] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ~ leq(X2,Z)
| app(X3,cons(X2,nil)) != W
| ~ ssList(X3) )
| ~ ssItem(X2) )
| app(cons(Z,nil),X1) != Y
| ~ ssList(X1) )
| ~ ssItem(Z) )
& totalorderedP(W)
& app(W,Y) = X
& ssList(Y) )
& neq(V,nil)
& W = U
& X = V
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(fof_nnf,[status(thm)],[co1_neg]) ).
fof(sk_co1_neg_sk,plain,
( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK3
| nil = sK2 )
& ! [Z] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ~ leq(X2,Z)
| app(X3,cons(X2,nil)) != sK3
| ~ ssList(X3) )
| ~ ssItem(X2) )
| app(cons(Z,nil),X1) != sK4
| ~ ssList(X1) )
| ~ ssItem(Z) )
& totalorderedP(sK3)
& app(sK3,sK4) = sK2
& ssList(sK4)
& neq(sK1,nil)
& sK3 = sK0
& sK2 = sK1
& ssList(sK2)
& ssList(sK3)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK3,sK2,sK4]),skolemize(U,sK0),skolemize(V,sK1),skolemize(W,sK3),skolemize(X,sK2),skolemize(Y,sK4)],[nnf_87]) ).
fof(sk_co1_neg,plain,
( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK3
| nil = sK2 )
& ! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ leq(VAR_2,VAR_0)
| app(VAR_3,cons(VAR_2,nil)) != sK3
| ~ ssList(VAR_3)
| ~ ssItem(VAR_2)
| app(cons(VAR_0,nil),VAR_1) != sK4
| ~ ssList(VAR_1)
| ~ ssItem(VAR_0) )
& totalorderedP(sK3)
& app(sK3,sK4) = sK2
& ssList(sK4)
& neq(sK1,nil)
& sK3 = sK0
& sK2 = sK1
& ssList(sK2)
& ssList(sK3)
& ssList(sK1)
& ssList(sK0) ),
inference(cnf_transformation,[status(thm)],[sk_co1_neg_sk]) ).
cnf(c_190,negated_conjecture,
( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_191,negated_conjecture,
( nil != sK3
| nil = sK2 ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_4301,negated_conjecture,
( nil != sK3
| sK2 = nil ),
inference(copy,[status(thm)],[c_191]) ).
cnf(c_192,negated_conjecture,
( sK3 != nil
| sK2 = nil ),
inference(copy,[status(thm)],[c_4301]) ).
cnf(c_195,negated_conjecture,
app(sK3,sK4) = sK2,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_196,negated_conjecture,
ssList(sK4),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_197,negated_conjecture,
neq(sK1,nil),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_198,negated_conjecture,
sK3 = sK0,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_199,negated_conjecture,
sK2 = sK1,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_200,negated_conjecture,
ssList(sK2),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_201,negated_conjecture,
ssList(sK1),
inference(paramod,[status(thm)],[c_199,c_200]) ).
cnf(c_202,negated_conjecture,
ssList(sK3),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_203,negated_conjecture,
ssList(sK0),
inference(paramod,[status(thm)],[c_198,c_202]) ).
fof(ax17,axiom,
ssList(nil),
file('theBenchmark.p',ax17) ).
cnf(c_299,plain,
ssList(nil),
inference(clausify,[status(thm)],[ax17]) ).
cnf(c_301,plain,
( B = A
| neq(A,B)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax15]) ).
cnf(c_302,plain,
( B != A
| ~ neq(A,B)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax15]) ).
cnf(c_326,plain,
( app(B,C) != A
| ~ ssList(C)
| frontsegP(A,B)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax5]) ).
cnf(c_4302,negated_conjecture,
app(sK0,sK4) = sK2,
inference(paramod,[status(thm)],[c_198,c_195]) ).
cnf(c_550,negated_conjecture,
app(sK0,sK4) = sK1,
inference(paramod,[status(thm)],[c_199,c_4302]) ).
cnf(c_4303,negated_conjecture,
( sK3 != nil
| sK1 = nil ),
inference(paramod,[status(thm)],[c_199,c_192]) ).
cnf(c_553,negated_conjecture,
( sK0 != nil
| sK1 = nil ),
inference(paramod,[status(thm)],[c_198,c_4303]) ).
cnf(c_4304,negated_conjecture,
( A = sK0
| neq(sK0,A)
| ~ ssList(A) ),
inference(resolve,[status(thm)],[c_301,c_203]) ).
cnf(c_4305,negated_conjecture,
( nil = sK0
| neq(sK0,nil) ),
inference(resolve,[status(thm)],[c_4304,c_299]) ).
cnf(c_1896,negated_conjecture,
( sK0 = nil
| neq(sK0,nil) ),
inference(copy,[status(thm)],[c_4305]) ).
cnf(c_4306,negated_conjecture,
( nil != sK1
| ~ ssList(nil)
| ~ ssList(sK1) ),
inference(resolve,[status(thm)],[c_302,c_197]) ).
cnf(c_4307,negated_conjecture,
( sK1 != nil
| ~ ssList(nil)
| ~ ssList(sK1) ),
inference(copy,[status(thm)],[c_4306]) ).
cnf(c_4308,negated_conjecture,
( sK1 != nil
| ~ ssList(nil) ),
inference(resolve,[status(thm)],[c_201,c_4307]) ).
cnf(c_1904,negated_conjecture,
sK1 != nil,
inference(resolve,[status(thm)],[c_299,c_4308]) ).
cnf(c_1928,negated_conjecture,
sK0 != nil,
inference(resolve,[status(thm)],[c_1904,c_553]) ).
cnf(c_1929,negated_conjecture,
neq(sK0,nil),
inference(resolve,[status(thm)],[c_1928,c_1896]) ).
cnf(c_1953,negated_conjecture,
~ frontsegP(sK1,sK0),
inference(resolve,[status(thm)],[c_1929,c_190]) ).
cnf(c_4309,negated_conjecture,
( app(A,B) != sK1
| ~ ssList(B)
| frontsegP(sK1,A)
| ~ ssList(A) ),
inference(resolve,[status(thm)],[c_326,c_201]) ).
cnf(c_4310,negated_conjecture,
( app(sK0,A) != sK1
| ~ ssList(A)
| frontsegP(sK1,sK0) ),
inference(resolve,[status(thm)],[c_4309,c_203]) ).
cnf(c_4311,negated_conjecture,
( app(sK0,sK4) != sK1
| frontsegP(sK1,sK0) ),
inference(resolve,[status(thm)],[c_4310,c_196]) ).
cnf(c_4312,negated_conjecture,
frontsegP(sK1,sK0),
inference(resolve,[status(thm)],[c_4311,c_550]) ).
cnf(c_4300,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_1953,c_4312]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC104+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.36 % Computer : n013.cluster.edu
% 0.09/5.36 % Model : x86_64 x86_64
% 0.09/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36 % Memory : 8046.5625MB
% 0.09/5.36 % OS : Linux 6.8.0-71-generic
% 0.09/5.36 % CPULimit : 300
% 0.09/5.36 % WCLimit : 300
% 0.09/5.36 % DateTime : Sat Sep 26 12:15:12 UTC 2026
% 0.09/5.36 % CPUTime :
% 0.09/5.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.36 % Process 2705857 was started by sandbox2 on n013,
% 0.09/5.36 % Sat Sep 26 12:15:12 2026
% 0.09/5.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/5.38
% 0.09/5.38 % From the command line: assign(max_seconds, 300).
% 43.23/10.84
% 43.23/10.84 % SZS status Theorem for theBenchmark
% 43.23/10.84
% 43.23/10.84 % Proof 1 at 5.22 (+ 0.20) seconds.
% 43.23/10.84 % Length of proof is 27.
% 43.23/10.84 % Level of proof is 7.
% 43.23/10.84 % Maximum clause weight is 24.000.
% 43.23/10.84 % Given clauses 352.
% 43.23/10.84
% 43.23/10.84 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------