%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : HWV014-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n016.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:34:19 AM UTC 2026
% Result : Unsatisfiable 1.04s 0.51s
% Output : CNFRefutation 1.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 19 unt; 0 def)
% Number of atoms : 38 ( 14 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 31 ( 17 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quest_2,axiom,
p_Rd(x_139),
file('theBenchmark.p',quest_2) ).
cnf(c_16,plain,
p_Rd(x_139),
inference(clausify,[status(thm)],[quest_2]) ).
fof(axiom_71,axiom,
! [VAR_0] :
( int_level(plus(VAR_0,n1)) = minus(int_level(VAR_0),n1)
| ~ gt(int_level(VAR_0),n0)
| ~ p_Rd(VAR_0)
| p_Wr(VAR_0)
| p_Reset(VAR_0) ),
file('theBenchmark.p',axiom_71) ).
cnf(c_25,plain,
( int_level(plus(A,n1)) = minus(int_level(A),n1)
| ~ gt(int_level(A),n0)
| ~ p_Rd(A)
| p_Wr(A)
| p_Reset(A) ),
inference(clausify,[status(thm)],[axiom_71]) ).
cnf(c_502,plain,
( int_level(plus(x_139,n1)) = minus(int_level(x_139),n1)
| ~ gt(int_level(x_139),n0)
| p_Wr(x_139)
| p_Reset(x_139) ),
inference(resolve,[status(thm)],[c_25,c_16]) ).
fof(axiom_21,axiom,
! [VAR_0] : level(VAR_0) = int_level(VAR_0),
file('theBenchmark.p',axiom_21) ).
cnf(c_598,plain,
level(A) = int_level(A),
inference(clausify,[status(thm)],[axiom_21]) ).
fof(quest_1,axiom,
gt(level(x_139),n0),
file('theBenchmark.p',quest_1) ).
cnf(c_611,plain,
gt(level(x_139),n0),
inference(clausify,[status(thm)],[quest_1]) ).
fof(quest_3,axiom,
~ p_Wr(x_139),
file('theBenchmark.p',quest_3) ).
cnf(c_612,plain,
~ p_Wr(x_139),
inference(clausify,[status(thm)],[quest_3]) ).
fof(quest_4,axiom,
~ p_Reset(x_139),
file('theBenchmark.p',quest_4) ).
cnf(c_613,plain,
~ p_Reset(x_139),
inference(clausify,[status(thm)],[quest_4]) ).
fof(quest_5,axiom,
level(plus(x_139,n1)) != minus(level(x_139),n1),
file('theBenchmark.p',quest_5) ).
cnf(c_614,plain,
level(plus(x_139,n1)) != minus(level(x_139),n1),
inference(clausify,[status(thm)],[quest_5]) ).
cnf(c_1029,plain,
( int_level(plus(x_139,n1)) = minus(int_level(x_139),n1)
| ~ gt(int_level(x_139),n0)
| p_Wr(x_139) ),
inference(resolve,[status(thm)],[c_613,c_502]) ).
cnf(c_646,plain,
( int_level(plus(x_139,n1)) = minus(int_level(x_139),n1)
| ~ gt(int_level(x_139),n0) ),
inference(resolve,[status(thm)],[c_612,c_1029]) ).
cnf(c_912,plain,
gt(int_level(x_139),n0),
inference(paramod,[status(thm)],[c_598,c_611]) ).
cnf(c_914,plain,
int_level(plus(x_139,n1)) = minus(int_level(x_139),n1),
inference(resolve,[status(thm)],[c_912,c_646]) ).
cnf(c_1030,plain,
int_level(plus(x_139,n1)) != minus(level(x_139),n1),
inference(paramod,[status(thm)],[c_598,c_614]) ).
cnf(c_921,plain,
minus(level(x_139),n1) != int_level(plus(x_139,n1)),
inference(copy,[status(thm)],[c_1030]) ).
cnf(c_1031,plain,
minus(int_level(x_139),n1) != int_level(plus(x_139,n1)),
inference(paramod,[status(thm)],[c_598,c_921]) ).
cnf(c_1032,plain,
int_level(plus(x_139,n1)) != minus(int_level(x_139),n1),
inference(copy,[status(thm)],[c_1031]) ).
cnf(c_1028,plain,
$false,
inference(resolve,[status(thm)],[c_914,c_1032]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HWV014-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n016.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Fri Sep 25 16:05:59 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.02/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.02/0.36 % Process 2815019 was started by sandbox on n016,
% 0.02/0.36 % Fri Sep 25 16:05:59 2026
% 0.02/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.02/0.36
% 0.02/0.36 % From the command line: assign(max_seconds, 300).
% 1.04/0.51
% 1.04/0.51 % SZS status Unsatisfiable for theBenchmark
% 1.04/0.51
% 1.04/0.51 % Proof 1 at 0.12 (+ 0.01) seconds.
% 1.04/0.51 % Length of proof is 13.
% 1.04/0.51 % Level of proof is 4.
% 1.04/0.51 % Maximum clause weight is 32.000.
% 1.04/0.51 % Given clauses 232.
% 1.04/0.51
% 1.04/0.51 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------