TSTP Solution File: SWV170+1 by Leo-III-SAT---1.7.10

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.10
% Problem  : SWV170+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  7 10:57:22 EDT 2024

% Result   : Theorem 17.68s 4.32s
% Output   : Refutation 17.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   39 (   6 unt;  22 typ;   0 def)
%            Number of atoms       :  149 (  35 equ;   0 cnn)
%            Maximal formula atoms :   39 (   8 avg)
%            Number of connectives :  455 (  25   ~;  18   |;  72   &; 298   @)
%                                         (   0 <=>;  42  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   8 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   25 (  22 usr;  20 con; 0-3 aty)
%            Number of variables   :   36 (   0   ^  36   !;   0   ?;  36   :)

% Comments : 
%------------------------------------------------------------------------------
thf(leq_type,type,
    leq: $i > $i > $o ).

thf(n0_type,type,
    n0: $i ).

thf(pv10_type,type,
    pv10: $i ).

thf(pv52_type,type,
    pv52: $i ).

thf(pv54_type,type,
    pv54: $i ).

thf(n135299_type,type,
    n135299: $i ).

thf(n4_type,type,
    n4: $i ).

thf(gt_type,type,
    gt: $i > $i > $o ).

thf(loopcounter_type,type,
    loopcounter: $i ).

thf(n1_type,type,
    n1: $i ).

thf(a_select3_type,type,
    a_select3: $i > $i > $i > $i ).

thf(q_init_type,type,
    q_init: $i ).

thf(init_type,type,
    init: $i ).

thf(a_select2_type,type,
    a_select2: $i > $i > $i ).

thf(rho_init_type,type,
    rho_init: $i ).

thf(mu_init_type,type,
    mu_init: $i ).

thf(sigma_init_type,type,
    sigma_init: $i ).

thf(center_init_type,type,
    center_init: $i ).

thf(muold_init_type,type,
    muold_init: $i ).

thf(rhoold_init_type,type,
    rhoold_init: $i ).

thf(sigmaold_init_type,type,
    sigmaold_init: $i ).

thf(sk1_type,type,
    sk1: $i ).

thf(1,conjecture,
    ( ( ( leq @ n0 @ pv10 )
      & ( leq @ n0 @ pv52 )
      & ( leq @ n0 @ pv54 )
      & ( leq @ pv10 @ n135299 )
      & ( leq @ pv52 @ n4 )
      & ( leq @ pv54 @ n4 )
      & ( gt @ loopcounter @ n1 )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ n135299 ) )
         => ! [B: $i] :
              ( ( ( leq @ n0 @ B )
                & ( leq @ B @ n4 ) )
             => ( ( a_select3 @ q_init @ A @ B )
                = init ) ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ n4 ) )
         => ( ( a_select2 @ rho_init @ A )
            = init ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ n4 ) )
         => ( ( a_select2 @ mu_init @ A )
            = init ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ n4 ) )
         => ( ( a_select2 @ sigma_init @ A )
            = init ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ n4 ) )
         => ( ( a_select3 @ center_init @ A @ n0 )
            = init ) )
      & ( ( gt @ loopcounter @ n1 )
       => ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n4 ) )
           => ( ( a_select2 @ muold_init @ A )
              = init ) ) )
      & ( ( gt @ loopcounter @ n1 )
       => ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n4 ) )
           => ( ( a_select2 @ rhoold_init @ A )
              = init ) ) )
      & ( ( gt @ loopcounter @ n1 )
       => ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n4 ) )
           => ( ( a_select2 @ sigmaold_init @ A )
              = init ) ) ) )
   => ! [A: $i] :
        ( ( ( leq @ n0 @ A )
          & ( leq @ A @ n4 ) )
       => ( ( a_select2 @ muold_init @ A )
          = init ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0026) ).

