↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWV168+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n010.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 03:16:35 PM UTC 2026

% Result   : Theorem 2.77s 1.91s
% Output   : CNFRefutation 2.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   34 (  22 unt;   2 def)
%            Number of atoms       :  205 (  57 equ)
%            Maximal formula atoms :   35 (   6 avg)
%            Number of connectives :  231 (  72   ~;  65   |;  68   &)
%                                         (   0 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  16 con; 0-3 aty)
%            Number of variables   :   46 (   0 sgn  46   !;   0   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ( ( gt(loopcounter,n1)
       => ! [X8] :
            ( ( leq(X8,n4)
              & leq(n0,X8) )
           => a_select2(sigmaold_init,X8) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X7] :
            ( ( leq(X7,n4)
              & leq(n0,X7) )
           => a_select2(rhoold_init,X7) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X6] :
            ( ( leq(X6,n4)
              & leq(n0,X6) )
           => a_select2(muold_init,X6) = init ) )
      & ! [X5] :
          ( ( leq(X5,n4)
            & leq(n0,X5) )
         => a_select3(center_init,X5,n0) = init )
      & ! [X4] :
          ( ( leq(X4,pred(pv40))
            & leq(n0,X4) )
         => a_select2(sigma_init,X4) = init )
      & ! [X3] :
          ( ( leq(X3,pred(pv40))
            & leq(n0,X3) )
         => a_select2(mu_init,X3) = init )
      & ! [X2] :
          ( ( leq(X2,n4)
            & leq(n0,X2) )
         => a_select2(rho_init,X2) = init )
      & ! [X0] :
          ( ( leq(X0,n135299)
            & leq(n0,X0) )
         => ! [X1] :
              ( ( leq(X1,n4)
                & leq(n0,X1) )
             => a_select3(q_init,X0,X1) = init ) )
      & leq(pv46,n135299)
      & leq(pv40,n4)
      & leq(n0,pv46)
      & leq(n0,pv40)
      & a_select2(mu_init,pv40) = init )
   => a_select3(q_init,pv46,pv40) = init ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0016) ).

