↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : HWV015-2 : 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 : n009.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.64s 0.47s
% Output   : CNFRefutation 0.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   27 (  21 unt;   0 def)
%            Number of atoms       :   45 (  13 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   37 (  19   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   4 con; 0-2 aty)
%            Number of variables   :    5 (   0 sgn   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(quest_5,axiom,
    fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(t_206,n1)) != fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),
    file('theBenchmark.p',quest_5) ).

cnf(c_9,plain,
    fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(t_206,n1)) != fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),
    inference(clausify,[status(thm)],[quest_5]) ).

fof(quest_4,axiom,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
    file('theBenchmark.p',quest_4) ).

cnf(c_10,plain,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
    inference(clausify,[status(thm)],[quest_4]) ).

fof(quest_3,axiom,
    ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
    file('theBenchmark.p',quest_3) ).

cnf(c_11,plain,
    ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
    inference(clausify,[status(thm)],[quest_3]) ).

fof(quest_2,axiom,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
    file('theBenchmark.p',quest_2) ).

cnf(c_12,plain,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
    inference(clausify,[status(thm)],[quest_2]) ).

fof(quest_1,axiom,
    ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),n0),
    file('theBenchmark.p',quest_1) ).

cnf(c_13,plain,
    ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),n0),
    inference(clausify,[status(thm)],[quest_1]) ).

fof(axiom_80,axiom,
    f__length_(f__empty_) = n0,
    file('theBenchmark.p',axiom_80) ).

cnf(c_76,plain,
    f__length_(f__empty_) = n0,
    inference(clausify,[status(thm)],[axiom_80]) ).

cnf(c_77,plain,
    n0 = f__length_(f__empty_),
    inference(copy,[status(thm)],[c_76]) ).

fof(axiom_31,axiom,
    ! [VAR_0] :
      ( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(VAR_0))
      | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(VAR_0))
      | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(VAR_0))
      | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(VAR_0),n0)
      | fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(VAR_0,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(VAR_0) ),
    file('theBenchmark.p',axiom_31) ).

cnf(c_148,plain,
    ( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(A))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(A))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(A))
    | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(A),n0)
    | fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(A,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(A) ),
    inference(clausify,[status(thm)],[axiom_31]) ).

cnf(c_149,plain,
    ( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(A))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(A))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(A))
    | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(A),f__length_(f__empty_))
    | fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(A,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(A) ),
    inference(paramod,[status(thm)],[c_77,c_148]) ).

fof(axiom_5,axiom,
    ! [VAR_0] : fwork_DOTfifo_DOTrtl_DOTlevel_(VAR_0) = fwork_DOTfifo_DOTrtl_DOTint__level_(VAR_0),
    file('theBenchmark.p',axiom_5) ).

cnf(c_186,plain,
    fwork_DOTfifo_DOTrtl_DOTlevel_(A) = fwork_DOTfifo_DOTrtl_DOTint__level_(A),
    inference(clausify,[status(thm)],[axiom_5]) ).

cnf(c_659,plain,
    ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(t_206),n0),
    inference(paramod,[status(thm)],[c_186,c_13]) ).

cnf(c_202,plain,
    ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(t_206),f__length_(f__empty_)),
    inference(paramod,[status(thm)],[c_77,c_659]) ).

cnf(c_660,plain,
    fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(t_206,n1)) != fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),
    inference(paramod,[status(thm)],[c_186,c_9]) ).

cnf(c_218,plain,
    fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(t_206,n1)) != fwork_DOTfifo_DOTrtl_DOTint__level_(t_206),
    inference(paramod,[status(thm)],[c_186,c_660]) ).

cnf(c_661,plain,
    ( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206))
    | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(t_206),f__length_(f__empty_))
    | fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(t_206,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(t_206) ),
    inference(resolve,[status(thm)],[c_149,c_10]) ).

cnf(c_662,plain,
    ( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206))
    | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(t_206),f__length_(f__empty_)) ),
    inference(resolve,[status(thm)],[c_218,c_661]) ).

cnf(c_663,plain,
    ( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206))
    | ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)) ),
    inference(resolve,[status(thm)],[c_202,c_662]) ).

cnf(c_664,plain,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
    inference(resolve,[status(thm)],[c_12,c_663]) ).

cnf(c_658,plain,
    $false,
    inference(resolve,[status(thm)],[c_11,c_664]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV015-2 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n009.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Fri Sep 25 16:00:59 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37  % Process 1993003 was started by sandbox on n009,
% 0.09/0.37  % Fri Sep 25 16:00:59 2026
% 0.09/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.38  
% 0.09/0.38  % From the command line: assign(max_seconds, 300).
% 0.64/0.47  
% 0.64/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.64/0.47  
% 0.64/0.47  % Proof 1 at 0.07 (+ 0.02) seconds.
% 0.64/0.47  % Length of proof is 13.
% 0.64/0.47  % Level of proof is 3.
% 0.64/0.47  % Maximum clause weight is 21.000.
% 0.64/0.47  % Given clauses 104.
% 0.64/0.47  
% 0.64/0.47  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------