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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWV141+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 : n015.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:19 EDT 2022

% Result   : Theorem 0.21s 0.51s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   28 (  10 unt;   0 def)
%            Number of atoms       :  146 (   5 equ)
%            Maximal formula atoms :   27 (   5 avg)
%            Number of connectives :  156 (  38   ~;  34   |;  54   &)
%                                         (   2 <=>;  28  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   14 (  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f300,plain,
    $false,
    inference(avatar_sat_refutation,[],[f231,f232,f299]) ).

fof(f299,plain,
    spl0_3,
    inference(avatar_contradiction_clause,[],[f298]) ).

fof(f298,plain,
    ( $false
    | spl0_3 ),
    inference(subsumption_resolution,[],[f297,f159]) ).

fof(f159,plain,
    leq(n1,loopcounter),
    inference(cnf_transformation,[],[f115]) ).

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

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

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

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

fof(f297,plain,
    ( ~ leq(n1,loopcounter)
    | spl0_3 ),
    inference(forward_demodulation,[],[f289,f210]) ).

fof(f210,plain,
    n1 = plus(n0,n1),
    inference(definition_unfolding,[],[f176,f145]) ).

fof(f145,plain,
    ! [X0] : succ(X0) = plus(X0,n1),
    inference(cnf_transformation,[],[f29]) ).

fof(f29,axiom,
    ! [X0] : succ(X0) = plus(X0,n1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_plus_1_r) ).

fof(f176,plain,
    n1 = succ(n0),
    inference(cnf_transformation,[],[f84]) ).

fof(f84,axiom,
    n1 = succ(n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).

fof(f289,plain,
    ( ~ leq(plus(n0,n1),loopcounter)
    | spl0_3 ),
    inference(unit_resulting_resolution,[],[f230,f205]) ).

fof(f205,plain,
    ! [X0,X1] :
      ( ~ leq(plus(X0,n1),X1)
      | gt(X1,X0) ),
    inference(definition_unfolding,[],[f144,f145]) ).

fof(f144,plain,
    ! [X0,X1] :
      ( gt(X1,X0)
      | ~ leq(succ(X0),X1) ),
    inference(cnf_transformation,[],[f121]) ).

fof(f121,plain,
    ! [X0,X1] :
      ( gt(X1,X0)
      | ~ leq(succ(X0),X1) ),
    inference(rectify,[],[f105]) ).

fof(f105,plain,
    ! [X1,X0] :
      ( gt(X0,X1)
      | ~ leq(succ(X1),X0) ),
    inference(ennf_transformation,[],[f89]) ).

fof(f89,plain,
    ! [X1,X0] :
      ( leq(succ(X1),X0)
     => gt(X0,X1) ),
    inference(rectify,[],[f43]) ).

fof(f43,axiom,
    ! [X1,X0] :
      ( leq(succ(X0),X1)
     => gt(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_succ_gt) ).

fof(f230,plain,
    ( ~ gt(loopcounter,n0)
    | spl0_3 ),
    inference(avatar_component_clause,[],[f228]) ).

fof(f228,plain,
    ( spl0_3
  <=> gt(loopcounter,n0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).

fof(f232,plain,
    ~ spl0_2,
    inference(avatar_split_clause,[],[f156,f223]) ).

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

fof(f156,plain,
    ~ leq(n0,s_worst7),
    inference(cnf_transformation,[],[f115]) ).

fof(f231,plain,
    ( spl0_2
    | ~ spl0_3 ),
    inference(avatar_split_clause,[],[f162,f228,f223]) ).

fof(f162,plain,
    ( ~ gt(loopcounter,n0)
    | leq(n0,s_worst7) ),
    inference(cnf_transformation,[],[f115]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SWV141+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.14  % 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.36  % Computer : n015.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Tue Aug 30 19:15:06 EDT 2022
% 0.14/0.36  % CPUTime    : 
% 0.21/0.48  % (19363)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.21/0.49  % (19383)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.21/0.50  % (19363)First to succeed.
% 0.21/0.50  % (19382)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.21/0.50  % (19382)Instruction limit reached!
% 0.21/0.50  % (19382)------------------------------
% 0.21/0.50  % (19382)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (19363)Refutation found. Thanks to Tanya!
% 0.21/0.51  % SZS status Theorem for theBenchmark
% 0.21/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51  % (19363)------------------------------
% 0.21/0.51  % (19363)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51  % (19363)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51  % (19363)Termination reason: Refutation
% 0.21/0.51  
% 0.21/0.51  % (19363)Memory used [KB]: 6140
% 0.21/0.51  % (19363)Time elapsed: 0.091 s
% 0.21/0.51  % (19363)Instructions burned: 6 (million)
% 0.21/0.51  % (19363)------------------------------
% 0.21/0.51  % (19363)------------------------------
% 0.21/0.51  % (19349)Success in time 0.142 s
%------------------------------------------------------------------------------