%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KRS094+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n003.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 07:46:01 AM UTC 2026
% Result : Unsatisfiable 0.20s 0.61s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 6 unt; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 6 ~; 3 |; 0 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X] :
( cUnsatisfiable(X)
<=> cc1(X) ),
file('theBenchmark.p',axiom_2) ).
fof(axiom_4,axiom,
! [X] :
( cc1(X)
=> ~ cd1(X) ),
file('theBenchmark.p',axiom_4) ).
fof(axiom_5,axiom,
! [X] :
( cc1(X)
=> cd1(X) ),
file('theBenchmark.p',axiom_5) ).
cnf(c_11,plain,
( cc1(A)
| ~ cUnsatisfiable(A) ),
inference(clausify,[status(thm)],[axiom_2]) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_20_11330),
file('theBenchmark.p',axiom_8) ).
cnf(c_13,plain,
cUnsatisfiable(i2003_11_14_17_20_11330),
inference(clausify,[status(thm)],[axiom_8]) ).
cnf(c_14,plain,
( ~ cd1(A)
| ~ cc1(A) ),
inference(clausify,[status(thm)],[axiom_4]) ).
cnf(c_15,plain,
cc1(i2003_11_14_17_20_11330),
inference(resolve,[status(thm)],[c_11,c_13]) ).
cnf(c_16,plain,
( cd1(A)
| ~ cc1(A) ),
inference(clausify,[status(thm)],[axiom_5]) ).
cnf(c_21,plain,
~ cd1(i2003_11_14_17_20_11330),
inference(resolve,[status(thm)],[c_14,c_15]) ).
cnf(c_22,plain,
cd1(i2003_11_14_17_20_11330),
inference(resolve,[status(thm)],[c_16,c_15]) ).
cnf(c_23,plain,
$false,
inference(resolve,[status(thm)],[c_21,c_22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KRS094+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.59 % Computer : n003.cluster.edu
% 0.15/0.59 % Model : x86_64 x86_64
% 0.15/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.59 % Memory : 8046.5625MB
% 0.15/0.59 % OS : Linux 6.8.0-71-generic
% 0.15/0.59 % CPULimit : 300
% 0.15/0.59 % WCLimit : 300
% 0.15/0.59 % DateTime : Fri Sep 25 19:40:53 UTC 2026
% 0.15/0.59 % CPUTime :
% 0.15/0.59 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/0.59 % Process 912489 was started by sandbox2 on n003,
% 0.15/0.59 % Fri Sep 25 19:40:53 2026
% 0.15/0.59 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.20/0.60
% 0.20/0.60 % From the command line: assign(max_seconds, 300).
% 0.20/0.61
% 0.20/0.61 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.61
% 0.20/0.61 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.20/0.61 % Length of proof is 11.
% 0.20/0.61 % Level of proof is 4.
% 0.20/0.61 % Maximum clause weight is 0.000.
% 0.20/0.61 % Given clauses 0.
% 0.20/0.61
% 0.20/0.61 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------