%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC339-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 : n026.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:31 AM UTC 2026
% Result : Unsatisfiable 40.31s 5.58s
% Output : CNFRefutation 40.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 19 unt; 0 def)
% Number of atoms : 55 ( 8 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 56 ( 31 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause173,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( segmentP(VAR_3,VAR_1)
| ~ ssList(VAR_3)
| ~ ssList(VAR_1)
| ~ ssList(VAR_0)
| ~ ssList(VAR_2)
| app(app(VAR_0,VAR_1),VAR_2) != VAR_3 ),
file('theBenchmark.p',clause173) ).
cnf(c_190,plain,
( segmentP(D,B)
| ~ ssList(D)
| ~ ssList(B)
| ~ ssList(A)
| ~ ssList(C)
| app(app(A,B),C) != D ),
inference(clausify,[status(thm)],[clause173]) ).
fof(co1_3,axiom,
ssList(sk3),
file('theBenchmark.p',co1_3) ).
cnf(c_200,plain,
ssList(sk3),
inference(clausify,[status(thm)],[co1_3]) ).
fof(co1_4,axiom,
ssList(sk4),
file('theBenchmark.p',co1_4) ).
cnf(c_201,plain,
ssList(sk4),
inference(clausify,[status(thm)],[co1_4]) ).
fof(co1_5,axiom,
sk2 = sk4,
file('theBenchmark.p',co1_5) ).
cnf(c_202,plain,
sk2 = sk4,
inference(clausify,[status(thm)],[co1_5]) ).
fof(co1_6,axiom,
sk1 = sk3,
file('theBenchmark.p',co1_6) ).
cnf(c_203,plain,
sk1 = sk3,
inference(clausify,[status(thm)],[co1_6]) ).
fof(co1_7,axiom,
ssList(sk5),
file('theBenchmark.p',co1_7) ).
cnf(c_204,plain,
ssList(sk5),
inference(clausify,[status(thm)],[co1_7]) ).
fof(co1_8,axiom,
ssList(sk6),
file('theBenchmark.p',co1_8) ).
cnf(c_205,plain,
ssList(sk6),
inference(clausify,[status(thm)],[co1_8]) ).
fof(co1_9,axiom,
app(app(sk5,sk3),sk6) = sk4,
file('theBenchmark.p',co1_9) ).
cnf(c_206,plain,
app(app(sk5,sk3),sk6) = sk4,
inference(clausify,[status(thm)],[co1_9]) ).
fof(co1_10,axiom,
totalorderedP(sk3),
file('theBenchmark.p',co1_10) ).
cnf(c_207,plain,
totalorderedP(sk3),
inference(clausify,[status(thm)],[co1_10]) ).
fof(co1_14,axiom,
( ~ totalorderedP(sk1)
| ~ segmentP(sk2,sk1) ),
file('theBenchmark.p',co1_14) ).
cnf(c_212,plain,
( ~ totalorderedP(sk1)
| ~ segmentP(sk2,sk1) ),
inference(clausify,[status(thm)],[co1_14]) ).
cnf(c_16932,plain,
( ~ totalorderedP(sk1)
| ~ segmentP(sk4,sk1) ),
inference(paramod,[status(thm)],[c_202,c_212]) ).
cnf(c_16933,plain,
( ~ totalorderedP(sk1)
| ~ segmentP(sk4,sk3) ),
inference(paramod,[status(thm)],[c_203,c_16932]) ).
cnf(c_16934,plain,
( ~ totalorderedP(sk3)
| ~ segmentP(sk4,sk3) ),
inference(paramod,[status(thm)],[c_203,c_16933]) ).
cnf(c_213,plain,
~ segmentP(sk4,sk3),
inference(resolve,[status(thm)],[c_207,c_16934]) ).
cnf(c_16935,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk4)
| ~ ssList(sk3)
| ~ ssList(sk5)
| ~ ssList(sk6) ),
inference(resolve,[status(thm)],[c_206,c_190]) ).
cnf(c_16936,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk4)
| ~ ssList(sk3)
| ~ ssList(sk5) ),
inference(resolve,[status(thm)],[c_205,c_16935]) ).
cnf(c_16937,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk4)
| ~ ssList(sk3) ),
inference(resolve,[status(thm)],[c_204,c_16936]) ).
cnf(c_16938,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk4) ),
inference(resolve,[status(thm)],[c_200,c_16937]) ).
cnf(c_16939,plain,
segmentP(sk4,sk3),
inference(resolve,[status(thm)],[c_201,c_16938]) ).
cnf(c_16931,plain,
$false,
inference(resolve,[status(thm)],[c_213,c_16939]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC339-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.35 % Computer : n026.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 12:52:40 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 1026191 was started by sandbox on n026,
% 0.08/0.35 % Sat Sep 26 12:52:40 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.36
% 0.08/0.36 % From the command line: assign(max_seconds, 300).
% 40.31/5.58
% 40.31/5.58 % SZS status Unsatisfiable for theBenchmark
% 40.31/5.58
% 40.31/5.58 % Proof 1 at 4.57 (+ 0.58) seconds.
% 40.31/5.58 % Length of proof is 12.
% 40.31/5.58 % Level of proof is 2.
% 40.31/5.58 % Maximum clause weight is 38.000.
% 40.31/5.58 % Given clauses 164.
% 40.31/5.58
% 40.31/5.58 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------