↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWV172+1 : TPTP v9.3.1. Bugfixed v3.3.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 03:16:35 PM UTC 2026

% Result   : Theorem 3.61s 1.26s
% Output   : CNFRefutation 3.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   22 (  13 unt;   1 def)
%            Number of atoms       :  168 (  47 equ)
%            Maximal formula atoms :   34 (   7 avg)
%            Number of connectives :  197 (  57   ~;  50   |;  64   &)
%                                         (   0 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 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  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;  16 con; 0-3 aty)
%            Number of variables   :   39 (   0 sgn  39   !;   0   ?;   2   :)

% 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,n4)
            & leq(n0,X4) )
         => a_select2(sigma_init,X4) = init )
      & ! [X3] :
          ( ( leq(X3,n4)
            & 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(pv54,n4)
      & leq(pv10,n135299)
      & leq(n0,pv54)
      & leq(n0,pv10) )
   => a_select2(rho_init,pv54) = init ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0036) ).

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,n4)
              & leq(n0,X4) )
           => a_select2(sigma_init,X4) = init )
        & ! [X3] :
            ( ( leq(X3,n4)
              & 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(pv54,n4)
        & leq(pv10,n135299)
        & leq(n0,pv54)
        & leq(n0,pv10) )
     => a_select2(rho_init,pv54) = 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,n4)
        | ~ leq(n0,X4)
        | a_select2(sigma_init,X4) = init )
    & ! [X3] :
        ( ~ leq(X3,n4)
        | ~ 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(pv54,n4)
    & leq(pv10,n135299)
    & leq(n0,pv54)
    & leq(n0,pv10)
    & init != a_select2(rho_init,pv54) ),
    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,n4)
        | ~ leq(n0,X4)
        | a_select2(sigma_init,X4) = init )
    & ! [X3] :
        ( ~ leq(X3,n4)
        | ~ 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(pv54,n4)
    & leq(pv10,n135299)
    & leq(n0,pv54)
    & leq(n0,pv10)
    & init != a_select2(rho_init,pv54) ),
    inference(flattening,[],[f143]) ).

fof(f313,plain,
    ! [X2] :
      ( ~ leq(X2,n4)
      | ~ leq(n0,X2)
      | init = a_select2(rho_init,X2) ),
    inference(cnf_transformation,[],[f144]) ).

fof(f315,plain,
    leq(pv54,n4),
    inference(cnf_transformation,[],[f144]) ).

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

fof(f319,plain,
    init != a_select2(rho_init,pv54),
    inference(cnf_transformation,[],[f144]) ).

tcf(c_157,negated_conjecture,
    a_select2(rho_init,pv54) != init,
    inference(cnf_transformation,[],[f319]) ).

tcf(c_159,negated_conjecture,
    leq(n0,pv54),
    inference(cnf_transformation,[],[f317]) ).

tcf(c_161,negated_conjecture,
    leq(pv54,n4),
    inference(cnf_transformation,[],[f315]) ).

tcf(c_163,negated_conjecture,
    ! [X0: $i] :
      ( ( a_select2(rho_init,X0) = init )
      | ~ leq(n0,X0)
      | ~ leq(X0,n4) ),
    inference(cnf_transformation,[],[f313]) ).

tcf(c_5966,definition,
    iPr_def_10 = a_select2(rho_init,pv54),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_5973,negated_conjecture,
    ! [X0: $i] :
      ( ( a_select2(rho_init,X0) = init )
      | ~ leq(n0,X0)
      | ~ leq(X0,n4) ),
    inference(demodulation,[status(thm)],[c_163]) ).

tcf(c_5975,negated_conjecture,
    leq(pv54,n4),
    inference(demodulation,[status(thm)],[c_161]) ).

tcf(c_5977,negated_conjecture,
    leq(n0,pv54),
    inference(demodulation,[status(thm)],[c_159]) ).

tcf(c_5979,negated_conjecture,
    iPr_def_10 != init,
    inference(demodulation,[status(thm)],[c_157,c_5966]) ).

tcf(c_9030,plain,
    ( ( a_select2(rho_init,pv54) = init )
    | ~ leq(pv54,n4) ),
    inference(superposition,[status(thm)],[c_5977,c_5973]) ).

tcf(c_9031,plain,
    ( ( init = iPr_def_10 )
    | ~ leq(pv54,n4) ),
    inference(light_normalisation,[status(thm)],[c_9030,c_5966]) ).

tcf(c_9032,plain,
    init = iPr_def_10,
    inference(forward_subsumption_resolution,[status(thm)],[c_9031,c_5975]) ).

tcf(c_9038,plain,
    iPr_def_10 != iPr_def_10,
    inference(demodulation,[status(thm)],[c_5979,c_9032]) ).

tcf(c_9039,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_9038]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV172+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.36  % Computer : n002.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Thu Sep 24 18:43:07 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39  Running first-order theorem proving
% 0.13/0.39  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.13/0.40  
% 0.13/0.40  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40  
% 0.13/0.40  % Detected problem language: tptp
% 0.13/0.41  % Proving...
% 3.61/1.26  % SZS status Started for theBenchmark.p
% 3.61/1.26  % SZS status Theorem for theBenchmark.p
% 3.61/1.26  
% 3.61/1.26  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.61/1.26  
% 3.61/1.26  % ------  iProver source info
% 3.61/1.26  
% 3.61/1.26  % git: date: 2026-07-19 20:42:38 +0200
% 3.61/1.26  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.61/1.26  % git: non_committed_changes: false
% 3.61/1.26  
% 3.61/1.26  % ------ Parsing...
% 3.61/1.26  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.61/1.26  
% 3.61/1.26  % ------ Preprocessing... sup_sim: 15  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 3.61/1.26  
% 3.61/1.26  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.61/1.26  
% 3.61/1.26  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.61/1.26  % ------ Proving...
% 3.61/1.26  % ------ Problem Properties 
% 3.61/1.26  
% 3.61/1.26  % 
% 3.61/1.26  % clauses                               161
% 3.61/1.26  % conjectures                           13
% 3.61/1.26  % EPR                                   48
% 3.61/1.26  % Horn                                  111
% 3.61/1.26  % unary                                 59
% 3.61/1.26  % binary                                34
% 3.61/1.26  % lits                                  521
% 3.61/1.26  % lits eq                               123
% 3.61/1.26  % fd_pure                               0
% 3.61/1.26  % fd_pseudo                             0
% 3.61/1.26  % fd_cond                               6
% 3.61/1.26  % fd_pseudo_cond                        4
% 3.61/1.26  % AC symbols                            0
% 3.61/1.26  
% 3.61/1.26  % ------ Schedule dynamic 5 is on 
% 3.61/1.26  
% 3.61/1.26  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.61/1.26  
% 3.61/1.26  
% 3.61/1.26  % ------ 
% 3.61/1.26  % Current options:
% 3.61/1.26  % ------ 
% 3.61/1.26  
% 3.61/1.26  
% 3.61/1.26  % 
% 3.61/1.26  
% 3.61/1.26  % ------ Proving...
% 3.61/1.26  % 
% 3.61/1.26  
% 3.61/1.26  % SZS status Theorem for theBenchmark.p
% 3.61/1.26  
% 3.61/1.26  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.61/1.26  
% 3.61/1.26  
%------------------------------------------------------------------------------