%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC082-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 : n010.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:46 AM UTC 2026
% Result : Unsatisfiable 28.79s 4.12s
% Output : CNFRefutation 28.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 41 ( 21 unt; 0 def)
% Number of atoms : 80 ( 4 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 84 ( 45 ~; 39 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 13 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1_13,axiom,
( ~ neq(sk4,nil)
| segmentP(sk3,sk5) ),
file('theBenchmark.p',co1_13) ).
cnf(c_51,plain,
( ~ neq(sk4,nil)
| segmentP(sk3,sk5) ),
inference(clausify,[status(thm)],[co1_13]) ).
fof(co1_12,axiom,
( ~ neq(sk4,nil)
| segmentP(sk4,sk5) ),
file('theBenchmark.p',co1_12) ).
cnf(c_52,plain,
( ~ neq(sk4,nil)
| segmentP(sk4,sk5) ),
inference(clausify,[status(thm)],[co1_12]) ).
fof(co1_11,axiom,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
file('theBenchmark.p',co1_11) ).
cnf(c_53,plain,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
inference(clausify,[status(thm)],[co1_11]) ).
fof(co1_10,axiom,
( ~ neq(sk4,nil)
| ssList(sk5) ),
file('theBenchmark.p',co1_10) ).
cnf(c_54,plain,
( ~ neq(sk4,nil)
| ssList(sk5) ),
inference(clausify,[status(thm)],[co1_10]) ).
fof(co1_8,axiom,
! [VAR_0] :
( ~ segmentP(sk1,VAR_0)
| ~ segmentP(sk2,VAR_0)
| ~ neq(VAR_0,nil)
| ~ ssList(VAR_0) ),
file('theBenchmark.p',co1_8) ).
cnf(c_57,plain,
( ~ segmentP(sk1,A)
| ~ segmentP(sk2,A)
| ~ neq(A,nil)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[co1_8]) ).
fof(co1_7,axiom,
neq(sk2,nil),
file('theBenchmark.p',co1_7) ).
cnf(c_58,plain,
neq(sk2,nil),
inference(clausify,[status(thm)],[co1_7]) ).
fof(co1_6,axiom,
sk1 = sk3,
file('theBenchmark.p',co1_6) ).
cnf(c_59,plain,
sk1 = sk3,
inference(clausify,[status(thm)],[co1_6]) ).
fof(co1_5,axiom,
sk2 = sk4,
file('theBenchmark.p',co1_5) ).
cnf(c_60,plain,
sk2 = sk4,
inference(clausify,[status(thm)],[co1_5]) ).
fof(co1_4,axiom,
ssList(sk4),
file('theBenchmark.p',co1_4) ).
cnf(c_61,plain,
ssList(sk4),
inference(clausify,[status(thm)],[co1_4]) ).
fof(co1_2,axiom,
ssList(sk2),
file('theBenchmark.p',co1_2) ).
cnf(c_63,plain,
ssList(sk2),
inference(clausify,[status(thm)],[co1_2]) ).
fof(clause152,axiom,
! [VAR_0,VAR_1,VAR_2] :
( segmentP(VAR_0,VAR_2)
| ~ ssList(VAR_0)
| ~ ssList(VAR_1)
| ~ ssList(VAR_2)
| ~ segmentP(VAR_1,VAR_2)
| ~ segmentP(VAR_0,VAR_1) ),
file('theBenchmark.p',clause152) ).
cnf(c_90,plain,
( segmentP(A,C)
| ~ ssList(A)
| ~ ssList(B)
| ~ ssList(C)
| ~ segmentP(B,C)
| ~ segmentP(A,B) ),
inference(clausify,[status(thm)],[clause152]) ).
fof(clause57,axiom,
! [VAR_0] :
( segmentP(VAR_0,VAR_0)
| ~ ssList(VAR_0) ),
file('theBenchmark.p',clause57) ).
cnf(c_168,plain,
( segmentP(A,A)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[clause57]) ).
cnf(c_829,plain,
neq(sk4,nil),
inference(paramod,[status(thm)],[c_60,c_58]) ).
cnf(c_830,plain,
ssList(sk5),
inference(resolve,[status(thm)],[c_829,c_54]) ).
cnf(c_831,plain,
neq(sk5,nil),
inference(resolve,[status(thm)],[c_829,c_53]) ).
cnf(c_832,plain,
segmentP(sk4,sk5),
inference(resolve,[status(thm)],[c_829,c_52]) ).
cnf(c_833,plain,
segmentP(sk3,sk5),
inference(resolve,[status(thm)],[c_829,c_51]) ).
cnf(c_1111,plain,
segmentP(sk2,sk2),
inference(resolve,[status(thm)],[c_168,c_63]) ).
cnf(c_21609,plain,
( ~ segmentP(sk1,sk5)
| ~ segmentP(sk2,sk5)
| ~ ssList(sk5) ),
inference(resolve,[status(thm)],[c_831,c_57]) ).
cnf(c_4897,plain,
( ~ segmentP(sk1,sk5)
| ~ segmentP(sk2,sk5) ),
inference(resolve,[status(thm)],[c_830,c_21609]) ).
cnf(c_21610,plain,
( segmentP(A,sk5)
| ~ ssList(A)
| ~ ssList(sk4)
| ~ ssList(sk5)
| ~ segmentP(A,sk4) ),
inference(resolve,[status(thm)],[c_832,c_90]) ).
cnf(c_21611,plain,
( segmentP(A,sk5)
| ~ ssList(A)
| ~ ssList(sk4)
| ~ segmentP(A,sk4) ),
inference(resolve,[status(thm)],[c_830,c_21610]) ).
cnf(c_4920,plain,
( segmentP(A,sk5)
| ~ ssList(A)
| ~ segmentP(A,sk4) ),
inference(resolve,[status(thm)],[c_61,c_21611]) ).
cnf(c_5731,plain,
segmentP(sk2,sk4),
inference(paramod,[status(thm)],[c_60,c_1111]) ).
cnf(c_21612,plain,
( segmentP(sk2,sk5)
| ~ ssList(sk2) ),
inference(resolve,[status(thm)],[c_4920,c_5731]) ).
cnf(c_21589,plain,
segmentP(sk2,sk5),
inference(resolve,[status(thm)],[c_63,c_21612]) ).
cnf(c_21590,plain,
~ segmentP(sk1,sk5),
inference(resolve,[status(thm)],[c_21589,c_4897]) ).
cnf(c_21613,plain,
~ segmentP(sk3,sk5),
inference(paramod,[status(thm)],[c_59,c_21590]) ).
cnf(c_21608,plain,
$false,
inference(resolve,[status(thm)],[c_833,c_21613]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC082-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n010.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Sat Sep 26 12:13:20 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.44 % Process 3257545 was started by sandbox2 on n010,
% 0.17/0.44 % Sat Sep 26 12:13:20 2026
% 0.17/0.44 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.44
% 0.17/0.44 % From the command line: assign(max_seconds, 300).
% 28.79/4.12
% 28.79/4.12 % given #500 (I,wt=35): 556 app(app(A,cons(B,A)),cons(B,C)) != D | -ssList(C) | -ssList(A) | -ssItem(B) | -ssList(D) | lt(B,B) | -lt(skaf59(D),skaf60(D)). [factor(295,d,e),merge(g)].
% 28.79/4.12
% 28.79/4.12 % given #1000 (A,wt=20): 873 app(app(A,sk2),A) != B | -ssList(A) | -ssList(B) | segmentP(B,sk2). [factor(847,b,c)].
% 28.79/4.12
% 28.79/4.12 % given #1500 (T,wt=9): 11386 frontsegP(app(sk2,sk4),nil). [resolve(10582,a,165,a)].
% 28.79/4.12
% 28.79/4.12 % given #2000 (F,wt=9): 20439 -frontsegP(nil,cons(skac3,sk4)). [para(60(a,1),20424(a,2,2))].
% 28.79/4.12
% 28.79/4.12 % SZS status Unsatisfiable for theBenchmark
% 28.79/4.12
% 28.79/4.12 % Proof 1 at 2.71 (+ 0.93) seconds.
% 28.79/4.12 % Length of proof is 24.
% 28.79/4.12 % Level of proof is 6.
% 28.79/4.12 % Maximum clause weight is 17.000.
% 28.79/4.12 % Given clauses 2222.
% 28.79/4.12
% 28.79/4.12 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------