↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : HWV009-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 : 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:17 AM UTC 2026

% Result   : Unsatisfiable 9.68s 16.67s
% Output   : CNFRefutation 9.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (  10 unt;   0 def)
%            Number of atoms       :   36 (  10 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   31 (  16   ~;  15   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :    8 (   0 sgn   4   !;   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_30,axiom,
    ! [VAR_0] :
      ( ~ p_Rd_error(plus(VAR_0,n1))
      | ~ p_Reset(VAR_0) ),
    file('theBenchmark.p',axiom_30) ).

cnf(c_70,plain,
    ( ~ p_Rd_error(plus(A,n1))
    | ~ p_Reset(A) ),
    inference(clausify,[status(thm)],[axiom_30]) ).

fof(axiom_29,axiom,
    ! [VAR_0] :
      ( ~ p_Wr_error(plus(VAR_0,n1))
      | ~ p_Reset(VAR_0) ),
    file('theBenchmark.p',axiom_29) ).

cnf(c_71,plain,
    ( ~ p_Wr_error(plus(A,n1))
    | ~ p_Reset(A) ),
    inference(clausify,[status(thm)],[axiom_29]) ).

fof(axiom_26,axiom,
    ! [VAR_0] :
      ( int_level(plus(VAR_0,n1)) = n0
      | ~ p_Reset(VAR_0) ),
    file('theBenchmark.p',axiom_26) ).

cnf(c_74,plain,
    ( int_level(plus(A,n1)) = n0
    | ~ p_Reset(A) ),
    inference(clausify,[status(thm)],[axiom_26]) ).

cnf(c_501,plain,
    int_level(plus(t_139,n1)) = n0,
    inference(resolve,[status(thm)],[c_74,c_68]) ).

cnf(c_502,plain,
    n0 = int_level(plus(t_139,n1)),
    inference(copy,[status(thm)],[c_501]) ).

cnf(c_507,plain,
    ~ p_Wr_error(plus(t_139,n1)),
    inference(resolve,[status(thm)],[c_71,c_68]) ).

cnf(c_508,plain,
    ~ p_Rd_error(plus(t_139,n1)),
    inference(resolve,[status(thm)],[c_70,c_68]) ).

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

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

fof(quest_2,axiom,
    ( p_Rd_error(plus(t_139,n1))
    | p_Wr_error(plus(t_139,n1))
    | level(plus(t_139,n1)) != n0 ),
    file('theBenchmark.p',quest_2) ).

cnf(c_534,plain,
    ( p_Rd_error(plus(t_139,n1))
    | p_Wr_error(plus(t_139,n1))
    | level(plus(t_139,n1)) != n0 ),
    inference(clausify,[status(thm)],[quest_2]) ).

cnf(c_536,plain,
    ( p_Rd_error(plus(t_139,n1))
    | p_Wr_error(plus(t_139,n1))
    | int_level(plus(t_139,n1)) != n0 ),
    inference(paramod,[status(thm)],[c_533,c_534]) ).

cnf(c_537,plain,
    ( p_Rd_error(plus(t_139,n1))
    | p_Wr_error(plus(t_139,n1))
    | int_level(plus(t_139,n1)) != int_level(plus(t_139,n1)) ),
    inference(paramod,[status(thm)],[c_502,c_536]) ).

cnf(c_538,plain,
    ( p_Rd_error(plus(t_139,n1))
    | p_Wr_error(plus(t_139,n1)) ),
    inference(copy,[status(thm)],[c_537]) ).

cnf(c_539,plain,
    p_Rd_error(plus(t_139,n1)),
    inference(resolve,[status(thm)],[c_507,c_538]) ).

cnf(c_535,plain,
    $false,
    inference(resolve,[status(thm)],[c_508,c_539]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : HWV009-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/15.37  % Computer : n002.cluster.edu
% 0.09/15.37  % Model    : x86_64 x86_64
% 0.09/15.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/15.37  % Memory   : 8046.5625MB
% 0.09/15.37  % OS       : Linux 6.8.0-71-generic
% 0.09/15.38  % CPULimit : 300
% 0.09/15.38  % WCLimit  : 300
% 0.09/15.38  % DateTime : Fri Sep 25 16:03:21 UTC 2026
% 0.09/15.38  % CPUTime  : 
% 0.09/15.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/15.38  % Process 3712864 was started by sandbox2 on n002,
% 0.09/15.38  % Fri Sep 25 16:03:21 2026
% 0.09/15.38  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/15.39  
% 0.09/15.39  % From the command line: assign(max_seconds, 300).
% 9.68/16.67  
% 9.68/16.67  % SZS status Unsatisfiable for theBenchmark
% 9.68/16.67  
% 9.68/16.67  % Proof 1 at 1.26 (+ 0.01) seconds.
% 9.68/16.67  % Length of proof is 11.
% 9.68/16.67  % Level of proof is 3.
% 9.68/16.67  % Maximum clause weight is 21.000.
% 9.68/16.67  % Given clauses 0.
% 9.68/16.67  
% 9.68/16.67  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------