TSTP Solution File: SWV034+1 by Leo-III---1.7.7

View Problem - Process Solution

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

% Computer : n016.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 : Fri May 19 12:13:38 EDT 2023

% Result   : Theorem 4.89s 2.13s
% Output   : Refutation 5.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   27
% Syntax   : Number of formulae    :   30 (   2 unt;  26 typ;   0 def)
%            Number of atoms       :  120 (  42 equ;   0 cnn)
%            Maximal formula atoms :   59 (  30 avg)
%            Number of connectives :  322 (   2   ~;   0   |;  90   &; 204   @)
%                                         (   0 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (  13 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (  11   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   29 (  26 usr;  23 con; 0-3 aty)
%            Number of variables   :   20 (   0   ^;  20   !;   0   ?;  20   :)

% Comments : 
%------------------------------------------------------------------------------
thf(s_best7_init_type,type,
    s_best7_init: $i ).

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

thf(s_sworst7_init_type,type,
    s_sworst7_init: $i ).

thf(s_worst7_init_type,type,
    s_worst7_init: $i ).

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

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

thf(s_best7_type,type,
    s_best7: $i ).

thf(s_sworst7_type,type,
    s_sworst7: $i ).

thf(s_worst7_type,type,
    s_worst7: $i ).

thf(pv19_type,type,
    pv19: $i ).

thf(n3_type,type,
    n3: $i ).

thf(minus_type,type,
    minus: $i > $i > $i ).

thf(n410_type,type,
    n410: $i ).

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

thf(n2_type,type,
    n2: $i ).

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

thf(simplex7_init_type,type,
    simplex7_init: $i ).

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

thf(s_values7_init_type,type,
    s_values7_init: $i ).

thf(s_center7_init_type,type,
    s_center7_init: $i ).

thf(s_try7_init_type,type,
    s_try7_init: $i ).

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

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

thf(pvar1400_init_type,type,
    pvar1400_init: $i ).

thf(pvar1401_init_type,type,
    pvar1401_init: $i ).

thf(pvar1402_init_type,type,
    pvar1402_init: $i ).

thf(1,conjecture,
    ( ( ( s_best7_init = init )
      & ( s_sworst7_init = init )
      & ( s_worst7_init = init )
      & ( leq @ n0 @ s_best7 )
      & ( leq @ n0 @ s_sworst7 )
      & ( leq @ n0 @ s_worst7 )
      & ( leq @ n0 @ pv19 )
      & ( leq @ s_best7 @ n3 )
      & ( leq @ s_sworst7 @ n3 )
      & ( leq @ s_worst7 @ n3 )
      & ( leq @ pv19 @ ( minus @ n410 @ n1 ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ n2 ) )
         => ! [B: $i] :
              ( ( ( leq @ n0 @ B )
                & ( leq @ B @ n3 ) )
             => ( ( a_select3 @ simplex7_init @ B @ A )
                = init ) ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ n3 ) )
         => ( ( a_select2 @ s_values7_init @ A )
            = init ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ n2 ) )
         => ( ( a_select2 @ s_center7_init @ A )
            = init ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ ( minus @ n3 @ n1 ) ) )
         => ( ( a_select2 @ s_try7_init @ A )
            = init ) )
      & ( ( gt @ loopcounter @ n1 )
       => ( ( pvar1400_init = init )
          & ( pvar1401_init = init )
          & ( pvar1402_init = init ) ) ) )
   => ( ( init = init )
      & ( s_best7_init = init )
      & ( s_sworst7_init = init )
      & ( s_worst7_init = init )
      & ( leq @ n0 @ s_best7 )
      & ( leq @ n0 @ s_sworst7 )
      & ( leq @ n0 @ s_worst7 )
      & ( leq @ n0 @ pv19 )
      & ( leq @ s_best7 @ n3 )
      & ( leq @ s_sworst7 @ n3 )
      & ( leq @ s_worst7 @ n3 )
      & ( leq @ pv19 @ ( minus @ n410 @ n1 ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ n2 ) )
         => ! [B: $i] :
              ( ( ( leq @ n0 @ B )
                & ( leq @ B @ n3 ) )
             => ( ( a_select3 @ simplex7_init @ B @ A )
                = init ) ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ n3 ) )
         => ( ( a_select2 @ s_values7_init @ A )
            = init ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ n2 ) )
         => ( ( a_select2 @ s_center7_init @ A )
            = init ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ ( minus @ n3 @ n1 ) ) )
         => ( ( a_select2 @ s_try7_init @ A )
            = init ) )
      & ( ( gt @ loopcounter @ n1 )
       => ( ( pvar1400_init = init )
          & ( pvar1401_init = init )
          & ( pvar1402_init = init ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_init_0049) ).

thf(2,negated_conjecture,
    ~ ( ( ( s_best7_init = init )
        & ( s_sworst7_init = init )
        & ( s_worst7_init = init )
        & ( leq @ n0 @ s_best7 )
        & ( leq @ n0 @ s_sworst7 )
        & ( leq @ n0 @ s_worst7 )
        & ( leq @ n0 @ pv19 )
        & ( leq @ s_best7 @ n3 )
        & ( leq @ s_sworst7 @ n3 )
        & ( leq @ s_worst7 @ n3 )
        & ( leq @ pv19 @ ( minus @ n410 @ n1 ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n2 ) )
           => ! [B: $i] :
                ( ( ( leq @ n0 @ B )
                  & ( leq @ B @ n3 ) )
               => ( ( a_select3 @ simplex7_init @ B @ A )
                  = init ) ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n3 ) )
           => ( ( a_select2 @ s_values7_init @ A )
              = init ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n2 ) )
           => ( ( a_select2 @ s_center7_init @ A )
              = init ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ ( minus @ n3 @ n1 ) ) )
           => ( ( a_select2 @ s_try7_init @ A )
              = init ) )
        & ( ( gt @ loopcounter @ n1 )
         => ( ( pvar1400_init = init )
            & ( pvar1401_init = init )
            & ( pvar1402_init = init ) ) ) )
     => ( ( init = init )
        & ( s_best7_init = init )
        & ( s_sworst7_init = init )
        & ( s_worst7_init = init )
        & ( leq @ n0 @ s_best7 )
        & ( leq @ n0 @ s_sworst7 )
        & ( leq @ n0 @ s_worst7 )
        & ( leq @ n0 @ pv19 )
        & ( leq @ s_best7 @ n3 )
        & ( leq @ s_sworst7 @ n3 )
        & ( leq @ s_worst7 @ n3 )
        & ( leq @ pv19 @ ( minus @ n410 @ n1 ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n2 ) )
           => ! [B: $i] :
                ( ( ( leq @ n0 @ B )
                  & ( leq @ B @ n3 ) )
               => ( ( a_select3 @ simplex7_init @ B @ A )
                  = init ) ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n3 ) )
           => ( ( a_select2 @ s_values7_init @ A )
              = init ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ n2 ) )
           => ( ( a_select2 @ s_center7_init @ A )
              = init ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ ( minus @ n3 @ n1 ) ) )
           => ( ( a_select2 @ s_try7_init @ A )
              = init ) )
        & ( ( gt @ loopcounter @ n1 )
         => ( ( pvar1400_init = init )
            & ( pvar1401_init = init )
            & ( pvar1402_init = init ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(92,plain,
    ~ $true,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(93,plain,
    $false,
    inference(simp,[status(thm)],[92]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWV034+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.15/0.14  % Command  : run_Leo-III %s %d
% 0.15/0.35  % Computer : n016.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Fri May 19 03:18:43 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 0.99/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.51/1.04  % [INFO] 	 Parsing done (170ms). 
% 1.51/1.04  % [INFO] 	 Running in sequential loop mode. 
% 1.93/1.24  % [INFO] 	 eprover registered as external prover. 
% 1.93/1.24  % [INFO] 	 cvc4 registered as external prover. 
% 1.97/1.24  % [INFO] 	 Scanning for conjecture ... 
% 2.19/1.34  % [INFO] 	 Found a conjecture and 91 axioms. Running axiom selection ... 
% 2.36/1.41  % [INFO] 	 Axiom selection finished. Selected 89 axioms (removed 2 axioms). 
% 2.76/1.49  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.76/1.50  % [INFO] 	 Type checking passed. 
% 2.76/1.50  % [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 ... 
% 4.89/2.13  % [INFO] 	 Killing All external provers ... 
% 4.89/2.13  % Time passed: 1625ms (effective reasoning time: 1083ms)
% 4.89/2.13  % 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)>
% 4.89/2.13  % Axioms used in derivation (0): 
% 4.89/2.13  % No. of inferences in proof: 4
% 4.89/2.13  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1625 ms resp. 1083 ms w/o parsing
% 5.05/2.17  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.05/2.17  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------