thf(2,negated_conjecture,
    ~ ( ( ( leq @ n0 @ pv10 )
        & ( leq @ n0 @ pv52 )
        & ( leq @ n0 @ pv54 )
        & ( leq @ pv10 @ n135299 )
        & ( leq @ pv52 @ n4 )
        & ( leq @ pv54 @ n4 )
        & ( gt @ loopcounter @ n1 )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n135299 ) )
           => ! [B: $i] :
                ( ( ( leq @ n0 @ B )
                  & ( leq @ B @ n4 ) )
               => ( ( a_select3 @ q_init @ A @ B )
                  = init ) ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n4 ) )
           => ( ( a_select2 @ rho_init @ A )
              = init ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n4 ) )
           => ( ( a_select2 @ mu_init @ A )
              = init ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n4 ) )
           => ( ( a_select2 @ sigma_init @ A )
              = init ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n4 ) )
           => ( ( a_select3 @ center_init @ A @ n0 )
              = init ) )
        & ( ( gt @ loopcounter @ n1 )
         => ! [A: $i] :
              ( ( ( leq @ n0 @ A )
                & ( leq @ A @ n4 ) )
             => ( ( a_select2 @ muold_init @ A )
                = init ) ) )
        & ( ( gt @ loopcounter @ n1 )
         => ! [A: $i] :
              ( ( ( leq @ n0 @ A )
                & ( leq @ A @ n4 ) )
             => ( ( a_select2 @ rhoold_init @ A )
                = init ) ) )
        & ( ( gt @ loopcounter @ n1 )
         => ! [A: $i] :
              ( ( ( leq @ n0 @ A )
                & ( leq @ A @ n4 ) )
             => ( ( a_select2 @ sigmaold_init @ A )
                = init ) ) ) )
     => ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ n4 ) )
         => ( ( a_select2 @ muold_init @ A )
            = init ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(92,plain,
    ~ ( ( ( leq @ n0 @ pv10 )
        & ( leq @ n0 @ pv52 )
        & ( leq @ n0 @ pv54 )
        & ( leq @ pv10 @ n135299 )
        & ( leq @ pv52 @ n4 )
        & ( leq @ pv54 @ n4 )
        & ( gt @ loopcounter @ n1 )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n135299 ) )
           => ! [B: $i] :
                ( ( ( leq @ n0 @ B )
                  & ( leq @ B @ n4 ) )
               => ( ( a_select3 @ q_init @ A @ B )
                  = init ) ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n4 ) )
           => ( ( a_select2 @ rho_init @ A )
              = init ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n4 ) )
           => ( ( a_select2 @ mu_init @ A )
              = init ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n4 ) )
           => ( ( a_select2 @ sigma_init @ A )
              = init ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n4 ) )
           => ( ( a_select3 @ center_init @ A @ n0 )
              = init ) )
        & ( ( gt @ loopcounter @ n1 )
         => ! [A: $i] :
              ( ( ( leq @ n0 @ A )
                & ( leq @ A @ n4 ) )
             => ( ( a_select2 @ muold_init @ A )
                = init ) ) )
        & ( ( gt @ loopcounter @ n1 )
         => ! [A: $i] :
              ( ( ( leq @ n0 @ A )
                & ( leq @ A @ n4 ) )
             => ( ( a_select2 @ rhoold_init @ A )
                = init ) ) )
        & ( ( gt @ loopcounter @ n1 )
         => ! [A: $i] :
              ( ( ( leq @ n0 @ A )
                & ( leq @ A @ n4 ) )
             => ( ( a_select2 @ sigmaold_init @ A )
                = init ) ) ) )
     => ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ n4 ) )
         => ( ( a_select2 @ muold_init @ A )
            = init ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(110,plain,
    ! [A: $i] :
      ( ~ ( gt @ loopcounter @ n1 )
      | ~ ( leq @ n0 @ A )
      | ~ ( leq @ A @ n4 )
      | ( ( a_select2 @ muold_init @ A )
        = init ) ),
    inference(cnf,[status(esa)],[92]) ).

thf(111,plain,
    ! [A: $i] :
      ( ( ( a_select2 @ muold_init @ A )
        = init )
      | ~ ( gt @ loopcounter @ n1 )
      | ~ ( leq @ n0 @ A )
      | ~ ( leq @ A @ n4 ) ),
    inference(lifteq,[status(thm)],[110]) ).

thf(112,plain,
    ! [A: $i] :
      ( ( ( a_select2 @ muold_init @ A )
        = init )
      | ~ ( gt @ loopcounter @ n1 )
      | ~ ( leq @ n0 @ A )
      | ~ ( leq @ A @ n4 ) ),
    inference(simp,[status(thm)],[111]) ).

thf(107,plain,
    gt @ loopcounter @ n1,
    inference(cnf,[status(esa)],[92]) ).

thf(1563,plain,
    ! [A: $i] :
      ( ( ( a_select2 @ muold_init @ A )
        = init )
      | ~ $true
      | ~ ( leq @ n0 @ A )
      | ~ ( leq @ A @ n4 ) ),
    inference(rewrite,[status(thm)],[112,107]) ).

thf(1564,plain,
    ! [A: $i] :
      ( ( ( a_select2 @ muold_init @ A )
        = init )
      | ~ ( leq @ n0 @ A )
      | ~ ( leq @ A @ n4 ) ),
    inference(simp,[status(thm)],[1563]) ).

thf(95,plain,
    ( ( a_select2 @ muold_init @ sk1 )
   != init ),
    inference(cnf,[status(esa)],[92]) ).

thf(120,plain,
    ( ( a_select2 @ muold_init @ sk1 )
   != init ),
    inference(lifteq,[status(thm)],[95]) ).

thf(1568,plain,
    ! [A: $i] :
      ( ~ ( leq @ n0 @ A )
      | ~ ( leq @ A @ n4 )
      | ( ( a_select2 @ muold_init @ A )
       != ( a_select2 @ muold_init @ sk1 ) ) ),
    inference(paramod_ordered,[status(thm)],[1564,120]) ).

thf(1569,plain,
    ( ~ ( leq @ n0 @ sk1 )
    | ~ ( leq @ sk1 @ n4 ) ),
    inference(pattern_uni,[status(thm)],[1568:[bind(A,$thf( sk1 ))]]) ).

thf(106,plain,
    leq @ sk1 @ n4,
    inference(cnf,[status(esa)],[92]) ).

thf(108,plain,
    leq @ n0 @ sk1,
    inference(cnf,[status(esa)],[92]) ).

thf(1618,plain,
    ( ~ $true
    | ~ $true ),
    inference(rewrite,[status(thm)],[1569,106,108]) ).

thf(1619,plain,
    $false,
    inference(simp,[status(thm)],[1618]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV170+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.12/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.37  % Computer : n017.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Tue May  7 00:33:24 EDT 2024
% 0.15/0.37  % CPUTime  : 
% 1.00/0.92  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.53/1.09  % [INFO] 	 Parsing done (169ms). 
% 1.53/1.10  % [INFO] 	 Running in sequential loop mode. 
% 2.04/1.31  % [INFO] 	 nitpick registered as external prover. 
% 2.04/1.32  % [INFO] 	 Scanning for conjecture ... 
% 2.22/1.42  % [INFO] 	 Found a conjecture and 91 axioms. Running axiom selection ... 
% 2.54/1.49  % [INFO] 	 Axiom selection finished. Selected 89 axioms (removed 2 axioms). 
% 2.75/1.57  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.75/1.58  % [INFO] 	 Type checking passed. 
% 2.75/1.58  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 17.68/4.32  % [INFO] 	 Killing All external provers ... 
% 17.68/4.32  % Time passed: 3785ms (effective reasoning time: 3218ms)
% 17.68/4.32  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 17.68/4.32  % Axioms used in derivation (0): 
% 17.68/4.32  % No. of inferences in proof: 17
% 17.68/4.32  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3785 ms resp. 3218 ms w/o parsing
% 17.68/4.35  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 17.68/4.35  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------