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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWV140+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 : n002.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:18 EDT 2022

% Result   : Theorem 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (  11 unt;   0 def)
%            Number of atoms       :  129 (   5 equ)
%            Maximal formula atoms :   27 (   6 avg)
%            Number of connectives :  144 (  35   ~;  28   |;  54   &)
%                                         (   0 <=>;  27  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   10 (  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f546,plain,
    $false,
    inference(subsumption_resolution,[],[f545,f396]) ).

fof(f396,plain,
    leq(n1,loopcounter),
    inference(cnf_transformation,[],[f165]) ).

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

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

fof(f53,conjecture,
    ( ( ( gt(loopcounter,n0)
       => leq(n0,s_best7) )
      & ( gt(loopcounter,n0)
       => leq(s_best7,n3) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_sworst7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_worst7,n3) )
      & leq(n1,loopcounter)
      & ( ~ 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) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_sworst7,n3) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_worst7) )
      & leq(tptp_float_0_001,pv1341)
      & ( gt(loopcounter,n0)
       => leq(n0,s_sworst7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_best7,n3) )
      & ( gt(loopcounter,n0)
       => leq(s_worst7,n3) ) )
   => leq(n0,s_sworst7) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0010) ).

fof(f545,plain,
    ~ leq(n1,loopcounter),
    inference(forward_demodulation,[],[f542,f404]) ).

fof(f404,plain,
    n1 = plus(n0,n1),
    inference(definition_unfolding,[],[f262,f302]) ).

fof(f302,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(f262,plain,
    n1 = succ(n0),
    inference(cnf_transformation,[],[f84]) ).

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

fof(f542,plain,
    ~ leq(plus(n0,n1),loopcounter),
    inference(unit_resulting_resolution,[],[f426,f400]) ).

fof(f400,plain,
    ! [X0,X1] :
      ( ~ leq(plus(X0,n1),X1)
      | gt(X1,X0) ),
    inference(definition_unfolding,[],[f241,f302]) ).

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

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

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

fof(f426,plain,
    ~ gt(loopcounter,n0),
    inference(subsumption_resolution,[],[f385,f399]) ).

fof(f399,plain,
    ~ leq(n0,s_sworst7),
    inference(cnf_transformation,[],[f165]) ).

fof(f385,plain,
    ( ~ gt(loopcounter,n0)
    | leq(n0,s_sworst7) ),
    inference(cnf_transformation,[],[f165]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWV140+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/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.13/0.33  % Computer : n002.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Aug 30 19:15:44 EDT 2022
% 0.13/0.33  % CPUTime    : 
% 0.19/0.46  % (7675)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)
% 0.19/0.47  % (7675)Instruction limit reached!
% 0.19/0.47  % (7675)------------------------------
% 0.19/0.47  % (7675)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47  % (7684)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.48  % (7675)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48  % (7675)Termination reason: Unknown
% 0.19/0.48  % (7675)Termination phase: Saturation
% 0.19/0.48  
% 0.19/0.48  % (7675)Memory used [KB]: 1918
% 0.19/0.48  % (7675)Time elapsed: 0.010 s
% 0.19/0.48  % (7675)Instructions burned: 16 (million)
% 0.19/0.48  % (7675)------------------------------
% 0.19/0.48  % (7675)------------------------------
% 0.19/0.50  % (7684)First to succeed.
% 0.19/0.50  % (7684)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  % (7684)------------------------------
% 0.19/0.50  % (7684)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (7684)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (7684)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (7684)Memory used [KB]: 6908
% 0.19/0.50  % (7684)Time elapsed: 0.100 s
% 0.19/0.50  % (7684)Instructions burned: 36 (million)
% 0.19/0.50  % (7684)------------------------------
% 0.19/0.50  % (7684)------------------------------
% 0.19/0.50  % (7662)Success in time 0.158 s
%------------------------------------------------------------------------------