%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : HWV017-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 : 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 07:34:20 AM UTC 2026
% Result : Unsatisfiable 2.60s 0.79s
% Output : CNFRefutation 2.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 24 unt; 0 def)
% Number of atoms : 100 ( 23 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 78 ( 22 ~; 56 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_23,axiom,
! [VAR_0] :
( ~ p_Full(VAR_0)
| int_level(VAR_0) = fifo_length ),
file('theBenchmark.p',axiom_23) ).
cnf(c_5,plain,
( ~ p_Full(A)
| int_level(A) = fifo_length ),
inference(clausify,[status(thm)],[axiom_23]) ).
fof(quest_5,axiom,
p_Full(plus(t_139,n1)),
file('theBenchmark.p',quest_5) ).
cnf(c_6,plain,
p_Full(plus(t_139,n1)),
inference(clausify,[status(thm)],[quest_5]) ).
fof(axiom_82,axiom,
! [VAR_0] :
( int_level(plus(VAR_0,n1)) = int_level(VAR_0)
| p_Rd(VAR_0)
| p_Wr(VAR_0)
| p_Reset(VAR_0) ),
file('theBenchmark.p',axiom_82) ).
cnf(c_12,plain,
( int_level(plus(A,n1)) = int_level(A)
| p_Rd(A)
| p_Wr(A)
| p_Reset(A) ),
inference(clausify,[status(thm)],[axiom_82]) ).
fof(quest_2,axiom,
p_Rd(t_139),
file('theBenchmark.p',quest_2) ).
cnf(c_17,plain,
p_Rd(t_139),
inference(clausify,[status(thm)],[quest_2]) ).
fof(axiom_78,axiom,
! [VAR_0] :
( int_level(plus(VAR_0,n1)) = int_level(VAR_0)
| gt(int_level(VAR_0),n0)
| ~ p_Rd(VAR_0)
| p_Wr(VAR_0)
| p_Reset(VAR_0) ),
file('theBenchmark.p',axiom_78) ).
cnf(c_19,plain,
( int_level(plus(A,n1)) = int_level(A)
| gt(int_level(A),n0)
| ~ p_Rd(A)
| p_Wr(A)
| p_Reset(A) ),
inference(clausify,[status(thm)],[axiom_78]) ).
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_26,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_503,plain,
( int_level(plus(t_139,n1)) = minus(int_level(t_139),n1)
| ~ gt(int_level(t_139),n0)
| p_Wr(t_139)
| p_Reset(t_139) ),
inference(resolve,[status(thm)],[c_26,c_17]) ).
cnf(c_568,plain,
( int_level(plus(A,n1)) = int_level(A)
| p_Wr(A)
| p_Reset(A)
| int_level(plus(A,n1)) = int_level(A)
| gt(int_level(A),n0)
| p_Wr(A)
| p_Reset(A) ),
inference(resolve,[status(thm)],[c_19,c_12]) ).
cnf(c_1390,plain,
( int_level(plus(A,n1)) = int_level(A)
| p_Wr(A)
| int_level(plus(A,n1)) = int_level(A)
| gt(int_level(A),n0)
| p_Wr(A)
| p_Reset(A) ),
inference(copy,[status(thm)],[c_568]) ).
cnf(c_1391,plain,
( int_level(plus(A,n1)) = int_level(A)
| int_level(plus(A,n1)) = int_level(A)
| gt(int_level(A),n0)
| p_Wr(A)
| p_Reset(A) ),
inference(copy,[status(thm)],[c_1390]) ).
cnf(c_569,plain,
( int_level(plus(A,n1)) = int_level(A)
| gt(int_level(A),n0)
| p_Wr(A)
| p_Reset(A) ),
inference(copy,[status(thm)],[c_1391]) ).
cnf(c_581,plain,
int_level(plus(t_139,n1)) = fifo_length,
inference(resolve,[status(thm)],[c_5,c_6]) ).
cnf(c_582,plain,
fifo_length = int_level(plus(t_139,n1)),
inference(copy,[status(thm)],[c_581]) ).
fof(axiom_3,axiom,
! [VAR_0] :
( gt(VAR_0,minus(VAR_0,n1))
| ~ gt(VAR_0,n0) ),
file('theBenchmark.p',axiom_3) ).
cnf(c_585,plain,
( gt(A,minus(A,n1))
| ~ gt(A,n0) ),
inference(clausify,[status(thm)],[axiom_3]) ).
fof(axiom_21,axiom,
! [VAR_0] : level(VAR_0) = int_level(VAR_0),
file('theBenchmark.p',axiom_21) ).
cnf(c_601,plain,
level(A) = int_level(A),
inference(clausify,[status(thm)],[axiom_21]) ).
fof(quest_1,axiom,
~ gt(level(t_139),fifo_length),
file('theBenchmark.p',quest_1) ).
cnf(c_614,plain,
~ gt(level(t_139),fifo_length),
inference(clausify,[status(thm)],[quest_1]) ).
cnf(c_1392,plain,
~ gt(int_level(t_139),fifo_length),
inference(paramod,[status(thm)],[c_601,c_614]) ).
cnf(c_615,plain,
~ gt(int_level(t_139),int_level(plus(t_139,n1))),
inference(paramod,[status(thm)],[c_582,c_1392]) ).
fof(quest_3,axiom,
~ p_Wr(t_139),
file('theBenchmark.p',quest_3) ).
cnf(c_616,plain,
~ p_Wr(t_139),
inference(clausify,[status(thm)],[quest_3]) ).
fof(quest_4,axiom,
~ p_Reset(t_139),
file('theBenchmark.p',quest_4) ).
cnf(c_617,plain,
~ p_Reset(t_139),
inference(clausify,[status(thm)],[quest_4]) ).
fof(quest_6,axiom,
gt(fifo_length,n0),
file('theBenchmark.p',quest_6) ).
cnf(c_618,plain,
gt(fifo_length,n0),
inference(clausify,[status(thm)],[quest_6]) ).
cnf(c_619,plain,
gt(int_level(plus(t_139,n1)),n0),
inference(paramod,[status(thm)],[c_582,c_618]) ).
cnf(c_1393,plain,
( int_level(plus(t_139,n1)) = minus(int_level(t_139),n1)
| ~ gt(int_level(t_139),n0)
| p_Wr(t_139) ),
inference(resolve,[status(thm)],[c_617,c_503]) ).
cnf(c_744,plain,
( int_level(plus(t_139,n1)) = minus(int_level(t_139),n1)
| ~ gt(int_level(t_139),n0) ),
inference(resolve,[status(thm)],[c_616,c_1393]) ).
cnf(c_1394,plain,
( gt(int_level(t_139),n0)
| gt(int_level(t_139),n0)
| p_Wr(t_139)
| p_Reset(t_139) ),
inference(paramod,[status(thm)],[c_569,c_619]) ).
cnf(c_1395,plain,
( gt(int_level(t_139),n0)
| p_Wr(t_139)
| p_Reset(t_139) ),
inference(copy,[status(thm)],[c_1394]) ).
cnf(c_1396,plain,
( gt(int_level(t_139),n0)
| p_Wr(t_139) ),
inference(resolve,[status(thm)],[c_617,c_1395]) ).
cnf(c_1150,plain,
gt(int_level(t_139),n0),
inference(resolve,[status(thm)],[c_616,c_1396]) ).
cnf(c_1163,plain,
int_level(plus(t_139,n1)) = minus(int_level(t_139),n1),
inference(resolve,[status(thm)],[c_1150,c_744]) ).
cnf(c_1200,plain,
~ gt(int_level(t_139),minus(int_level(t_139),n1)),
inference(paramod,[status(thm)],[c_1163,c_615]) ).
cnf(c_1397,plain,
gt(int_level(t_139),minus(int_level(t_139),n1)),
inference(resolve,[status(thm)],[c_1150,c_585]) ).
cnf(c_1389,plain,
$false,
inference(resolve,[status(thm)],[c_1200,c_1397]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HWV017-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.34 % Computer : n014.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8046.5625MB
% 0.11/0.34 % OS : Linux 6.8.0-71-generic
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Fri Sep 25 16:01:17 UTC 2026
% 0.11/0.34 % CPUTime :
% 0.11/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.35 % Process 622845 was started by sandbox on n014,
% 0.11/0.35 % Fri Sep 25 16:01:17 2026
% 0.11/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/0.35
% 0.11/0.35 % From the command line: assign(max_seconds, 300).
% 2.60/0.79
% 2.60/0.79 % SZS status Unsatisfiable for theBenchmark
% 2.60/0.79
% 2.60/0.79 % Proof 1 at 0.29 (+ 0.05) seconds.
% 2.60/0.79 % Length of proof is 24.
% 2.60/0.79 % Level of proof is 7.
% 2.60/0.79 % Maximum clause weight is 23.000.
% 2.60/0.79 % Given clauses 122.
% 2.60/0.79
% 2.60/0.79 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------