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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWV142+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 : n011.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.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   24 (   8 unt;   0 def)
%            Number of atoms       :  140 (   2 equ)
%            Maximal formula atoms :   27 (   5 avg)
%            Number of connectives :  152 (  36   ~;  32   |;  54   &)
%                                         (   2 <=>;  28  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-1 aty)
%            Number of variables   :   11 (  11   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f252,plain,
    $false,
    inference(avatar_sat_refutation,[],[f169,f196,f251]) ).

fof(f251,plain,
    spl0_2,
    inference(avatar_contradiction_clause,[],[f250]) ).

fof(f250,plain,
    ( $false
    | spl0_2 ),
    inference(subsumption_resolution,[],[f241,f168]) ).

fof(f168,plain,
    ( ~ gt(loopcounter,n0)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f166]) ).

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

fof(f241,plain,
    gt(loopcounter,n0),
    inference(resolution,[],[f221,f132]) ).

fof(f132,plain,
    leq(n1,loopcounter),
    inference(cnf_transformation,[],[f106]) ).

fof(f106,plain,
    ( ( leq(tptp_float_0_001,pv1341)
      | leq(n0,s_best7) )
    & ( leq(tptp_float_0_001,pv1341)
      | leq(n0,s_sworst7) )
    & ( leq(tptp_float_0_001,pv1341)
      | leq(n0,s_worst7) )
    & ( leq(s_best7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(tptp_float_0_001,pv1341)
      | leq(s_best7,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(s_sworst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( ~ gt(loopcounter,n0)
      | leq(s_sworst7,n3) )
    & ( leq(n0,s_best7)
      | ~ gt(loopcounter,n0) )
    & ~ leq(s_best7,n3)
    & ( leq(s_worst7,n3)
      | ~ gt(loopcounter,n0) )
    & leq(n1,loopcounter) ),
    inference(flattening,[],[f105]) ).

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

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

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

fof(f221,plain,
    ! [X0] :
      ( ~ leq(n1,X0)
      | gt(X0,n0) ),
    inference(superposition,[],[f122,f158]) ).

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

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

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

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

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

fof(f90,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(f196,plain,
    ~ spl0_1,
    inference(avatar_split_clause,[],[f134,f162]) ).

fof(f162,plain,
    ( spl0_1
  <=> leq(s_best7,n3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).

fof(f134,plain,
    ~ leq(s_best7,n3),
    inference(cnf_transformation,[],[f106]) ).

fof(f169,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f143,f166,f162]) ).

fof(f143,plain,
    ( ~ gt(loopcounter,n0)
    | leq(s_best7,n3) ),
    inference(cnf_transformation,[],[f106]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SWV142+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.10/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33  % Computer : n011.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 19:00:40 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.19/0.47  % (12784)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.49  % (12784)Instruction limit reached!
% 0.19/0.49  % (12784)------------------------------
% 0.19/0.49  % (12784)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (12775)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.49  % (12784)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49  % (12784)Termination reason: Unknown
% 0.19/0.49  % (12784)Termination phase: Property scanning
% 0.19/0.49  
% 0.19/0.49  % (12784)Memory used [KB]: 1663
% 0.19/0.49  % (12784)Time elapsed: 0.007 s
% 0.19/0.49  % (12784)Instructions burned: 8 (million)
% 0.19/0.49  % (12784)------------------------------
% 0.19/0.49  % (12784)------------------------------
% 0.19/0.50  % (12775)First to succeed.
% 0.19/0.50  % (12775)Refutation found. Thanks to Tanya!
% 0.19/0.50  % SZS status Theorem for theBenchmark
% 0.19/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50  % (12775)------------------------------
% 0.19/0.50  % (12775)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (12775)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (12775)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (12775)Memory used [KB]: 6012
% 0.19/0.50  % (12775)Time elapsed: 0.107 s
% 0.19/0.50  % (12775)Instructions burned: 4 (million)
% 0.19/0.50  % (12775)------------------------------
% 0.19/0.50  % (12775)------------------------------
% 0.19/0.50  % (12768)Success in time 0.157 s
%------------------------------------------------------------------------------