fof(f54,negated_conjecture,
    ~ ( ( ( gt(loopcounter,n1)
         => ! [X8] :
              ( ( leq(X8,n4)
                & leq(n0,X8) )
             => a_select2(sigmaold_init,X8) = init ) )
        & ( gt(loopcounter,n1)
         => ! [X7] :
              ( ( leq(X7,n4)
                & leq(n0,X7) )
             => a_select2(rhoold_init,X7) = init ) )
        & ( gt(loopcounter,n1)
         => ! [X6] :
              ( ( leq(X6,n4)
                & leq(n0,X6) )
             => a_select2(muold_init,X6) = init ) )
        & ! [X5] :
            ( ( leq(X5,n4)
              & leq(n0,X5) )
           => a_select3(center_init,X5,n0) = init )
        & ! [X4] :
            ( ( leq(X4,pred(pv40))
              & leq(n0,X4) )
           => a_select2(sigma_init,X4) = init )
        & ! [X3] :
            ( ( leq(X3,pred(pv40))
              & leq(n0,X3) )
           => a_select2(mu_init,X3) = init )
        & ! [X2] :
            ( ( leq(X2,n4)
              & leq(n0,X2) )
           => a_select2(rho_init,X2) = init )
        & ! [X0] :
            ( ( leq(X0,n135299)
              & leq(n0,X0) )
           => ! [X1] :
                ( ( leq(X1,n4)
                  & leq(n0,X1) )
               => a_select3(q_init,X0,X1) = init ) )
        & leq(pv46,n135299)
        & leq(pv40,n4)
        & leq(n0,pv46)
        & leq(n0,pv40)
        & a_select2(mu_init,pv40) = init )
     => a_select3(q_init,pv46,pv40) = init ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f143,plain,
    ( ( ~ gt(loopcounter,n1)
      | ! [X8] :
          ( ~ leq(X8,n4)
          | ~ leq(n0,X8)
          | a_select2(sigmaold_init,X8) = init ) )
    & ( ~ gt(loopcounter,n1)
      | ! [X7] :
          ( ~ leq(X7,n4)
          | ~ leq(n0,X7)
          | a_select2(rhoold_init,X7) = init ) )
    & ( ~ gt(loopcounter,n1)
      | ! [X6] :
          ( ~ leq(X6,n4)
          | ~ leq(n0,X6)
          | a_select2(muold_init,X6) = init ) )
    & ! [X5] :
        ( ~ leq(X5,n4)
        | ~ leq(n0,X5)
        | a_select3(center_init,X5,n0) = init )
    & ! [X4] :
        ( ~ leq(X4,pred(pv40))
        | ~ leq(n0,X4)
        | a_select2(sigma_init,X4) = init )
    & ! [X3] :
        ( ~ leq(X3,pred(pv40))
        | ~ leq(n0,X3)
        | a_select2(mu_init,X3) = init )
    & ! [X2] :
        ( ~ leq(X2,n4)
        | ~ leq(n0,X2)
        | a_select2(rho_init,X2) = init )
    & ! [X0] :
        ( ~ leq(X0,n135299)
        | ~ leq(n0,X0)
        | ! [X1] :
            ( ~ leq(X1,n4)
            | ~ leq(n0,X1)
            | a_select3(q_init,X0,X1) = init ) )
    & leq(pv46,n135299)
    & leq(pv40,n4)
    & leq(n0,pv46)
    & leq(n0,pv40)
    & a_select2(mu_init,pv40) = init
    & init != a_select3(q_init,pv46,pv40) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f144,plain,
    ( ( ~ gt(loopcounter,n1)
      | ! [X8] :
          ( ~ leq(X8,n4)
          | ~ leq(n0,X8)
          | a_select2(sigmaold_init,X8) = init ) )
    & ( ~ gt(loopcounter,n1)
      | ! [X7] :
          ( ~ leq(X7,n4)
          | ~ leq(n0,X7)
          | a_select2(rhoold_init,X7) = init ) )
    & ( ~ gt(loopcounter,n1)
      | ! [X6] :
          ( ~ leq(X6,n4)
          | ~ leq(n0,X6)
          | a_select2(muold_init,X6) = init ) )
    & ! [X5] :
        ( ~ leq(X5,n4)
        | ~ leq(n0,X5)
        | a_select3(center_init,X5,n0) = init )
    & ! [X4] :
        ( ~ leq(X4,pred(pv40))
        | ~ leq(n0,X4)
        | a_select2(sigma_init,X4) = init )
    & ! [X3] :
        ( ~ leq(X3,pred(pv40))
        | ~ leq(n0,X3)
        | a_select2(mu_init,X3) = init )
    & ! [X2] :
        ( ~ leq(X2,n4)
        | ~ leq(n0,X2)
        | a_select2(rho_init,X2) = init )
    & ! [X0] :
        ( ~ leq(X0,n135299)
        | ~ leq(n0,X0)
        | ! [X1] :
            ( ~ leq(X1,n4)
            | ~ leq(n0,X1)
            | a_select3(q_init,X0,X1) = init ) )
    & leq(pv46,n135299)
    & leq(pv40,n4)
    & leq(n0,pv46)
    & leq(n0,pv40)
    & a_select2(mu_init,pv40) = init
    & init != a_select3(q_init,pv46,pv40) ),
    inference(flattening,[],[f143]) ).

fof(f314,plain,
    ! [X0,X1] :
      ( ~ leq(X0,n135299)
      | ~ leq(n0,X0)
      | ~ leq(X1,n4)
      | ~ leq(n0,X1)
      | init = a_select3(q_init,X0,X1) ),
    inference(cnf_transformation,[],[f144]) ).

fof(f315,plain,
    leq(pv46,n135299),
    inference(cnf_transformation,[],[f144]) ).

fof(f316,plain,
    leq(pv40,n4),
    inference(cnf_transformation,[],[f144]) ).

fof(f317,plain,
    leq(n0,pv46),
    inference(cnf_transformation,[],[f144]) ).

fof(f318,plain,
    leq(n0,pv40),
    inference(cnf_transformation,[],[f144]) ).

fof(f319,plain,
    a_select2(mu_init,pv40) = init,
    inference(cnf_transformation,[],[f144]) ).

fof(f320,plain,
    init != a_select3(q_init,pv46,pv40),
    inference(cnf_transformation,[],[f144]) ).

tcf(c_157,negated_conjecture,
    a_select3(q_init,pv46,pv40) != init,
    inference(cnf_transformation,[],[f320]) ).

tcf(c_158,negated_conjecture,
    a_select2(mu_init,pv40) = init,
    inference(cnf_transformation,[],[f319]) ).

tcf(c_159,negated_conjecture,
    leq(n0,pv40),
    inference(cnf_transformation,[],[f318]) ).

tcf(c_160,negated_conjecture,
    leq(n0,pv46),
    inference(cnf_transformation,[],[f317]) ).

tcf(c_161,negated_conjecture,
    leq(pv40,n4),
    inference(cnf_transformation,[],[f316]) ).

tcf(c_162,negated_conjecture,
    leq(pv46,n135299),
    inference(cnf_transformation,[],[f315]) ).

tcf(c_163,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ( a_select3(q_init,X0,X1) = init )
      | ~ leq(n0,X1)
      | ~ leq(n0,X0)
      | ~ leq(X1,n4)
      | ~ leq(X0,n135299) ),
    inference(cnf_transformation,[],[f314]) ).

tcf(c_5972,definition,
    iPr_def_11 = a_select2(mu_init,pv40),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_5973,definition,
    iPr_def_12 = a_select3(q_init,pv46,pv40),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_5981,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ( a_select3(q_init,X0,X1) = init )
      | ~ leq(n0,X1)
      | ~ leq(n0,X0)
      | ~ leq(X1,n4)
      | ~ leq(X0,n135299) ),
    inference(demodulation,[status(thm)],[c_163]) ).

