TSTP Solution File: ARI180_1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : ARI180_1 : TPTP v8.1.0. Released v5.0.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 : n012.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 15:45:35 EDT 2022

% Result   : Theorem 0.18s 0.51s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   36 (  18 unt;   3 typ;   0 def)
%            Number of atoms       :   60 (  44 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   43 (  16   ~;   8   |;  14   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number arithmetic     :  139 (  15 atm;  60 fun;  36 num;  28 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    1 (   1   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   3 usr;   3 con; 0-2 aty)
%            Number of variables   :   28 (  22   !;   6   ?;  28   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    f: $int > $int ).

tff(func_def_6,type,
    sK0: $int ).

tff(func_def_7,type,
    sK1: $int ).

tff(f166,plain,
    $false,
    inference(subsumption_resolution,[],[f163,f21]) ).

tff(f21,plain,
    f(0) != sK0,
    inference(cnf_transformation,[],[f20]) ).

tff(f20,plain,
    ( ( f(sK1) = $sum(sK1,sK0) )
    & ( 0 = $sum(sK0,$uminus(f(sK1))) )
    & ( f(0) != sK0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f18,f19]) ).

tff(f19,plain,
    ( ? [X0: $int,X1: $int] :
        ( ( f(X1) = $sum(X1,X0) )
        & ( 0 = $sum(X0,$uminus(f(X1))) )
        & ( f(0) != X0 ) )
   => ( ( f(sK1) = $sum(sK1,sK0) )
      & ( 0 = $sum(sK0,$uminus(f(sK1))) )
      & ( f(0) != sK0 ) ) ),
    introduced(choice_axiom,[]) ).

tff(f18,plain,
    ? [X0: $int,X1: $int] :
      ( ( f(X1) = $sum(X1,X0) )
      & ( 0 = $sum(X0,$uminus(f(X1))) )
      & ( f(0) != X0 ) ),
    inference(flattening,[],[f17]) ).

tff(f17,plain,
    ? [X0: $int,X1: $int] :
      ( ( f(0) != X0 )
      & ( 0 = $sum(X0,$uminus(f(X1))) )
      & ( f(X1) = $sum(X1,X0) ) ),
    inference(ennf_transformation,[],[f16]) ).

tff(f16,plain,
    ~ ! [X0: $int,X1: $int] :
        ( ( ( 0 = $sum(X0,$uminus(f(X1))) )
          & ( f(X1) = $sum(X1,X0) ) )
       => ( f(0) = X0 ) ),
    inference(rectify,[],[f3]) ).

tff(f3,plain,
    ~ ! [X1: $int,X0: $int] :
        ( ( ( $sum(X0,X1) = f(X0) )
          & ( 0 = $sum(X1,$uminus(f(X0))) ) )
       => ( f(0) = X1 ) ),
    inference(theory_normalization,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ! [X1: $int,X0: $int] :
        ( ( ( $sum(X0,X1) = f(X0) )
          & ( $difference(X1,f(X0)) = 0 ) )
       => ( f(0) = X1 ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ! [X1: $int,X0: $int] :
      ( ( ( $sum(X0,X1) = f(X0) )
        & ( $difference(X1,f(X0)) = 0 ) )
     => ( f(0) = X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

tff(f163,plain,
    f(0) = sK0,
    inference(superposition,[],[f98,f137]) ).

tff(f137,plain,
    0 = sK1,
    inference(superposition,[],[f6,f81]) ).

tff(f81,plain,
    0 = $sum(sK1,0),
    inference(superposition,[],[f47,f8]) ).

tff(f8,plain,
    ! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
    introduced(theory_axiom_145,[]) ).

tff(f47,plain,
    0 = $sum(sK1,$sum(sK0,$uminus(sK0))),
    inference(superposition,[],[f5,f30]) ).

tff(f30,plain,
    0 = $sum($sum(sK1,sK0),$uminus(sK0)),
    inference(superposition,[],[f29,f23]) ).

tff(f23,plain,
    f(sK1) = $sum(sK1,sK0),
    inference(cnf_transformation,[],[f20]) ).

tff(f29,plain,
    0 = $sum(f(sK1),$uminus(sK0)),
    inference(evaluation,[],[f26]) ).

tff(f26,plain,
    $sum($uminus($uminus(f(sK1))),$uminus(sK0)) = $uminus(0),
    inference(superposition,[],[f7,f22]) ).

tff(f22,plain,
    0 = $sum(sK0,$uminus(f(sK1))),
    inference(cnf_transformation,[],[f20]) ).

tff(f7,plain,
    ! [X0: $int,X1: $int] : ( $sum($uminus(X1),$uminus(X0)) = $uminus($sum(X0,X1)) ),
    introduced(theory_axiom_144,[]) ).

tff(f5,plain,
    ! [X2: $int,X0: $int,X1: $int] : ( $sum($sum(X0,X1),X2) = $sum(X0,$sum(X1,X2)) ),
    introduced(theory_axiom_141,[]) ).

tff(f6,plain,
    ! [X0: $int] : ( $sum(X0,0) = X0 ),
    introduced(theory_axiom_142,[]) ).

tff(f98,plain,
    f(sK1) = sK0,
    inference(subsumption_resolution,[],[f96,f66]) ).

tff(f66,plain,
    ~ $less(f(sK1),sK0),
    inference(evaluation,[],[f61]) ).

tff(f61,plain,
    ( $less(0,0)
    | ~ $less(f(sK1),sK0) ),
    inference(superposition,[],[f27,f8]) ).

tff(f27,plain,
    ! [X1: $int] :
      ( $less($sum(X1,$uminus(f(sK1))),0)
      | ~ $less(X1,sK0) ),
    inference(superposition,[],[f12,f22]) ).

tff(f12,plain,
    ! [X2: $int,X0: $int,X1: $int] :
      ( $less($sum(X0,X2),$sum(X1,X2))
      | ~ $less(X0,X1) ),
    introduced(theory_axiom_150,[]) ).

tff(f96,plain,
    ( $less(f(sK1),sK0)
    | ( f(sK1) = sK0 ) ),
    inference(resolution,[],[f95,f11]) ).

tff(f11,plain,
    ! [X0: $int,X1: $int] :
      ( $less(X1,X0)
      | ( X0 = X1 )
      | $less(X0,X1) ),
    introduced(theory_axiom_149,[]) ).

tff(f95,plain,
    ~ $less(sK0,f(sK1)),
    inference(evaluation,[],[f89]) ).

tff(f89,plain,
    ( ~ $less(sK0,f(sK1))
    | $less(0,0) ),
    inference(superposition,[],[f28,f8]) ).

tff(f28,plain,
    ! [X2: $int] :
      ( $less(0,$sum(X2,$uminus(f(sK1))))
      | ~ $less(sK0,X2) ),
    inference(superposition,[],[f12,f22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : ARI180=1 : TPTP v8.1.0. Released v5.0.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 : n012.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   : Mon Aug 29 15:23:36 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.18/0.48  % (32064)lrs+10_1:1_canc=force:tha=some:to=lpo:i=35:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/35Mi)
% 0.18/0.48  % (32058)ott+1011_1:2_br=off:bs=unit_only:bsr=unit_only:nwc=5.0:s2a=on:s2agt=32:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.18/0.48  % (32080)lrs+1_3:1_ep=RSTC:sos=on:urr=on:i=43:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/43Mi)
% 0.18/0.48  % (32056)dis+1011_1:64_drc=off:flr=on:nwc=2.0:sac=on:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.18/0.48  % (32061)lrs+1010_1:1_bd=off:fd=off:fde=none:ins=3:sac=on:sos=on:spb=goal:to=lpo:i=36:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/36Mi)
% 0.18/0.49  % (32061)First to succeed.
% 0.18/0.49  % (32072)lrs+10_1:1_ss=axioms:st=5.0:tha=off:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.18/0.49  % (32077)dis+32_1:1_bd=off:nm=4:sos=on:ss=included:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.49  % (32083)dis+20_1:12_aac=none:acc=model:awrs=converge:fd=preordered:fsr=off:nicw=on:nwc=3.0:s2a=on:s2agt=16:spb=goal:to=lpo:i=41:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/41Mi)
% 0.18/0.49  % (32062)lrs+1010_1:1_ep=RST:s2a=on:s2at=5.0:sos=all:i=26:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/26Mi)
% 0.18/0.50  % (32075)dis+10_1:64_nwc=1.4:rp=on:tha=off:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.18/0.50  % (32075)Refutation not found, incomplete strategy% (32075)------------------------------
% 0.18/0.50  % (32075)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50  % (32075)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50  % (32075)Termination reason: Refutation not found, incomplete strategy
% 0.18/0.50  
% 0.18/0.50  % (32075)Memory used [KB]: 5373
% 0.18/0.50  % (32075)Time elapsed: 0.125 s
% 0.18/0.50  % (32075)Instructions burned: 1 (million)
% 0.18/0.50  % (32075)------------------------------
% 0.18/0.50  % (32075)------------------------------
% 0.18/0.51  % (32061)Refutation found. Thanks to Tanya!
% 0.18/0.51  % SZS status Theorem for theBenchmark
% 0.18/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.51  % (32061)------------------------------
% 0.18/0.51  % (32061)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51  % (32061)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51  % (32061)Termination reason: Refutation
% 0.18/0.51  
% 0.18/0.51  % (32061)Memory used [KB]: 5500
% 0.18/0.51  % (32061)Time elapsed: 0.103 s
% 0.18/0.51  % (32061)Instructions burned: 5 (million)
% 0.18/0.51  % (32061)------------------------------
% 0.18/0.51  % (32061)------------------------------
% 0.18/0.51  % (32053)Success in time 0.171 s
%------------------------------------------------------------------------------