↑ Up

Prover9---2026-6A.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : HWV013-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 : n004.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 0.12s 0.44s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (  17 unt;   0 def)
%            Number of atoms       :   36 (  12 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   29 (  15   ~;  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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :    4 (   0 sgn   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(quest_4,axiom,
    p_Wr(x_139),
    file('theBenchmark.p',quest_4) ).

cnf(c_32,plain,
    p_Wr(x_139),
    inference(clausify,[status(thm)],[quest_4]) ).

fof(axiom_35,axiom,
    ! [VAR_0] :
      ( int_level(plus(VAR_0,n1)) = plus(int_level(VAR_0),n1)
      | ~ gt(fifo_length,int_level(VAR_0))
      | p_Rd(VAR_0)
      | ~ p_Wr(VAR_0)
      | p_Reset(VAR_0) ),
    file('theBenchmark.p',axiom_35) ).

cnf(c_65,plain,
    ( int_level(plus(A,n1)) = plus(int_level(A),n1)
    | ~ gt(fifo_length,int_level(A))
    | p_Rd(A)
    | ~ p_Wr(A)
    | p_Reset(A) ),
    inference(clausify,[status(thm)],[axiom_35]) ).

cnf(c_83,plain,
    ( int_level(plus(x_139,n1)) = plus(int_level(x_139),n1)
    | ~ gt(fifo_length,int_level(x_139))
    | p_Rd(x_139)
    | p_Reset(x_139) ),
    inference(resolve,[status(thm)],[c_65,c_32]) ).

fof(axiom_21,axiom,
    ! [VAR_0] : level(VAR_0) = int_level(VAR_0),
    file('theBenchmark.p',axiom_21) ).

cnf(c_483,plain,
    level(A) = int_level(A),
    inference(clausify,[status(thm)],[axiom_21]) ).

fof(quest_1,axiom,
    ~ p_Reset(x_139),
    file('theBenchmark.p',quest_1) ).

cnf(c_491,plain,
    ~ p_Reset(x_139),
    inference(clausify,[status(thm)],[quest_1]) ).

fof(quest_2,axiom,
    gt(fifo_length,level(x_139)),
    file('theBenchmark.p',quest_2) ).

cnf(c_492,plain,
    gt(fifo_length,level(x_139)),
    inference(clausify,[status(thm)],[quest_2]) ).

cnf(c_493,plain,
    gt(fifo_length,int_level(x_139)),
    inference(paramod,[status(thm)],[c_483,c_492]) ).

fof(quest_3,axiom,
    ~ p_Rd(x_139),
    file('theBenchmark.p',quest_3) ).

cnf(c_494,plain,
    ~ p_Rd(x_139),
    inference(clausify,[status(thm)],[quest_3]) ).

fof(quest_5,axiom,
    level(plus(x_139,n1)) != plus(level(x_139),n1),
    file('theBenchmark.p',quest_5) ).

cnf(c_495,plain,
    level(plus(x_139,n1)) != plus(level(x_139),n1),
    inference(clausify,[status(thm)],[quest_5]) ).

cnf(c_522,plain,
    int_level(plus(x_139,n1)) != plus(level(x_139),n1),
    inference(paramod,[status(thm)],[c_483,c_495]) ).

cnf(c_496,plain,
    int_level(plus(x_139,n1)) != plus(int_level(x_139),n1),
    inference(paramod,[status(thm)],[c_483,c_522]) ).

cnf(c_523,plain,
    ( int_level(plus(x_139,n1)) = plus(int_level(x_139),n1)
    | ~ gt(fifo_length,int_level(x_139))
    | p_Rd(x_139) ),
    inference(resolve,[status(thm)],[c_491,c_83]) ).

cnf(c_524,plain,
    ( int_level(plus(x_139,n1)) = plus(int_level(x_139),n1)
    | ~ gt(fifo_length,int_level(x_139)) ),
    inference(resolve,[status(thm)],[c_494,c_523]) ).

cnf(c_525,plain,
    int_level(plus(x_139,n1)) = plus(int_level(x_139),n1),
    inference(resolve,[status(thm)],[c_493,c_524]) ).

cnf(c_521,plain,
    $false,
    inference(resolve,[status(thm)],[c_496,c_525]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV013-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.11/0.35  % Computer : n004.cluster.edu
% 0.11/0.35  % Model    : x86_64 x86_64
% 0.11/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35  % Memory   : 8046.5625MB
% 0.11/0.35  % OS       : Linux 6.8.0-71-generic
% 0.11/0.35  % CPULimit : 300
% 0.11/0.35  % WCLimit  : 300
% 0.11/0.35  % DateTime : Fri Sep 25 16:01:06 UTC 2026
% 0.11/0.35  % CPUTime  : 
% 0.12/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.36  % Process 3606620 was started by sandbox on n004,
% 0.12/0.36  % Fri Sep 25 16:01:06 2026
% 0.12/0.36  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.12/0.36  
% 0.12/0.36  % From the command line: assign(max_seconds, 300).
% 0.12/0.44  
% 0.12/0.44  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.44  
% 0.12/0.44  % Proof 1 at 0.07 (+ 0.00) seconds.
% 0.12/0.44  % Length of proof is 11.
% 0.12/0.44  % Level of proof is 2.
% 0.12/0.44  % Maximum clause weight is 32.000.
% 0.12/0.44  % Given clauses 0.
% 0.12/0.44  
% 0.12/0.44  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------