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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWV143+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 : n005.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 1.12s 0.53s
% Output   : Refutation 1.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (   7 unt;   0 def)
%            Number of atoms       :  139 (   2 equ)
%            Maximal formula atoms :   27 (   6 avg)
%            Number of connectives :  152 (  36   ~;  32   |;  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    :   10 (  10 usr;   9 con; 0-1 aty)
%            Number of variables   :    8 (   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f256,plain,
    $false,
    inference(avatar_sat_refutation,[],[f170,f194,f242]) ).

fof(f242,plain,
    spl0_3,
    inference(avatar_contradiction_clause,[],[f241]) ).

fof(f241,plain,
    ( $false
    | spl0_3 ),
    inference(subsumption_resolution,[],[f240,f150]) ).

fof(f150,plain,
    leq(n1,loopcounter),
    inference(cnf_transformation,[],[f108]) ).

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

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

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

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

fof(f240,plain,
    ( ~ leq(n1,loopcounter)
    | spl0_3 ),
    inference(forward_demodulation,[],[f233,f116]) ).

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

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

fof(f233,plain,
    ( ~ leq(succ(n0),loopcounter)
    | spl0_3 ),
    inference(unit_resulting_resolution,[],[f165,f113]) ).

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

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

fof(f91,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(f165,plain,
    ( ~ gt(loopcounter,n0)
    | spl0_3 ),
    inference(avatar_component_clause,[],[f163]) ).

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

fof(f194,plain,
    ~ spl0_4,
    inference(avatar_split_clause,[],[f152,f167]) ).

fof(f167,plain,
    ( spl0_4
  <=> leq(s_sworst7,n3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).

fof(f152,plain,
    ~ leq(s_sworst7,n3),
    inference(cnf_transformation,[],[f108]) ).

fof(f170,plain,
    ( ~ spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f148,f167,f163]) ).

fof(f148,plain,
    ( leq(s_sworst7,n3)
    | ~ gt(loopcounter,n0) ),
    inference(cnf_transformation,[],[f108]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWV143+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/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.15/0.35  % Computer : n005.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   : Tue Aug 30 19:03:03 EDT 2022
% 0.15/0.36  % CPUTime    : 
% 1.12/0.51  % (8757)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 1.12/0.51  % (8750)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)
% 1.12/0.52  % (8743)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)
% 1.12/0.52  % (8747)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 1.12/0.52  % (8741)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)
% 1.12/0.52  % (8750)Instruction limit reached!
% 1.12/0.52  % (8750)------------------------------
% 1.12/0.52  % (8750)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.12/0.52  % (8750)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.12/0.52  % (8750)Termination reason: Unknown
% 1.12/0.52  % (8750)Termination phase: Function definition elimination
% 1.12/0.52  
% 1.12/0.52  % (8750)Memory used [KB]: 1663
% 1.12/0.52  % (8750)Time elapsed: 0.008 s
% 1.12/0.52  % (8750)Instructions burned: 7 (million)
% 1.12/0.52  % (8750)------------------------------
% 1.12/0.52  % (8750)------------------------------
% 1.12/0.52  % (8743)First to succeed.
% 1.12/0.52  % (8746)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.12/0.53  % (8743)Refutation found. Thanks to Tanya!
% 1.12/0.53  % SZS status Theorem for theBenchmark
% 1.12/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 1.12/0.53  % (8743)------------------------------
% 1.12/0.53  % (8743)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.12/0.53  % (8743)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.12/0.53  % (8743)Termination reason: Refutation
% 1.12/0.53  
% 1.12/0.53  % (8743)Memory used [KB]: 6140
% 1.12/0.53  % (8743)Time elapsed: 0.109 s
% 1.12/0.53  % (8743)Instructions burned: 3 (million)
% 1.12/0.53  % (8743)------------------------------
% 1.12/0.53  % (8743)------------------------------
% 1.12/0.53  % (8734)Success in time 0.163 s
%------------------------------------------------------------------------------