↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : HWV015-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 : n026.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 1.11s 0.56s
% Output   : CNFRefutation 1.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   24 (  19 unt;   0 def)
%            Number of atoms       :   38 (  14 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   33 (  19   ~;  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_3,axiom,
    p_Wr(x_139),
    file('theBenchmark.p',quest_3) ).

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

fof(axiom_53,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_53) ).

cnf(c_47,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_53]) ).

cnf(c_232,plain,
    ( int_level(plus(x_139,n1)) = int_level(x_139)
    | ~ gt(int_level(x_139),n0)
    | ~ p_Rd(x_139)
    | p_Reset(x_139) ),
    inference(resolve,[status(thm)],[c_47,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,
    gt(level(x_139),n0),
    file('theBenchmark.p',quest_1) ).

cnf(c_491,plain,
    gt(level(x_139),n0),
    inference(clausify,[status(thm)],[quest_1]) ).

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

cnf(c_492,plain,
    p_Rd(x_139),
    inference(clausify,[status(thm)],[quest_2]) ).

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

cnf(c_493,plain,
    ~ p_Reset(x_139),
    inference(clausify,[status(thm)],[quest_4]) ).

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

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

cnf(c_754,plain,
    ( int_level(plus(x_139,n1)) = int_level(x_139)
    | ~ gt(int_level(x_139),n0)
    | ~ p_Rd(x_139) ),
    inference(resolve,[status(thm)],[c_493,c_232]) ).

cnf(c_520,plain,
    ( int_level(plus(x_139,n1)) = int_level(x_139)
    | ~ gt(int_level(x_139),n0) ),
    inference(resolve,[status(thm)],[c_492,c_754]) ).

cnf(c_669,plain,
    gt(int_level(x_139),n0),
    inference(paramod,[status(thm)],[c_483,c_491]) ).

cnf(c_670,plain,
    int_level(plus(x_139,n1)) = int_level(x_139),
    inference(resolve,[status(thm)],[c_669,c_520]) ).

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

cnf(c_671,plain,
    level(x_139) != int_level(plus(x_139,n1)),
    inference(copy,[status(thm)],[c_755]) ).

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

cnf(c_757,plain,
    int_level(plus(x_139,n1)) != int_level(x_139),
    inference(copy,[status(thm)],[c_756]) ).

cnf(c_753,plain,
    $false,
    inference(resolve,[status(thm)],[c_670,c_757]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : HWV015-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40  % Computer : n026.cluster.edu
% 0.14/0.40  % Model    : x86_64 x86_64
% 0.14/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40  % Memory   : 8046.5625MB
% 0.14/0.40  % OS       : Linux 6.8.0-71-generic
% 0.14/0.40  % CPULimit : 300
% 0.14/0.40  % WCLimit  : 300
% 0.14/0.40  % DateTime : Fri Sep 25 16:03:40 UTC 2026
% 0.14/0.40  % CPUTime  : 
% 0.14/0.41  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.14/0.41  % Process 2963670 was started by sandbox on n026,
% 0.14/0.41  % Fri Sep 25 16:03:40 2026
% 0.14/0.41  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/0.42  
% 0.14/0.42  % From the command line: assign(max_seconds, 300).
% 1.11/0.56  
% 1.11/0.56  % SZS status Unsatisfiable for theBenchmark
% 1.11/0.56  
% 1.11/0.56  % Proof 1 at 0.12 (+ 0.01) seconds.
% 1.11/0.56  % Length of proof is 13.
% 1.11/0.56  % Level of proof is 4.
% 1.11/0.56  % Maximum clause weight is 30.000.
% 1.11/0.56  % Given clauses 150.
% 1.11/0.56  
% 1.11/0.56  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------