%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KRS091+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 : n011.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.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 6 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 6 ~; 3 |; 1 &)
% ( 1 <=>; 1 =>; 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 : 5 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( cc(X)
& cd(X) ) ),
file('theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X] :
( cc(X)
=> ~ cd(X) ),
file('theBenchmark.p',axiom_3) ).
cnf(c_11,plain,
( cc(A)
| ~ cUnsatisfiable(A) ),
inference(clausify,[status(thm)],[axiom_2]) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_20_00819),
file('theBenchmark.p',axiom_8) ).
cnf(c_13,plain,
cUnsatisfiable(i2003_11_14_17_20_00819),
inference(clausify,[status(thm)],[axiom_8]) ).
cnf(c_14,plain,
( cd(A)
| ~ cUnsatisfiable(A) ),
inference(clausify,[status(thm)],[axiom_2]) ).
cnf(c_15,plain,
( ~ cd(A)
| ~ cc(A) ),
inference(clausify,[status(thm)],[axiom_3]) ).
cnf(c_16,plain,
cd(i2003_11_14_17_20_00819),
inference(resolve,[status(thm)],[c_14,c_13]) ).
cnf(c_19,plain,
~ cc(i2003_11_14_17_20_00819),
inference(resolve,[status(thm)],[c_15,c_16]) ).
cnf(c_21,plain,
cc(i2003_11_14_17_20_00819),
inference(resolve,[status(thm)],[c_11,c_13]) ).
cnf(c_22,plain,
$false,
inference(resolve,[status(thm)],[c_21,c_19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KRS091+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 % Computer : n011.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Fri Sep 25 19:39:15 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.45 % Process 2710430 was started by sandbox2 on n011,
% 0.18/0.45 % Fri Sep 25 19:39:15 2026
% 0.18/0.45 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/0.46
% 0.18/0.46 % From the command line: assign(max_seconds, 300).
% 0.18/0.47
% 0.18/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.47
% 0.18/0.47 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.18/0.47 % Length of proof is 10.
% 0.18/0.47 % Level of proof is 4.
% 0.18/0.47 % Maximum clause weight is 0.000.
% 0.18/0.47 % Given clauses 0.
% 0.18/0.47
% 0.18/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------