%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC365-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 : n014.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:36 AM UTC 2026
% Result : Unsatisfiable 0.77s 0.55s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 13 unt; 0 def)
% Number of atoms : 17 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1_11,axiom,
( rearsegP(sk4,sk3)
| ~ neq(sk4,nil) ),
file('theBenchmark.p',co1_11) ).
cnf(c_51,plain,
( rearsegP(sk4,sk3)
| ~ neq(sk4,nil) ),
inference(clausify,[status(thm)],[co1_11]) ).
fof(co1_8,axiom,
~ rearsegP(sk2,sk1),
file('theBenchmark.p',co1_8) ).
cnf(c_55,plain,
~ rearsegP(sk2,sk1),
inference(clausify,[status(thm)],[co1_8]) ).
fof(co1_7,axiom,
neq(sk2,nil),
file('theBenchmark.p',co1_7) ).
cnf(c_56,plain,
neq(sk2,nil),
inference(clausify,[status(thm)],[co1_7]) ).
fof(co1_6,axiom,
sk1 = sk3,
file('theBenchmark.p',co1_6) ).
cnf(c_57,plain,
sk1 = sk3,
inference(clausify,[status(thm)],[co1_6]) ).
fof(co1_5,axiom,
sk2 = sk4,
file('theBenchmark.p',co1_5) ).
cnf(c_58,plain,
sk2 = sk4,
inference(clausify,[status(thm)],[co1_5]) ).
cnf(c_585,plain,
~ rearsegP(sk4,sk1),
inference(paramod,[status(thm)],[c_58,c_55]) ).
cnf(c_319,plain,
~ rearsegP(sk4,sk3),
inference(paramod,[status(thm)],[c_57,c_585]) ).
cnf(c_320,plain,
neq(sk4,nil),
inference(paramod,[status(thm)],[c_58,c_56]) ).
cnf(c_586,plain,
rearsegP(sk4,sk3),
inference(resolve,[status(thm)],[c_320,c_51]) ).
cnf(c_584,plain,
$false,
inference(resolve,[status(thm)],[c_319,c_586]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC365-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n014.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 12:53:17 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 3198220 was started by sandbox on n014,
% 0.09/0.36 % Sat Sep 26 12:53:17 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.77/0.55
% 0.77/0.55 % SZS status Unsatisfiable for theBenchmark
% 0.77/0.55
% 0.77/0.55 % Proof 1 at 0.08 (+ 0.02) seconds.
% 0.77/0.55 % Length of proof is 8.
% 0.77/0.55 % Level of proof is 2.
% 0.77/0.55 % Maximum clause weight is 6.000.
% 0.77/0.55 % Given clauses 0.
% 0.77/0.55
% 0.77/0.55 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------