%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC384+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/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:57:39 AM UTC 2026
% Result : Theorem 10.44s 1.75s
% Output : CNFRefutation 10.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 56 ( 17 unt; 0 def)
% Number of atoms : 243 ( 85 equ)
% Maximal formula atoms : 45 ( 4 avg)
% Number of connectives : 271 ( 84 ~; 99 |; 66 &)
% ( 3 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 27 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax4,axiom,
! [U] :
( ssList(U)
=> ( singletonP(U)
<=> ? [V] :
( cons(V,nil) = U
& ssItem(V) ) ) ),
file('theBenchmark.p',ax4) ).
fof(ax7,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( segmentP(U,V)
<=> ? [W] :
( ? [X] :
( app(app(W,V),X) = U
& ssList(X) )
& ssList(W) ) ) ) ),
file('theBenchmark.p',ax7) ).
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)
=> ( ( segmentP(V,U)
& singletonP(U) )
| ( ( nil != W
| nil != X )
& ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ! [X1] :
( ssList(X1)
=> ( ? [X3] :
( lt(X3,Y)
& memberP(X1,X3)
& ssItem(X3) )
| ? [X2] :
( lt(Y,X2)
& memberP(Z,X2)
& ssItem(X2) )
| app(app(Z,W),X1) != X
| cons(Y,nil) != W ) ) ) ) )
| ~ 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)
=> ( ( segmentP(V,U)
& singletonP(U) )
| ( ( nil != W
| nil != X )
& ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ! [X1] :
( ssList(X1)
=> ( ? [X3] :
( lt(X3,Y)
& memberP(X1,X3)
& ssItem(X3) )
| ? [X2] :
( lt(Y,X2)
& memberP(Z,X2)
& ssItem(X2) )
| app(app(Z,W),X1) != X
| cons(Y,nil) != W ) ) ) ) )
| ~ neq(V,nil)
| U != W
| V != X ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
cnf(c_90,plain,
( B != A
| ~ neq(A,B)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax15]) ).
fof(nnf_87,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ~ segmentP(V,U)
| ~ singletonP(U) )
& ( ( nil = W
& nil = X )
| ? [Y] :
( ? [Z] :
( ? [X1] :
( ! [X3] :
( ~ lt(X3,Y)
| ~ memberP(X1,X3)
| ~ ssItem(X3) )
& ! [X2] :
( ~ lt(Y,X2)
| ~ memberP(Z,X2)
| ~ ssItem(X2) )
& app(app(Z,W),X1) = X
& cons(Y,nil) = W
& ssList(X1) )
& ssList(Z) )
& ssItem(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,
( ( ~ segmentP(sK0,sK1)
| ~ singletonP(sK1) )
& ( ( nil = sK3
& nil = sK2 )
| ( ! [X3] :
( ~ lt(X3,sK4)
| ~ memberP(sK6,X3)
| ~ ssItem(X3) )
& ! [X2] :
( ~ lt(sK4,X2)
| ~ memberP(sK5,X2)
| ~ ssItem(X2) )
& app(app(sK5,sK3),sK6) = sK2
& cons(sK4,nil) = sK3
& ssList(sK6)
& ssList(sK5)
& ssItem(sK4) ) )
& neq(sK0,nil)
& sK3 = sK1
& sK2 = sK0
& ssList(sK2)
& ssList(sK3)
& ssList(sK0)
& ssList(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK0,sK3,sK2,sK4,sK5,sK6]),skolemize(U,sK1),skolemize(V,sK0),skolemize(W,sK3),skolemize(X,sK2),skolemize(Y,sK4),skolemize(Z,sK5),skolemize(X1,sK6)],[nnf_87]) ).
fof(sk_co1_neg,plain,
( ( ~ segmentP(sK0,sK1)
| ~ singletonP(sK1) )
& ! [VAR_0] :
( nil = sK3
| ~ lt(VAR_0,sK4)
| ~ memberP(sK6,VAR_0)
| ~ ssItem(VAR_0) )
& ! [VAR_0] :
( nil = sK2
| ~ lt(VAR_0,sK4)
| ~ memberP(sK6,VAR_0)
| ~ ssItem(VAR_0) )
& ! [VAR_0] :
( nil = sK3
| ~ lt(sK4,VAR_0)
| ~ memberP(sK5,VAR_0)
| ~ ssItem(VAR_0) )
& ! [VAR_0] :
( nil = sK2
| ~ lt(sK4,VAR_0)
| ~ memberP(sK5,VAR_0)
| ~ ssItem(VAR_0) )
& ( nil = sK3
| app(app(sK5,sK3),sK6) = sK2 )
& ( nil = sK2
| app(app(sK5,sK3),sK6) = sK2 )
& ( nil = sK3
| cons(sK4,nil) = sK3 )
& ( nil = sK2
| cons(sK4,nil) = sK3 )
& ( nil = sK3
| ssList(sK6) )
& ( nil = sK2
| ssList(sK6) )
& ( nil = sK3
| ssList(sK5) )
& ( nil = sK2
| ssList(sK5) )
& ( nil = sK3
| ssItem(sK4) )
& ( nil = sK2
| ssItem(sK4) )
& neq(sK0,nil)
& sK3 = sK1
& sK2 = sK0
& ssList(sK2)
& ssList(sK3)
& ssList(sK0)
& ssList(sK1) ),
inference(cnf_transformation,[status(thm)],[sk_co1_neg_sk]) ).
cnf(c_92,negated_conjecture,
neq(sK0,nil),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_204,plain,
( cons(B,nil) != A
| ~ ssItem(B)
| singletonP(A)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax4]) ).
cnf(c_214,plain,
( app(app(C,B),D) != A
| ~ ssList(D)
| ~ ssList(C)
| segmentP(A,B)
| ~ ssList(B)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[ax7]) ).
fof(ax17,axiom,
ssList(nil),
file('theBenchmark.p',ax17) ).
cnf(c_232,plain,
ssList(nil),
inference(clausify,[status(thm)],[ax17]) ).
cnf(c_328,negated_conjecture,
ssList(sK1),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_329,negated_conjecture,
ssList(sK0),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_332,negated_conjecture,
sK2 = sK0,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_333,negated_conjecture,
sK3 = sK1,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_334,negated_conjecture,
( nil = sK2
| ssItem(sK4) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_2606,negated_conjecture,
( nil = sK0
| ssItem(sK4) ),
inference(paramod,[status(thm)],[c_332,c_334]) ).
cnf(c_335,negated_conjecture,
( sK0 = nil
| ssItem(sK4) ),
inference(copy,[status(thm)],[c_2606]) ).
cnf(c_338,negated_conjecture,
( nil = sK2
| ssList(sK5) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_2607,negated_conjecture,
( nil = sK0
| ssList(sK5) ),
inference(paramod,[status(thm)],[c_332,c_338]) ).
cnf(c_339,negated_conjecture,
( sK0 = nil
| ssList(sK5) ),
inference(copy,[status(thm)],[c_2607]) ).
cnf(c_342,negated_conjecture,
( nil = sK2
| ssList(sK6) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_2608,negated_conjecture,
( nil = sK0
| ssList(sK6) ),
inference(paramod,[status(thm)],[c_332,c_342]) ).
cnf(c_343,negated_conjecture,
( sK0 = nil
| ssList(sK6) ),
inference(copy,[status(thm)],[c_2608]) ).
cnf(c_346,negated_conjecture,
( nil = sK2
| cons(sK4,nil) = sK3 ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_2609,negated_conjecture,
( nil = sK2
| cons(sK4,nil) = sK1 ),
inference(paramod,[status(thm)],[c_333,c_346]) ).
cnf(c_2610,negated_conjecture,
( nil = sK0
| cons(sK4,nil) = sK1 ),
inference(paramod,[status(thm)],[c_332,c_2609]) ).
cnf(c_347,negated_conjecture,
( sK0 = nil
| cons(sK4,nil) = sK1 ),
inference(copy,[status(thm)],[c_2610]) ).
cnf(c_350,negated_conjecture,
( nil = sK2
| app(app(sK5,sK3),sK6) = sK2 ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_2611,negated_conjecture,
( nil = sK2
| app(app(sK5,sK1),sK6) = sK2 ),
inference(paramod,[status(thm)],[c_333,c_350]) ).
cnf(c_2612,negated_conjecture,
( nil = sK2
| app(app(sK5,sK1),sK6) = sK0 ),
inference(paramod,[status(thm)],[c_332,c_2611]) ).
cnf(c_2613,negated_conjecture,
( nil = sK0
| app(app(sK5,sK1),sK6) = sK0 ),
inference(paramod,[status(thm)],[c_332,c_2612]) ).
cnf(c_351,negated_conjecture,
( sK0 = nil
| app(app(sK5,sK1),sK6) = sK0 ),
inference(copy,[status(thm)],[c_2613]) ).
cnf(c_362,negated_conjecture,
( ~ segmentP(sK0,sK1)
| ~ singletonP(sK1) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_363,negated_conjecture,
( nil != sK0
| ~ ssList(nil)
| ~ ssList(sK0) ),
inference(resolve,[status(thm)],[c_92,c_90]) ).
cnf(c_2614,negated_conjecture,
( sK0 != nil
| ~ ssList(nil)
| ~ ssList(sK0) ),
inference(copy,[status(thm)],[c_363]) ).
cnf(c_2615,negated_conjecture,
( sK0 != nil
| ~ ssList(nil) ),
inference(resolve,[status(thm)],[c_329,c_2614]) ).
cnf(c_364,negated_conjecture,
sK0 != nil,
inference(resolve,[status(thm)],[c_232,c_2615]) ).
cnf(c_647,negated_conjecture,
app(app(sK5,sK1),sK6) = sK0,
inference(resolve,[status(thm)],[c_364,c_351]) ).
cnf(c_648,negated_conjecture,
cons(sK4,nil) = sK1,
inference(resolve,[status(thm)],[c_364,c_347]) ).
cnf(c_649,negated_conjecture,
ssList(sK6),
inference(resolve,[status(thm)],[c_364,c_343]) ).
cnf(c_650,negated_conjecture,
ssList(sK5),
inference(resolve,[status(thm)],[c_364,c_339]) ).
cnf(c_651,negated_conjecture,
ssItem(sK4),
inference(resolve,[status(thm)],[c_364,c_335]) ).
cnf(c_2616,negated_conjecture,
( ~ ssList(sK6)
| ~ ssList(sK5)
| segmentP(sK0,sK1)
| ~ ssList(sK1)
| ~ ssList(sK0) ),
inference(resolve,[status(thm)],[c_647,c_214]) ).
cnf(c_2617,negated_conjecture,
( ~ ssList(sK6)
| ~ ssList(sK5)
| segmentP(sK0,sK1)
| ~ ssList(sK1) ),
inference(resolve,[status(thm)],[c_329,c_2616]) ).
cnf(c_2618,negated_conjecture,
( ~ ssList(sK6)
| ~ ssList(sK5)
| segmentP(sK0,sK1) ),
inference(resolve,[status(thm)],[c_328,c_2617]) ).
cnf(c_2619,negated_conjecture,
( ~ ssList(sK6)
| segmentP(sK0,sK1) ),
inference(resolve,[status(thm)],[c_650,c_2618]) ).
cnf(c_2581,negated_conjecture,
segmentP(sK0,sK1),
inference(resolve,[status(thm)],[c_649,c_2619]) ).
cnf(c_2601,negated_conjecture,
~ singletonP(sK1),
inference(resolve,[status(thm)],[c_2581,c_362]) ).
cnf(c_2620,negated_conjecture,
( ~ ssItem(sK4)
| singletonP(sK1)
| ~ ssList(sK1) ),
inference(resolve,[status(thm)],[c_648,c_204]) ).
cnf(c_2621,negated_conjecture,
( ~ ssItem(sK4)
| singletonP(sK1) ),
inference(resolve,[status(thm)],[c_328,c_2620]) ).
cnf(c_2622,negated_conjecture,
~ ssItem(sK4),
inference(resolve,[status(thm)],[c_2601,c_2621]) ).
cnf(c_2605,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_651,c_2622]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC384+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n013.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 26 12:55:21 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 2788482 was started by sandbox on n013,
% 0.08/0.36 % Sat Sep 26 12:55:21 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.39
% 0.08/0.39 % From the command line: assign(max_seconds, 300).
% 10.44/1.75
% 10.44/1.75 % SZS status Theorem for theBenchmark
% 10.44/1.75
% 10.44/1.75 % Proof 1 at 1.22 (+ 0.12) seconds.
% 10.44/1.75 % Length of proof is 34.
% 10.44/1.75 % Level of proof is 7.
% 10.44/1.75 % Maximum clause weight is 26.000.
% 10.44/1.75 % Given clauses 423.
% 10.44/1.75
% 10.44/1.75 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------