%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : HWV030-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.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:24 AM UTC 2026
% Result : Unsatisfiable 17.17s 7.66s
% Output : CNFRefutation 17.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 10 unt; 0 def)
% Number of atoms : 14 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 2 ( 0 sgn 1 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quest_1,axiom,
p_Reset(t_139),
file('theBenchmark.p',quest_1) ).
cnf(c_68,plain,
p_Reset(t_139),
inference(clausify,[status(thm)],[quest_1]) ).
fof(axiom_27,axiom,
! [VAR_0] :
( wr_level(plus(VAR_0,n1)) = n0
| ~ p_Reset(VAR_0) ),
file('theBenchmark.p',axiom_27) ).
cnf(c_73,plain,
( wr_level(plus(A,n1)) = n0
| ~ p_Reset(A) ),
inference(clausify,[status(thm)],[axiom_27]) ).
cnf(c_503,plain,
wr_level(plus(t_139,n1)) = n0,
inference(resolve,[status(thm)],[c_73,c_68]) ).
cnf(c_504,plain,
n0 = wr_level(plus(t_139,n1)),
inference(copy,[status(thm)],[c_503]) ).
fof(quest_2,axiom,
~ gt(fifo_length,wr_level(plus(t_139,n1))),
file('theBenchmark.p',quest_2) ).
cnf(c_530,plain,
~ gt(fifo_length,wr_level(plus(t_139,n1))),
inference(clausify,[status(thm)],[quest_2]) ).
fof(quest_3,axiom,
gt(fifo_length,n0),
file('theBenchmark.p',quest_3) ).
cnf(c_531,plain,
gt(fifo_length,n0),
inference(clausify,[status(thm)],[quest_3]) ).
cnf(c_2259,plain,
gt(fifo_length,wr_level(plus(t_139,n1))),
inference(paramod,[status(thm)],[c_504,c_531]) ).
cnf(c_2258,plain,
$false,
inference(resolve,[status(thm)],[c_530,c_2259]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV030-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/5.43 % Computer : n001.cluster.edu
% 0.15/5.43 % Model : x86_64 x86_64
% 0.15/5.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/5.43 % Memory : 8046.5625MB
% 0.15/5.43 % OS : Linux 6.8.0-71-generic
% 0.15/5.43 % CPULimit : 300
% 0.15/5.43 % WCLimit : 300
% 0.15/5.43 % DateTime : Fri Sep 25 16:08:16 UTC 2026
% 0.15/5.43 % CPUTime :
% 0.15/5.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/5.43 % Process 3778605 was started by sandbox2 on n001,
% 0.15/5.43 % Fri Sep 25 16:08:16 2026
% 0.15/5.43 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.15/5.44
% 0.15/5.44 % From the command line: assign(max_seconds, 300).
% 17.17/7.66
% 17.17/7.66 % SZS status Unsatisfiable for theBenchmark
% 17.17/7.66
% 17.17/7.66 % Proof 1 at 2.11 (+ 0.03) seconds.
% 17.17/7.66 % Length of proof is 7.
% 17.17/7.66 % Level of proof is 3.
% 17.17/7.66 % Maximum clause weight is 21.000.
% 17.17/7.66 % Given clauses 25.
% 17.17/7.66
% 17.17/7.66 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------