%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : HWV021-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 : n002.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:21 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.73s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 13 unt; 0 def)
% Number of atoms : 78 ( 7 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 98 ( 49 ~; 49 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_52,axiom,
! [VAR_0] :
( ~ p_Rd_error(plus(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_52) ).
cnf(c_24,plain,
( ~ p_Rd_error(plus(A,n1))
| ~ gt(int_level(A),n0)
| ~ p_Rd(A)
| ~ p_Wr(A)
| p_Reset(A) ),
inference(clausify,[status(thm)],[axiom_52]) ).
fof(axiom_70,axiom,
! [VAR_0] :
( ~ p_Rd_error(plus(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_70) ).
cnf(c_44,plain,
( ~ p_Rd_error(plus(A,n1))
| ~ gt(int_level(A),n0)
| ~ p_Rd(A)
| p_Wr(A)
| p_Reset(A) ),
inference(clausify,[status(thm)],[axiom_70]) ).
fof(axiom_15,axiom,
! [VAR_0] :
( gt(VAR_0,n0)
| VAR_0 = n0 ),
file('theBenchmark.p',axiom_15) ).
cnf(c_121,plain,
( gt(A,n0)
| A = n0 ),
inference(clausify,[status(thm)],[axiom_15]) ).
cnf(c_122,plain,
( gt(A,n0)
| n0 = A ),
inference(copy,[status(thm)],[c_121]) ).
fof(axiom_24,axiom,
! [VAR_0] :
( p_Empty(VAR_0)
| int_level(VAR_0) != n0 ),
file('theBenchmark.p',axiom_24) ).
cnf(c_130,plain,
( p_Empty(A)
| int_level(A) != n0 ),
inference(clausify,[status(thm)],[axiom_24]) ).
fof(quest_1,axiom,
p_Rd_error(plus(t_139,n1)),
file('theBenchmark.p',quest_1) ).
cnf(c_139,plain,
p_Rd_error(plus(t_139,n1)),
inference(clausify,[status(thm)],[quest_1]) ).
fof(quest_2,axiom,
p_Rd(t_139),
file('theBenchmark.p',quest_2) ).
cnf(c_140,plain,
p_Rd(t_139),
inference(clausify,[status(thm)],[quest_2]) ).
fof(quest_3,axiom,
~ p_Reset(t_139),
file('theBenchmark.p',quest_3) ).
cnf(c_141,plain,
~ p_Reset(t_139),
inference(clausify,[status(thm)],[quest_3]) ).
fof(quest_4,axiom,
~ p_Empty(t_139),
file('theBenchmark.p',quest_4) ).
cnf(c_142,plain,
~ p_Empty(t_139),
inference(clausify,[status(thm)],[quest_4]) ).
cnf(c_227,plain,
( ~ p_Rd_error(plus(A,n1))
| ~ gt(int_level(A),n0)
| ~ p_Rd(A)
| p_Reset(A)
| ~ p_Rd_error(plus(A,n1))
| ~ gt(int_level(A),n0)
| ~ p_Rd(A)
| p_Reset(A) ),
inference(resolve,[status(thm)],[c_44,c_24]) ).
cnf(c_1076,plain,
( ~ p_Rd_error(plus(A,n1))
| ~ gt(int_level(A),n0)
| ~ p_Rd(A)
| ~ p_Rd_error(plus(A,n1))
| ~ gt(int_level(A),n0)
| ~ p_Rd(A)
| p_Reset(A) ),
inference(copy,[status(thm)],[c_227]) ).
cnf(c_1077,plain,
( ~ p_Rd_error(plus(A,n1))
| ~ gt(int_level(A),n0)
| ~ p_Rd_error(plus(A,n1))
| ~ gt(int_level(A),n0)
| ~ p_Rd(A)
| p_Reset(A) ),
inference(copy,[status(thm)],[c_1076]) ).
cnf(c_1078,plain,
( ~ p_Rd_error(plus(A,n1))
| ~ p_Rd_error(plus(A,n1))
| ~ gt(int_level(A),n0)
| ~ p_Rd(A)
| p_Reset(A) ),
inference(copy,[status(thm)],[c_1077]) ).
cnf(c_228,plain,
( ~ p_Rd_error(plus(A,n1))
| ~ gt(int_level(A),n0)
| ~ p_Rd(A)
| p_Reset(A) ),
inference(copy,[status(thm)],[c_1078]) ).
cnf(c_1079,plain,
( ~ p_Rd_error(plus(t_139,n1))
| ~ gt(int_level(t_139),n0)
| p_Reset(t_139) ),
inference(resolve,[status(thm)],[c_228,c_140]) ).
cnf(c_1080,plain,
( ~ p_Rd_error(plus(t_139,n1))
| ~ gt(int_level(t_139),n0) ),
inference(resolve,[status(thm)],[c_141,c_1079]) ).
cnf(c_640,plain,
~ gt(int_level(t_139),n0),
inference(resolve,[status(thm)],[c_139,c_1080]) ).
cnf(c_1081,plain,
n0 = int_level(t_139),
inference(resolve,[status(thm)],[c_640,c_122]) ).
cnf(c_975,plain,
int_level(t_139) = n0,
inference(copy,[status(thm)],[c_1081]) ).
cnf(c_1082,plain,
p_Empty(t_139),
inference(resolve,[status(thm)],[c_975,c_130]) ).
cnf(c_1075,plain,
$false,
inference(resolve,[status(thm)],[c_142,c_1082]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV021-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.09/0.57 % Computer : n002.cluster.edu
% 0.09/0.57 % Model : x86_64 x86_64
% 0.09/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57 % Memory : 8046.5625MB
% 0.09/0.57 % OS : Linux 6.8.0-71-generic
% 0.09/0.57 % CPULimit : 300
% 0.09/0.57 % WCLimit : 300
% 0.09/0.57 % DateTime : Fri Sep 25 16:04:36 UTC 2026
% 0.09/0.58 % CPUTime :
% 0.09/0.58 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.58 % Process 3716380 was started by sandbox on n002,
% 0.09/0.58 % Fri Sep 25 16:04:36 2026
% 0.09/0.58 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.58
% 0.09/0.58 % From the command line: assign(max_seconds, 300).
% 0.13/0.73
% 0.13/0.73 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.73
% 0.13/0.73 % Proof 1 at 0.12 (+ 0.02) seconds.
% 0.13/0.73 % Length of proof is 14.
% 0.13/0.73 % Level of proof is 5.
% 0.13/0.73 % Maximum clause weight is 22.000.
% 0.13/0.73 % Given clauses 131.
% 0.13/0.73
% 0.13/0.73 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------