TSTP Solution File: NUM850+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : NUM850+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n018.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:06:58 EDT 2022

% Result   : Theorem 1.53s 0.59s
% Output   : Refutation 1.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   21 (  10 unt;   3 typ;   0 def)
%            Number of atoms       :   32 (  18 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   26 (  12   ~;   8   |;   3   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    4 (   0 usr;   3 ari)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   29 (  22   !;   7   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_6,type,
    sQ5_eqProxy: ( $int * $int ) > $o ).

tff(pred_def_7,type,
    sQ6_eqProxy: ( $rat * $rat ) > $o ).

tff(pred_def_8,type,
    sQ7_eqProxy: ( $real * $real ) > $o ).

fof(f515,plain,
    $false,
    inference(subsumption_resolution,[],[f513,f273]) ).

fof(f273,plain,
    ! [X0] : vd470 != vplus(vd471,X0),
    inference(literal_reordering,[],[f187]) ).

fof(f187,plain,
    ! [X0] : vd470 != vplus(vd471,X0),
    inference(cnf_transformation,[],[f120]) ).

fof(f120,plain,
    ! [X0] : vd470 != vplus(vd471,X0),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ? [X0] : vd470 = vplus(vd471,X0),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ? [X0] : vd470 = vplus(vd471,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(conseq_conjunct1(conseq(302)))') ).

fof(f513,plain,
    vd470 = vplus(vd471,sK0(vd471,vd470)),
    inference(resolution,[],[f282,f287]) ).

fof(f287,plain,
    greater(vd470,vd471),
    inference(literal_reordering,[],[f221]) ).

fof(f221,plain,
    greater(vd470,vd471),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    greater(vd470,vd471),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(antec(302), 472, 0)') ).

fof(f282,plain,
    ! [X0,X1] :
      ( ~ greater(X1,X0)
      | vplus(X0,sK0(X0,X1)) = X1 ),
    inference(literal_reordering,[],[f185]) ).

fof(f185,plain,
    ! [X0,X1] :
      ( ~ greater(X1,X0)
      | vplus(X0,sK0(X0,X1)) = X1 ),
    inference(cnf_transformation,[],[f140]) ).

fof(f140,plain,
    ! [X0,X1] :
      ( ( vplus(X0,sK0(X0,X1)) = X1
        | ~ greater(X1,X0) )
      & ( greater(X1,X0)
        | ! [X3] : vplus(X0,X3) != X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f138,f139]) ).

fof(f139,plain,
    ! [X0,X1] :
      ( ? [X2] : vplus(X0,X2) = X1
     => vplus(X0,sK0(X0,X1)) = X1 ),
    introduced(choice_axiom,[]) ).

fof(f138,plain,
    ! [X0,X1] :
      ( ( ? [X2] : vplus(X0,X2) = X1
        | ~ greater(X1,X0) )
      & ( greater(X1,X0)
        | ! [X3] : vplus(X0,X3) != X1 ) ),
    inference(rectify,[],[f137]) ).

fof(f137,plain,
    ! [X1,X0] :
      ( ( ? [X2] : vplus(X1,X2) = X0
        | ~ greater(X0,X1) )
      & ( greater(X0,X1)
        | ! [X2] : vplus(X1,X2) != X0 ) ),
    inference(nnf_transformation,[],[f69]) ).

fof(f69,plain,
    ! [X1,X0] :
      ( ? [X2] : vplus(X1,X2) = X0
    <=> greater(X0,X1) ),
    inference(rectify,[],[f37]) ).

fof(f37,axiom,
    ! [X66,X65] :
      ( greater(X66,X65)
    <=> ? [X67] : vplus(X65,X67) = X66 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NUM850+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35  % Computer : n018.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 09:07:55 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.54  % (17194)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55  % (17202)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.55  TRYING [1]
% 0.20/0.55  TRYING [2]
% 0.20/0.55  % (17211)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.56  % (17203)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.56  % (17210)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.56  TRYING [3]
% 0.20/0.56  % (17195)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.53/0.58  % (17195)Instruction limit reached!
% 1.53/0.58  % (17195)------------------------------
% 1.53/0.58  % (17195)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.58  % (17195)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.58  % (17195)Termination reason: Unknown
% 1.53/0.58  % (17195)Termination phase: Saturation
% 1.53/0.58  
% 1.53/0.58  % (17195)Memory used [KB]: 5628
% 1.53/0.58  % (17195)Time elapsed: 0.088 s
% 1.53/0.58  % (17195)Instructions burned: 7 (million)
% 1.53/0.58  % (17195)------------------------------
% 1.53/0.58  % (17195)------------------------------
% 1.53/0.59  % (17202)First to succeed.
% 1.53/0.59  % (17202)Refutation found. Thanks to Tanya!
% 1.53/0.59  % SZS status Theorem for theBenchmark
% 1.53/0.59  % SZS output start Proof for theBenchmark
% See solution above
% 1.53/0.59  % (17202)------------------------------
% 1.53/0.59  % (17202)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.59  % (17202)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.59  % (17202)Termination reason: Refutation
% 1.53/0.59  
% 1.53/0.59  % (17202)Memory used [KB]: 6012
% 1.53/0.59  % (17202)Time elapsed: 0.014 s
% 1.53/0.59  % (17202)Instructions burned: 12 (million)
% 1.53/0.59  % (17202)------------------------------
% 1.53/0.59  % (17202)------------------------------
% 1.53/0.59  % (17187)Success in time 0.231 s
%------------------------------------------------------------------------------