↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : HWV018-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% 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 : Fri Sep 25 01:39:58 PM UTC 2026

% Result   : Unsatisfiable 4.17s 1.51s
% Output   : CNFRefutation 4.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   42 (  14 unt;   0 def)
%            Number of atoms       :  102 (  25 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   97 (  37   ~;  60   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn  20   !;   0   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f22,axiom,
    ! [X0] : ~ gt(X0,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_17) ).

fof(f27,axiom,
    ! [X0] :
      ( p_Full(X0)
      | int_level(X0) != fifo_length ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_22) ).

fof(f28,axiom,
    ! [X0] :
      ( ~ p_Full(X0)
      | int_level(X0) = fifo_length ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_23) ).

fof(f55,axiom,
    ! [X0] :
      ( p_Wr_error(plus(X0,n1))
      | gt(fifo_length,int_level(X0))
      | p_Rd(X0)
      | ~ p_Wr(X0)
      | p_Reset(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_42) ).

fof(f57,axiom,
    ! [X0] :
      ( int_level(plus(X0,n1)) = int_level(X0)
      | gt(fifo_length,int_level(X0))
      | p_Rd(X0)
      | ~ p_Wr(X0)
      | p_Reset(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_44) ).

fof(f58,plain,
    ! [X0] :
      ( int_level(X0) = int_level(plus(X0,n1))
      | gt(fifo_length,int_level(X0))
      | p_Rd(X0)
      | ~ p_Wr(X0)
      | p_Reset(X0) ),
    inference(reorient_equations,[],[f57]) ).

fof(f103,axiom,
    ! [X0] :
      ( int_level(plus(X0,n1)) = int_level(X0)
      | p_Rd(X0)
      | p_Wr(X0)
      | p_Reset(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_82) ).

fof(f104,plain,
    ! [X0] :
      ( int_level(X0) = int_level(plus(X0,n1))
      | p_Rd(X0)
      | p_Wr(X0)
      | p_Reset(X0) ),
    inference(reorient_equations,[],[f103]) ).

fof(f113,negated_conjecture,
    ~ p_Rd(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).

fof(f114,negated_conjecture,
    p_Wr(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).

fof(f115,negated_conjecture,
    p_Full(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).

fof(f116,negated_conjecture,
    ~ p_Reset(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).

fof(f117,negated_conjecture,
    ( ~ p_Wr_error(plus(t_139,n1))
    | ~ p_Full(plus(t_139,n1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_5) ).

tcf(c_144,negated_conjecture,
    ~ p_Rd(t_139),
    inference(cnf_transformation,[],[f113]) ).

tcf(c_145,negated_conjecture,
    p_Wr(t_139),
    inference(cnf_transformation,[],[f114]) ).

tcf(c_146,negated_conjecture,
    p_Full(t_139),
    inference(cnf_transformation,[],[f115]) ).

tcf(c_147,negated_conjecture,
    ~ p_Reset(t_139),
    inference(cnf_transformation,[],[f116]) ).

tcf(c_148,negated_conjecture,
    ( ~ p_Wr_error(plus(t_139,n1))
    | ~ p_Full(plus(t_139,n1)) ),
    inference(cnf_transformation,[],[f117]) ).

tcf(c_149,plain,
    ! [X0: $i] :
      ( p_Reset(X0)
      | p_Wr(X0)
      | p_Rd(X0)
      | ( int_level(plus(X0,n1)) = int_level(X0) ) ),
    inference(cnf_transformation,[],[f104]) ).

tcf(c_153,plain,
    ! [X0: $i] :
      ( ( int_level(X0) = fifo_length )
      | ~ p_Full(X0) ),
    inference(cnf_transformation,[],[f28]) ).

tcf(c_154,plain,
    ! [X0: $i] :
      ( p_Full(X0)
      | ( int_level(X0) != fifo_length ) ),
    inference(cnf_transformation,[],[f27]) ).

tcf(c_158,plain,
    ! [X0: $i] :
      ( p_Reset(X0)
      | p_Rd(X0)
      | gt(fifo_length,int_level(X0))
      | p_Wr_error(plus(X0,n1))
      | ~ p_Wr(X0) ),
    inference(cnf_transformation,[],[f55]) ).

tcf(c_171,plain,
    ! [X0: $i] : ~ gt(X0,X0),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_178,plain,
    ! [X0: $i] :
      ( p_Reset(X0)
      | p_Rd(X0)
      | gt(fifo_length,int_level(X0))
      | ( int_level(plus(X0,n1)) = int_level(X0) )
      | ~ p_Wr(X0) ),
    inference(cnf_transformation,[],[f58]) ).

tcf(c_314,plain,
    ! [X0: $i] :
      ( p_Reset(X0)
      | p_Rd(X0)
      | gt(fifo_length,int_level(X0))
      | ( int_level(plus(X0,n1)) = int_level(X0) ) ),
    inference(global_subsumption_just,[status(thm)],[c_178,c_149,c_178]) ).

tcf(c_381,plain,
    ! [X0: $i] :
      ( ( int_level(X0) != fifo_length )
      | p_Full(X0) ),
    inference(prop_impl_just,[status(thm)],[c_154]) ).

tcf(c_382,plain,
    ! [X0: $i] :
      ( p_Full(X0)
      | ( int_level(X0) != fifo_length ) ),
    inference(renaming,[status(thm)],[c_381]) ).

tcf(c_383,plain,
    ! [X0: $i] :
      ( ( int_level(X0) = fifo_length )
      | ~ p_Full(X0) ),
    inference(prop_impl_just,[status(thm)],[c_153]) ).

tcf(c_385,plain,
    ( ~ p_Wr_error(plus(t_139,n1))
    | ~ p_Full(plus(t_139,n1)) ),
    inference(prop_impl_just,[status(thm)],[c_148]) ).

tcf(c_1254,plain,
    ! [X0: $i] :
      ( ( int_level(X0) = fifo_length )
      | ( X0 != t_139 ) ),
    inference(resolution_lifted,[status(thm)],[c_146,c_383]) ).

tcf(c_1255,plain,
    int_level(t_139) = fifo_length,
    inference(unflattening,[status(thm)],[c_1254]) ).

tcf(c_1259,plain,
    ! [X0: $i] :
      ( ~ p_Wr_error(plus(t_139,n1))
      | ( int_level(X0) != fifo_length )
      | ( plus(t_139,n1) != X0 ) ),
    inference(resolution_lifted,[status(thm)],[c_385,c_382]) ).

tcf(c_1260,plain,
    ( ~ p_Wr_error(plus(t_139,n1))
    | ( int_level(plus(t_139,n1)) != fifo_length ) ),
    inference(unflattening,[status(thm)],[c_1259]) ).

tcf(c_4137,plain,
    ( ( int_level(plus(t_139,n1)) != fifo_length )
    | ~ p_Wr_error(plus(t_139,n1)) ),
    inference(prop_impl_just,[status(thm)],[c_1260]) ).

tcf(c_4138,plain,
    ( ~ p_Wr_error(plus(t_139,n1))
    | ( int_level(plus(t_139,n1)) != fifo_length ) ),
    inference(renaming,[status(thm)],[c_4137]) ).

tcf(c_8943,plain,
    ( p_Reset(t_139)
    | p_Rd(t_139)
    | gt(fifo_length,fifo_length)
    | ( int_level(plus(t_139,n1)) = int_level(t_139) ) ),
    inference(superposition,[status(thm)],[c_1255,c_314]) ).

tcf(c_8946,plain,
    ( p_Reset(t_139)
    | p_Rd(t_139)
    | gt(fifo_length,fifo_length)
    | ( int_level(plus(t_139,n1)) = fifo_length ) ),
    inference(light_normalisation,[status(thm)],[c_8943,c_1255]) ).

tcf(c_8947,plain,
    int_level(plus(t_139,n1)) = fifo_length,
    inference(forward_subsumption_resolution,[status(thm)],[c_8946,c_147,c_144,c_171]) ).

tcf(c_8958,plain,
    ~ p_Wr_error(plus(t_139,n1)),
    inference(backward_subsumption_resolution,[status(thm)],[c_4138,c_8947]) ).

tcf(c_8977,plain,
    ( p_Reset(t_139)
    | p_Rd(t_139)
    | gt(fifo_length,int_level(t_139))
    | ~ p_Wr(t_139) ),
    inference(superposition,[status(thm)],[c_158,c_8958]) ).

tcf(c_8979,plain,
    ( p_Reset(t_139)
    | p_Rd(t_139)
    | gt(fifo_length,fifo_length)
    | ~ p_Wr(t_139) ),
    inference(light_normalisation,[status(thm)],[c_8977,c_1255]) ).

tcf(c_8980,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_8979,c_147,c_144,c_171,c_145]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV018-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.58  % Computer : n002.cluster.edu
% 0.11/0.58  % Model    : x86_64 x86_64
% 0.11/0.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.58  % Memory   : 8046.5625MB
% 0.11/0.58  % OS       : Linux 6.8.0-71-generic
% 0.11/0.58  % CPULimit : 300
% 0.11/0.58  % WCLimit  : 300
% 0.11/0.58  % DateTime : Wed Sep 23 16:27:53 UTC 2026
% 0.11/0.58  % CPUTime  : 
% 0.11/0.59  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.62  Running first-order theorem proving
% 0.11/0.62  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.64  
% 0.11/0.64  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.64  
% 0.11/0.64  % Detected problem language: tptp
% 0.16/0.65  % Proving...
% 4.17/1.51  % SZS status Started for theBenchmark.p
% 4.17/1.51  % SZS status Unsatisfiable for theBenchmark.p
% 4.17/1.51  
% 4.17/1.51  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.17/1.51  
% 4.17/1.51  % ------  iProver source info
% 4.17/1.51  
% 4.17/1.51  % git: date: 2026-07-19 20:42:38 +0200
% 4.17/1.51  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.17/1.51  % git: non_committed_changes: false
% 4.17/1.51  
% 4.17/1.51  % ------ Parsing...% successful
% 4.17/1.51  
% 4.17/1.51  
% 4.17/1.51  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 4.17/1.51  
% 4.17/1.51  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 17 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 4 0s  sf_e  pe_s  pe_e % 
% 4.17/1.51  
% 4.17/1.51  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 4.17/1.51  
% 4.17/1.51  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 4.17/1.51  % ------ Proving...
% 4.17/1.51  % ------ Problem Properties 
% 4.17/1.51  
% 4.17/1.51  % 
% 4.17/1.51  % clauses                               45
% 4.17/1.51  % conjectures                           3
% 4.17/1.51  % EPR                                   7
% 4.17/1.51  % Horn                                  21
% 4.17/1.51  % unary                                 8
% 4.17/1.51  % binary                                11
% 4.17/1.51  % lits                                  132
% 4.17/1.51  % lits eq                               31
% 4.17/1.51  % fd_pure                               0
% 4.17/1.51  % fd_pseudo                             0
% 4.17/1.51  % fd_cond                               1
% 4.17/1.51  % fd_pseudo_cond                        4
% 4.17/1.51  % AC symbols                            0
% 4.17/1.51  
% 4.17/1.51  % ------ Schedule dynamic 5 is on 
% 4.17/1.51  
% 4.17/1.51  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.17/1.51  
% 4.17/1.51  
% 4.17/1.51  % ------ 
% 4.17/1.51  % Current options:
% 4.17/1.51  % ------ 
% 4.17/1.51  
% 4.17/1.51  
% 4.17/1.51  % 
% 4.17/1.51  
% 4.17/1.51  % ------ Proving...
% 4.17/1.51  % 
% 4.17/1.51  
% 4.17/1.51  % SZS status Unsatisfiable for theBenchmark.p
% 4.17/1.51  
% 4.17/1.51  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.17/1.51  
% 4.17/1.51  
%------------------------------------------------------------------------------