tcf(c_5982,negated_conjecture,
    leq(pv46,n135299),
    inference(demodulation,[status(thm)],[c_162]) ).

tcf(c_5983,negated_conjecture,
    leq(pv40,n4),
    inference(demodulation,[status(thm)],[c_161]) ).

tcf(c_5984,negated_conjecture,
    leq(n0,pv46),
    inference(demodulation,[status(thm)],[c_160]) ).

tcf(c_5985,negated_conjecture,
    leq(n0,pv40),
    inference(demodulation,[status(thm)],[c_159]) ).

tcf(c_5986,negated_conjecture,
    iPr_def_11 = init,
    inference(demodulation,[status(thm)],[c_158,c_5972]) ).

tcf(c_5987,negated_conjecture,
    iPr_def_12 != init,
    inference(demodulation,[status(thm)],[c_157,c_5973]) ).

tcf(c_9034,plain,
    iPr_def_11 != iPr_def_12,
    inference(light_normalisation,[status(thm)],[c_5987,c_5986]) ).

tcf(c_9178,plain,
    ! [X0: $i,X1: $i] :
      ( ( a_select3(q_init,X0,X1) = iPr_def_11 )
      | ~ leq(n0,X1)
      | ~ leq(n0,X0)
      | ~ leq(X1,n4)
      | ~ leq(X0,n135299) ),
    inference(light_normalisation,[status(thm)],[c_5981,c_5986]) ).

tcf(c_9196,plain,
    ! [X0: $i] :
      ( ( a_select3(q_init,pv46,X0) = iPr_def_11 )
      | ~ leq(pv46,n135299)
      | ~ leq(n0,X0)
      | ~ leq(X0,n4) ),
    inference(superposition,[status(thm)],[c_5984,c_9178]) ).

