TSTP Solution File: SWV131+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWV131+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% 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 : Wed Aug 31 18:44:17 EDT 2022

% Result   : Theorem 1.54s 0.55s
% Output   : Refutation 1.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   5 unt;   0 def)
%            Number of atoms       :  117 (   0 equ)
%            Maximal formula atoms :   26 (   9 avg)
%            Number of connectives :  139 (  35   ~;  26   |;  50   &)
%                                         (   2 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :    0 (   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f197,plain,
    $false,
    inference(avatar_sat_refutation,[],[f159,f190,f195]) ).

fof(f195,plain,
    ~ spl0_1,
    inference(avatar_split_clause,[],[f131,f152]) ).

fof(f152,plain,
    ( spl0_1
  <=> leq(tptp_float_0_001,pv1341) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).

fof(f131,plain,
    ~ leq(tptp_float_0_001,pv1341),
    inference(cnf_transformation,[],[f92]) ).

fof(f92,plain,
    ( ( leq(n0,s_worst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(tptp_float_0_001,pv1341)
      | leq(s_sworst7,n3) )
    & ( leq(n0,s_sworst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_worst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(tptp_float_0_001,pv1341)
      | leq(s_worst7,n3) )
    & ( leq(tptp_float_0_001,pv1341)
      | leq(n0,s_best7) )
    & ( leq(n0,s_best7)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_best7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ~ leq(tptp_float_0_001,pv1341)
    & ( ~ gt(loopcounter,n0)
      | leq(s_best7,n3) )
    & ~ leq(n0,s_best7)
    & ( ~ gt(loopcounter,n0)
      | leq(s_worst7,n3) )
    & ( leq(tptp_float_0_001,pv1341)
      | leq(n0,s_sworst7) )
    & ( leq(s_sworst7,n3)
      | ~ gt(loopcounter,n0) ) ),
    inference(flattening,[],[f91]) ).

fof(f91,plain,
    ( ~ leq(n0,s_best7)
    & ~ leq(tptp_float_0_001,pv1341)
    & ( leq(tptp_float_0_001,pv1341)
      | leq(s_worst7,n3) )
    & ( ~ gt(loopcounter,n0)
      | leq(s_best7,n3) )
    & ( leq(tptp_float_0_001,pv1341)
      | leq(n0,s_best7) )
    & ( leq(s_sworst7,n3)
      | ~ gt(loopcounter,n0) )
    & ( ~ gt(loopcounter,n0)
      | leq(s_worst7,n3) )
    & ( leq(n0,s_best7)
      | ~ gt(loopcounter,n0) )
    & ( leq(tptp_float_0_001,pv1341)
      | leq(n0,s_sworst7) )
    & ( leq(n0,s_sworst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_worst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(tptp_float_0_001,pv1341)
      | leq(s_sworst7,n3) )
    & ( leq(n0,s_worst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_best7,n3)
      | leq(tptp_float_0_001,pv1341) ) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ ( ( ~ leq(tptp_float_0_001,pv1341)
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_worst7,n3) )
        & ( gt(loopcounter,n0)
         => leq(s_best7,n3) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_best7) )
        & ( gt(loopcounter,n0)
         => leq(s_sworst7,n3) )
        & ( gt(loopcounter,n0)
         => leq(s_worst7,n3) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_best7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_sworst7) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_sworst7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_worst7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_sworst7,n3) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_worst7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_best7,n3) ) )
     => leq(n0,s_best7) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    ( ( ~ leq(tptp_float_0_001,pv1341)
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_worst7,n3) )
      & ( gt(loopcounter,n0)
       => leq(s_best7,n3) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_best7) )
      & ( gt(loopcounter,n0)
       => leq(s_sworst7,n3) )
      & ( gt(loopcounter,n0)
       => leq(s_worst7,n3) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_best7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_sworst7) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_sworst7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_worst7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_sworst7,n3) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_worst7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_best7,n3) ) )
   => leq(n0,s_best7) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0001) ).

fof(f190,plain,
    ~ spl0_2,
    inference(avatar_split_clause,[],[f130,f156]) ).

fof(f156,plain,
    ( spl0_2
  <=> leq(n0,s_best7) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).

fof(f130,plain,
    ~ leq(n0,s_best7),
    inference(cnf_transformation,[],[f92]) ).

fof(f159,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f123,f156,f152]) ).

fof(f123,plain,
    ( leq(n0,s_best7)
    | leq(tptp_float_0_001,pv1341) ),
    inference(cnf_transformation,[],[f92]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWV131+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.33  % Computer : n017.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Tue Aug 30 18:26:35 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.19/0.53  % (13626)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.53  % (13626)First to succeed.
% 1.37/0.55  % (13619)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.54/0.55  % (13626)Refutation found. Thanks to Tanya!
% 1.54/0.55  % SZS status Theorem for theBenchmark
% 1.54/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 1.54/0.55  % (13626)------------------------------
% 1.54/0.55  % (13626)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.54/0.55  % (13626)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.54/0.55  % (13626)Termination reason: Refutation
% 1.54/0.55  
% 1.54/0.55  % (13626)Memory used [KB]: 6012
% 1.54/0.55  % (13626)Time elapsed: 0.007 s
% 1.54/0.55  % (13626)Instructions burned: 2 (million)
% 1.54/0.55  % (13626)------------------------------
% 1.54/0.55  % (13626)------------------------------
% 1.54/0.55  % (13617)Success in time 0.205 s
%------------------------------------------------------------------------------