%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC349-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:57:33 AM UTC 2026
% Result : Unsatisfiable 10.15s 12.35s
% Output : CNFRefutation 10.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 13 unt; 0 def)
% Number of atoms : 17 ( 6 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 2 ( 0 sgn 1 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause60,axiom,
! [VAR_0] :
( frontsegP(VAR_0,nil)
| ~ ssList(VAR_0) ),
file('theBenchmark.p',clause60) ).
cnf(c_104,plain,
( frontsegP(A,nil)
| ~ ssList(A) ),
inference(clausify,[status(thm)],[clause60]) ).
fof(co1_2,axiom,
ssList(sk2),
file('theBenchmark.p',co1_2) ).
cnf(c_202,plain,
ssList(sk2),
inference(clausify,[status(thm)],[co1_2]) ).
fof(co1_5,axiom,
nil = sk3,
file('theBenchmark.p',co1_5) ).
cnf(c_205,plain,
nil = sk3,
inference(clausify,[status(thm)],[co1_5]) ).
cnf(c_206,plain,
sk3 = nil,
inference(copy,[status(thm)],[c_205]) ).
fof(co1_7,axiom,
sk1 = sk3,
file('theBenchmark.p',co1_7) ).
cnf(c_209,plain,
sk1 = sk3,
inference(clausify,[status(thm)],[co1_7]) ).
cnf(c_210,plain,
sk1 = nil,
inference(paramod,[status(thm)],[c_206,c_209]) ).
fof(co1_9,axiom,
~ frontsegP(sk2,sk1),
file('theBenchmark.p',co1_9) ).
cnf(c_211,plain,
~ frontsegP(sk2,sk1),
inference(clausify,[status(thm)],[co1_9]) ).
cnf(c_212,plain,
~ frontsegP(sk2,nil),
inference(paramod,[status(thm)],[c_210,c_211]) ).
cnf(c_7063,plain,
frontsegP(sk2,nil),
inference(resolve,[status(thm)],[c_202,c_104]) ).
cnf(c_7062,plain,
$false,
inference(resolve,[status(thm)],[c_212,c_7063]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC349-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/11.01 % Computer : n010.cluster.edu
% 0.10/11.01 % Model : x86_64 x86_64
% 0.10/11.01 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/11.01 % Memory : 8046.5625MB
% 0.10/11.01 % OS : Linux 6.8.0-71-generic
% 0.10/11.01 % CPULimit : 300
% 0.10/11.01 % WCLimit : 300
% 0.10/11.01 % DateTime : Sat Sep 26 12:52:28 UTC 2026
% 0.10/11.01 % CPUTime :
% 0.10/11.01 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/11.01 % Process 3362674 was started by sandbox2 on n010,
% 0.10/11.01 % Sat Sep 26 12:52:28 2026
% 0.10/11.01 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/11.02
% 0.10/11.02 % From the command line: assign(max_seconds, 300).
% 10.15/12.35
% 10.15/12.35 % SZS status Unsatisfiable for theBenchmark
% 10.15/12.35
% 10.15/12.35 % Proof 1 at 1.02 (+ 0.21) seconds.
% 10.15/12.35 % Length of proof is 9.
% 10.15/12.35 % Level of proof is 4.
% 10.15/12.35 % Maximum clause weight is 7.000.
% 10.15/12.35 % Given clauses 158.
% 10.15/12.35
% 10.15/12.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------