tcf(c_9197,plain,
    ! [X0: $i] :
      ( ( a_select3(q_init,pv46,X0) = iPr_def_11 )
      | ~ leq(n0,X0)
      | ~ leq(X0,n4) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_9196,c_5982]) ).

tcf(c_9269,plain,
    ( ( a_select3(q_init,pv46,pv40) = iPr_def_11 )
    | ~ leq(pv40,n4) ),
    inference(superposition,[status(thm)],[c_5985,c_9197]) ).

tcf(c_9273,plain,
    ( ( iPr_def_11 = iPr_def_12 )
    | ~ leq(pv40,n4) ),
    inference(light_normalisation,[status(thm)],[c_9269,c_5973]) ).

tcf(c_9274,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_9273,c_9034,c_5983]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV168+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.99  % Computer : n010.cluster.edu
% 0.09/0.99  % Model    : x86_64 x86_64
% 0.09/0.99  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.99  % Memory   : 8046.5625MB
% 0.09/0.99  % OS       : Linux 6.8.0-71-generic
% 0.09/1.00  % CPULimit : 300
% 0.09/1.00  % WCLimit  : 300
% 0.09/1.00  % DateTime : Thu Sep 24 18:40:35 UTC 2026
% 0.09/1.00  % CPUTime  : 
% 0.09/1.00  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/1.04  Running first-order theorem proving
% 0.14/1.04  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/1.05  
% 0.14/1.05  % ======== iProver multi-core TPTP/SMT =========
% 0.14/1.05  
% 0.14/1.05  % Detected problem language: tptp
% 0.14/1.06  % Proving...
% 2.77/1.91  % SZS status Started for theBenchmark.p
% 2.77/1.91  % SZS status Theorem for theBenchmark.p
% 2.77/1.91  
% 2.77/1.91  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.77/1.91  
% 2.77/1.91  % ------  iProver source info
% 2.77/1.91  
% 2.77/1.91  % git: date: 2026-07-19 20:42:38 +0200
% 2.77/1.91  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.77/1.91  % git: non_committed_changes: false
% 2.77/1.91  
% 2.77/1.91  % ------ Parsing...
% 2.77/1.91  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.77/1.91  
% 2.77/1.91  % ------ Preprocessing... sup_sim: 15  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 2.77/1.91  
% 2.77/1.91  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.77/1.91  
% 2.77/1.91  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.77/1.91  % ------ Proving...
% 2.77/1.91  % ------ Problem Properties 
% 2.77/1.91  
% 2.77/1.91  % 
% 2.77/1.91  % clauses                               164
% 2.77/1.91  % conjectures                           14
% 2.77/1.91  % EPR                                   49
% 2.77/1.91  % Horn                                  114
% 2.77/1.91  % unary                                 62
% 2.77/1.91  % binary                                34
% 2.77/1.91  % lits                                  524
% 2.77/1.91  % lits eq                               126
% 2.77/1.91  % fd_pure                               0
% 2.77/1.91  % fd_pseudo                             0
% 2.77/1.91  % fd_cond                               6
% 2.77/1.91  % fd_pseudo_cond                        4
% 2.77/1.91  % AC symbols                            0
% 2.77/1.91  
% 2.77/1.91  % ------ Schedule dynamic 5 is on 
% 2.77/1.91  
% 2.77/1.91  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.77/1.91  
% 2.77/1.91  
% 2.77/1.91  % ------ 
% 2.77/1.91  % Current options:
% 2.77/1.91  % ------ 
% 2.77/1.91  
% 2.77/1.91  
% 2.77/1.91  % 
% 2.77/1.91  
% 2.77/1.91  % ------ Proving...
% 2.77/1.91  % 
% 2.77/1.91  
% 2.77/1.91  % SZS status Theorem for theBenchmark.p
% 2.77/1.91  
% 2.77/1.91  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.77/1.91  
% 2.77/1.91  
%------------------------------------------------------------------------------