↑ Up

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

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

% Result   : Unsatisfiable 1.16s 0.59s
% Output   : CNFRefutation 1.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (   8 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   38 (  13   ~;  25   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    4 (   0 sgn   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_89,axiom,
    ! [VAR_0] :
      ( p_Wr_error(VAR_0)
      | ~ p_Wr_error(plus(VAR_0,n1))
      | p_Wr(VAR_0)
      | p_Reset(VAR_0) ),
    file('theBenchmark.p',axiom_89) ).

cnf(c_582,plain,
    ( p_Wr_error(A)
    | ~ p_Wr_error(plus(A,n1))
    | p_Wr(A)
    | p_Reset(A) ),
    inference(clausify,[status(thm)],[axiom_89]) ).

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

cnf(c_583,plain,
    ( ~ p_Wr_error(A)
    | p_Wr_error(plus(A,n1))
    | p_Wr(A)
    | p_Reset(A) ),
    inference(clausify,[status(thm)],[axiom_90]) ).

fof(quest_1,axiom,
    ~ p_Wr(t_139),
    file('theBenchmark.p',quest_1) ).

cnf(c_584,plain,
    ~ p_Wr(t_139),
    inference(clausify,[status(thm)],[quest_1]) ).

fof(quest_2,axiom,
    ~ p_Reset(t_139),
    file('theBenchmark.p',quest_2) ).

cnf(c_585,plain,
    ~ p_Reset(t_139),
    inference(clausify,[status(thm)],[quest_2]) ).

fof(quest_3,axiom,
    ( ~ p_Wr_error(plus(t_139,n1))
    | ~ p_Wr_error(t_139) ),
    file('theBenchmark.p',quest_3) ).

cnf(c_586,plain,
    ( ~ p_Wr_error(plus(t_139,n1))
    | ~ p_Wr_error(t_139) ),
    inference(clausify,[status(thm)],[quest_3]) ).

fof(quest_4,axiom,
    ( p_Wr_error(plus(t_139,n1))
    | p_Wr_error(t_139) ),
    file('theBenchmark.p',quest_4) ).

cnf(c_587,plain,
    ( p_Wr_error(plus(t_139,n1))
    | p_Wr_error(t_139) ),
    inference(clausify,[status(thm)],[quest_4]) ).

cnf(c_1025,plain,
    ( p_Wr_error(t_139)
    | p_Wr(t_139)
    | p_Reset(t_139)
    | p_Wr_error(t_139) ),
    inference(resolve,[status(thm)],[c_587,c_582]) ).

cnf(c_1026,plain,
    ( p_Wr(t_139)
    | p_Reset(t_139)
    | p_Wr_error(t_139) ),
    inference(copy,[status(thm)],[c_1025]) ).

cnf(c_1027,plain,
    ( p_Wr(t_139)
    | p_Wr_error(t_139) ),
    inference(resolve,[status(thm)],[c_585,c_1026]) ).

cnf(c_963,plain,
    p_Wr_error(t_139),
    inference(resolve,[status(thm)],[c_584,c_1027]) ).

cnf(c_964,plain,
    ~ p_Wr_error(plus(t_139,n1)),
    inference(resolve,[status(thm)],[c_963,c_586]) ).

cnf(c_1028,plain,
    ( p_Wr_error(plus(t_139,n1))
    | p_Wr(t_139)
    | p_Reset(t_139) ),
    inference(resolve,[status(thm)],[c_963,c_583]) ).

cnf(c_1029,plain,
    ( p_Wr_error(plus(t_139,n1))
    | p_Wr(t_139) ),
    inference(resolve,[status(thm)],[c_585,c_1028]) ).

cnf(c_1030,plain,
    p_Wr_error(plus(t_139,n1)),
    inference(resolve,[status(thm)],[c_584,c_1029]) ).

cnf(c_1024,plain,
    $false,
    inference(resolve,[status(thm)],[c_964,c_1030]) ).

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