%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC153+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 : n005.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:01 AM UTC 2026
% Result : Theorem 217.61s 29.28s
% Output : CNFRefutation 217.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 2
% Syntax : Number of formulae : 60 ( 16 unt; 0 def)
% Number of atoms : 388 ( 36 equ)
% Maximal formula atoms : 48 ( 6 avg)
% Number of connectives : 564 ( 236 ~; 228 |; 77 &)
% ( 0 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 7 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 124 ( 0 sgn 51 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax29,axiom,
! [U] :
( ssItem(U)
=> ! [V] :
( ssItem(V)
=> ( ( leq(V,U)
& leq(U,V) )
=> U = V ) ) ),
file('theBenchmark.p',ax29) ).
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ( leq(X5,X6)
& ! [X10] :
( ssItem(X10)
=> ( ( leq(X5,X10)
& leq(X10,X6) )
| ~ memberP(X8,X10) ) ) )
| ~ leq(X6,X5)
| app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != U ) ) ) ) ) )
| ? [Y] :
( ? [Z] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ( ~ leq(X4,Z)
| ~ leq(Y,X4) )
& memberP(X2,X4)
& ssItem(X4) )
| ~ leq(Y,Z) )
& leq(Z,Y)
& app(app(app(app(X1,cons(Y,nil)),X2),cons(Z,nil)),X3) = W
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssItem(Z) )
& ssItem(Y) )
| W != U
| X != V ) ) ) ) ),
file('theBenchmark.p',co1) ).
fof(co1_neg,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ( leq(X5,X6)
& ! [X10] :
( ssItem(X10)
=> ( ( leq(X5,X10)
& leq(X10,X6) )
| ~ memberP(X8,X10) ) ) )
| ~ leq(X6,X5)
| app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != U ) ) ) ) ) )
| ? [Y] :
( ? [Z] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ( ~ leq(X4,Z)
| ~ leq(Y,X4) )
& memberP(X2,X4)
& ssItem(X4) )
| ~ leq(Y,Z) )
& leq(Z,Y)
& app(app(app(app(X1,cons(Y,nil)),X2),cons(Z,nil)),X3) = W
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssItem(Z) )
& ssItem(Y) )
| W != U
| X != V ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
cnf(c_246,plain,
( B = A
| ~ leq(B,A)
| ~ leq(A,B)
| ~ ssItem(B)
| ~ ssItem(A) ),
inference(clausify,[status(thm)],[ax29]) ).
fof(nnf_87,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( ( ~ leq(X5,X6)
| ? [X10] :
( ( ~ leq(X5,X10)
| ~ leq(X10,X6) )
& memberP(X8,X10)
& ssItem(X10) ) )
& leq(X6,X5)
& app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) = U
& ssList(X9) )
& ssList(X8) )
& ssList(X7) )
& ssItem(X6) )
& ssItem(X5) )
& ! [Y] :
( ! [Z] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( ! [X4] :
( ( leq(X4,Z)
& leq(Y,X4) )
| ~ memberP(X2,X4)
| ~ ssItem(X4) )
& leq(Y,Z) )
| ~ leq(Z,Y)
| app(app(app(app(X1,cons(Y,nil)),X2),cons(Z,nil)),X3) != W
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(Z) )
| ~ ssItem(Y) )
& 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,
( ( ~ leq(sK2,sK3)
| ( ( ~ leq(sK2,sK7)
| ~ leq(sK7,sK3) )
& memberP(sK5,sK7)
& ssItem(sK7) ) )
& leq(sK3,sK2)
& app(app(app(app(sK4,cons(sK2,nil)),sK5),cons(sK3,nil)),sK6) = sK1
& ssList(sK6)
& ssList(sK5)
& ssList(sK4)
& ssItem(sK3)
& ssItem(sK2)
& ! [Y] :
( ! [Z] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( ! [X4] :
( ( leq(X4,Z)
& leq(Y,X4) )
| ~ memberP(X2,X4)
| ~ ssItem(X4) )
& leq(Y,Z) )
| ~ leq(Z,Y)
| app(app(app(app(X1,cons(Y,nil)),X2),cons(Z,nil)),X3) != sK0
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(Z) )
| ~ ssItem(Y) )
& sK0 = sK1
& sK9 = sK8
& ssList(sK9)
& ssList(sK0)
& ssList(sK8)
& ssList(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK8,sK0,sK9,sK2,sK3,sK4,sK5,sK6,sK7]),skolemize(U,sK1),skolemize(V,sK8),skolemize(W,sK0),skolemize(X,sK9),skolemize(X5,sK2),skolemize(X6,sK3),skolemize(X7,sK4),skolemize(X8,sK5),skolemize(X9,sK6),skolemize(X10,sK7)],[nnf_87]) ).
fof(sk_co1_neg,plain,
( ( ~ leq(sK2,sK3)
| ~ leq(sK2,sK7)
| ~ leq(sK7,sK3) )
& ( ~ leq(sK2,sK3)
| memberP(sK5,sK7) )
& ( ~ leq(sK2,sK3)
| ssItem(sK7) )
& leq(sK3,sK2)
& app(app(app(app(sK4,cons(sK2,nil)),sK5),cons(sK3,nil)),sK6) = sK1
& ssList(sK6)
& ssList(sK5)
& ssList(sK4)
& ssItem(sK3)
& ssItem(sK2)
& ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( leq(VAR_5,VAR_1)
| ~ memberP(VAR_3,VAR_5)
| ~ ssItem(VAR_5)
| ~ leq(VAR_1,VAR_0)
| app(app(app(app(VAR_2,cons(VAR_0,nil)),VAR_3),cons(VAR_1,nil)),VAR_4) != sK0
| ~ ssList(VAR_4)
| ~ ssList(VAR_3)
| ~ ssList(VAR_2)
| ~ ssItem(VAR_1)
| ~ ssItem(VAR_0) )
& ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( leq(VAR_0,VAR_5)
| ~ memberP(VAR_3,VAR_5)
| ~ ssItem(VAR_5)
| ~ leq(VAR_1,VAR_0)
| app(app(app(app(VAR_2,cons(VAR_0,nil)),VAR_3),cons(VAR_1,nil)),VAR_4) != sK0
| ~ ssList(VAR_4)
| ~ ssList(VAR_3)
| ~ ssList(VAR_2)
| ~ ssItem(VAR_1)
| ~ ssItem(VAR_0) )
& ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( leq(VAR_0,VAR_1)
| ~ leq(VAR_1,VAR_0)
| app(app(app(app(VAR_2,cons(VAR_0,nil)),VAR_3),cons(VAR_1,nil)),VAR_4) != sK0
| ~ ssList(VAR_4)
| ~ ssList(VAR_3)
| ~ ssList(VAR_2)
| ~ ssItem(VAR_1)
| ~ ssItem(VAR_0) )
& sK0 = sK1
& sK9 = sK8
& ssList(sK9)
& ssList(sK0)
& ssList(sK8)
& ssList(sK1) ),
inference(cnf_transformation,[status(thm)],[sk_co1_neg_sk]) ).
cnf(c_332,negated_conjecture,
sK0 = sK1,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_333,negated_conjecture,
( leq(A,B)
| ~ leq(B,A)
| app(app(app(app(C,cons(A,nil)),D),cons(B,nil)),E) != sK0
| ~ ssList(E)
| ~ ssList(D)
| ~ ssList(C)
| ~ ssItem(B)
| ~ ssItem(A) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_334,negated_conjecture,
( leq(A,B)
| ~ leq(B,A)
| app(app(app(app(C,cons(A,nil)),D),cons(B,nil)),E) != sK1
| ~ ssList(E)
| ~ ssList(D)
| ~ ssList(C)
| ~ ssItem(B)
| ~ ssItem(A) ),
inference(paramod,[status(thm)],[c_332,c_333]) ).
cnf(c_335,negated_conjecture,
( leq(A,F)
| ~ memberP(D,F)
| ~ ssItem(F)
| ~ leq(B,A)
| app(app(app(app(C,cons(A,nil)),D),cons(B,nil)),E) != sK0
| ~ ssList(E)
| ~ ssList(D)
| ~ ssList(C)
| ~ ssItem(B)
| ~ ssItem(A) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_336,negated_conjecture,
( leq(A,F)
| ~ memberP(D,F)
| ~ ssItem(F)
| ~ leq(B,A)
| app(app(app(app(C,cons(A,nil)),D),cons(B,nil)),E) != sK1
| ~ ssList(E)
| ~ ssList(D)
| ~ ssList(C)
| ~ ssItem(B)
| ~ ssItem(A) ),
inference(paramod,[status(thm)],[c_332,c_335]) ).
cnf(c_337,negated_conjecture,
( leq(F,B)
| ~ memberP(D,F)
| ~ ssItem(F)
| ~ leq(B,A)
| app(app(app(app(C,cons(A,nil)),D),cons(B,nil)),E) != sK0
| ~ ssList(E)
| ~ ssList(D)
| ~ ssList(C)
| ~ ssItem(B)
| ~ ssItem(A) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_338,negated_conjecture,
( leq(F,B)
| ~ memberP(D,F)
| ~ ssItem(F)
| ~ leq(B,A)
| app(app(app(app(C,cons(A,nil)),D),cons(B,nil)),E) != sK1
| ~ ssList(E)
| ~ ssList(D)
| ~ ssList(C)
| ~ ssItem(B)
| ~ ssItem(A) ),
inference(paramod,[status(thm)],[c_332,c_337]) ).
cnf(c_339,negated_conjecture,
ssItem(sK2),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_340,negated_conjecture,
ssItem(sK3),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_341,negated_conjecture,
ssList(sK4),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_342,negated_conjecture,
ssList(sK5),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_343,negated_conjecture,
ssList(sK6),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_344,negated_conjecture,
app(app(app(app(sK4,cons(sK2,nil)),sK5),cons(sK3,nil)),sK6) = sK1,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_345,negated_conjecture,
leq(sK3,sK2),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_346,negated_conjecture,
( ~ leq(sK2,sK3)
| ssItem(sK7) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_347,negated_conjecture,
( ~ leq(sK2,sK3)
| memberP(sK5,sK7) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_348,negated_conjecture,
( ~ leq(sK2,sK3)
| ~ leq(sK2,sK7)
| ~ leq(sK7,sK3) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_3755,negated_conjecture,
( leq(A,sK3)
| ~ memberP(sK5,A)
| ~ ssItem(A)
| ~ leq(sK3,sK2)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssList(sK4)
| ~ ssItem(sK3)
| ~ ssItem(sK2) ),
inference(resolve,[status(thm)],[c_344,c_338]) ).
cnf(c_3756,negated_conjecture,
( leq(A,sK3)
| ~ memberP(sK5,A)
| ~ ssItem(A)
| ~ leq(sK3,sK2)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssList(sK4)
| ~ ssItem(sK3) ),
inference(resolve,[status(thm)],[c_339,c_3755]) ).
cnf(c_3757,negated_conjecture,
( leq(A,sK3)
| ~ memberP(sK5,A)
| ~ ssItem(A)
| ~ leq(sK3,sK2)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssList(sK4) ),
inference(resolve,[status(thm)],[c_340,c_3756]) ).
cnf(c_3758,negated_conjecture,
( leq(A,sK3)
| ~ memberP(sK5,A)
| ~ ssItem(A)
| ~ leq(sK3,sK2)
| ~ ssList(sK6)
| ~ ssList(sK5) ),
inference(resolve,[status(thm)],[c_341,c_3757]) ).
cnf(c_3759,negated_conjecture,
( leq(A,sK3)
| ~ memberP(sK5,A)
| ~ ssItem(A)
| ~ leq(sK3,sK2)
| ~ ssList(sK6) ),
inference(resolve,[status(thm)],[c_342,c_3758]) ).
cnf(c_3760,negated_conjecture,
( leq(A,sK3)
| ~ memberP(sK5,A)
| ~ ssItem(A)
| ~ leq(sK3,sK2) ),
inference(resolve,[status(thm)],[c_343,c_3759]) ).
cnf(c_2832,negated_conjecture,
( leq(A,sK3)
| ~ memberP(sK5,A)
| ~ ssItem(A) ),
inference(resolve,[status(thm)],[c_345,c_3760]) ).
cnf(c_3761,negated_conjecture,
( leq(sK2,A)
| ~ memberP(sK5,A)
| ~ ssItem(A)
| ~ leq(sK3,sK2)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssList(sK4)
| ~ ssItem(sK3)
| ~ ssItem(sK2) ),
inference(resolve,[status(thm)],[c_344,c_336]) ).
cnf(c_3762,negated_conjecture,
( leq(sK2,A)
| ~ memberP(sK5,A)
| ~ ssItem(A)
| ~ leq(sK3,sK2)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssList(sK4)
| ~ ssItem(sK3) ),
inference(resolve,[status(thm)],[c_339,c_3761]) ).
cnf(c_3763,negated_conjecture,
( leq(sK2,A)
| ~ memberP(sK5,A)
| ~ ssItem(A)
| ~ leq(sK3,sK2)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssList(sK4) ),
inference(resolve,[status(thm)],[c_340,c_3762]) ).
cnf(c_3764,negated_conjecture,
( leq(sK2,A)
| ~ memberP(sK5,A)
| ~ ssItem(A)
| ~ leq(sK3,sK2)
| ~ ssList(sK6)
| ~ ssList(sK5) ),
inference(resolve,[status(thm)],[c_341,c_3763]) ).
cnf(c_3765,negated_conjecture,
( leq(sK2,A)
| ~ memberP(sK5,A)
| ~ ssItem(A)
| ~ leq(sK3,sK2)
| ~ ssList(sK6) ),
inference(resolve,[status(thm)],[c_342,c_3764]) ).
cnf(c_3766,negated_conjecture,
( leq(sK2,A)
| ~ memberP(sK5,A)
| ~ ssItem(A)
| ~ leq(sK3,sK2) ),
inference(resolve,[status(thm)],[c_343,c_3765]) ).
cnf(c_2833,negated_conjecture,
( leq(sK2,A)
| ~ memberP(sK5,A)
| ~ ssItem(A) ),
inference(resolve,[status(thm)],[c_345,c_3766]) ).
cnf(c_3767,negated_conjecture,
( leq(sK2,sK3)
| ~ leq(sK3,sK2)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssList(sK4)
| ~ ssItem(sK3)
| ~ ssItem(sK2) ),
inference(resolve,[status(thm)],[c_344,c_334]) ).
cnf(c_3768,negated_conjecture,
( leq(sK2,sK3)
| ~ leq(sK3,sK2)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssList(sK4)
| ~ ssItem(sK3) ),
inference(resolve,[status(thm)],[c_339,c_3767]) ).
cnf(c_3769,negated_conjecture,
( leq(sK2,sK3)
| ~ leq(sK3,sK2)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssList(sK4) ),
inference(resolve,[status(thm)],[c_340,c_3768]) ).
cnf(c_3770,negated_conjecture,
( leq(sK2,sK3)
| ~ leq(sK3,sK2)
| ~ ssList(sK6)
| ~ ssList(sK5) ),
inference(resolve,[status(thm)],[c_341,c_3769]) ).
cnf(c_3771,negated_conjecture,
( leq(sK2,sK3)
| ~ leq(sK3,sK2)
| ~ ssList(sK6) ),
inference(resolve,[status(thm)],[c_342,c_3770]) ).
cnf(c_3772,negated_conjecture,
( leq(sK2,sK3)
| ~ leq(sK3,sK2) ),
inference(resolve,[status(thm)],[c_343,c_3771]) ).
cnf(c_2834,negated_conjecture,
leq(sK2,sK3),
inference(resolve,[status(thm)],[c_345,c_3772]) ).
cnf(c_2835,negated_conjecture,
( ~ leq(sK2,sK7)
| ~ leq(sK7,sK3) ),
inference(resolve,[status(thm)],[c_2834,c_348]) ).
cnf(c_2836,negated_conjecture,
memberP(sK5,sK7),
inference(resolve,[status(thm)],[c_2834,c_347]) ).
cnf(c_2837,negated_conjecture,
ssItem(sK7),
inference(resolve,[status(thm)],[c_2834,c_346]) ).
cnf(c_3773,negated_conjecture,
( sK3 = sK2
| ~ leq(sK2,sK3)
| ~ ssItem(sK3)
| ~ ssItem(sK2) ),
inference(resolve,[status(thm)],[c_345,c_246]) ).
cnf(c_3774,negated_conjecture,
( sK3 = sK2
| ~ leq(sK2,sK3)
| ~ ssItem(sK3) ),
inference(resolve,[status(thm)],[c_339,c_3773]) ).
cnf(c_3775,negated_conjecture,
( sK3 = sK2
| ~ leq(sK2,sK3) ),
inference(resolve,[status(thm)],[c_340,c_3774]) ).
cnf(c_2843,negated_conjecture,
sK3 = sK2,
inference(resolve,[status(thm)],[c_2834,c_3775]) ).
cnf(c_2844,negated_conjecture,
( ~ leq(sK2,sK7)
| ~ leq(sK7,sK2) ),
inference(paramod,[status(thm)],[c_2843,c_2835]) ).
cnf(c_2845,negated_conjecture,
( leq(A,sK2)
| ~ memberP(sK5,A)
| ~ ssItem(A) ),
inference(paramod,[status(thm)],[c_2843,c_2832]) ).
cnf(c_3776,negated_conjecture,
( leq(sK2,sK7)
| ~ memberP(sK5,sK7) ),
inference(resolve,[status(thm)],[c_2833,c_2837]) ).
cnf(c_3728,negated_conjecture,
leq(sK2,sK7),
inference(resolve,[status(thm)],[c_2836,c_3776]) ).
cnf(c_3733,negated_conjecture,
~ leq(sK7,sK2),
inference(resolve,[status(thm)],[c_3728,c_2844]) ).
cnf(c_3777,negated_conjecture,
( leq(sK7,sK2)
| ~ memberP(sK5,sK7) ),
inference(resolve,[status(thm)],[c_2845,c_2837]) ).
cnf(c_3778,negated_conjecture,
leq(sK7,sK2),
inference(resolve,[status(thm)],[c_2836,c_3777]) ).
cnf(c_3754,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_3733,c_3778]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC153+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.10/0.35 % Computer : n005.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 26 12:21:02 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.36 % Process 2115257 was started by sandbox2 on n005,
% 0.10/0.36 % Sat Sep 26 12:21:02 2026
% 0.10/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.38
% 0.12/0.38 % From the command line: assign(max_seconds, 300).
% 217.61/29.28
% 217.61/29.28 % given #500 (I,wt=49): 700 -ssList(A) | ssItem(f33(A)) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(app(D,cons(B,E)),cons(C,A)) != A | C != B. [factor(369,a,g)].
% 217.61/29.28
% 217.61/29.28 % given #1000 (I,wt=47): 1220 -ssList(A) | ssList(f36(A)) | -ssItem(B) | -ssItem(C) | -ssList(D) | app(app(D,cons(B,A)),cons(C,A)) != A | C != B. [factor(720,a,f)].
% 217.61/29.28
% 217.61/29.28 % given #1500 (T,wt=11): 1976 -frontsegP(nil,c3) | c3 = nil. [resolve(327,a,271,a),flip(b)].
% 217.61/29.28
% 217.61/29.28 % SZS status Theorem for theBenchmark
% 217.61/29.28
% 217.61/29.28 % Proof 1 at 3.91 (+ 0.74) seconds.
% 217.61/29.28 % Length of proof is 32.
% 217.61/29.28 % Level of proof is 7.
% 217.61/29.28 % Maximum clause weight is 72.000.
% 217.61/29.28 % Given clauses 1730.
% 217.61/29.28
% 217.61/29.28 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------