%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWV069+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 : n006.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:03 EDT 2022

% Result   : Theorem 0.20s 0.53s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   49 (  31 unt;   0 def)
%            Number of atoms       :   87 (  20 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   62 (  24   ~;  20   |;  12   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    7 (   5 usr;   4 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :   13 (  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f274,plain,
    $false,
    inference(avatar_sat_refutation,[],[f218,f223,f225,f273]) ).

fof(f273,plain,
    spl0_3,
    inference(avatar_contradiction_clause,[],[f272]) ).

fof(f272,plain,
    ( $false
    | spl0_3 ),
    inference(subsumption_resolution,[],[f269,f244]) ).

fof(f244,plain,
    leq(n0,n4),
    inference(unit_resulting_resolution,[],[f170,f138]) ).

fof(f138,plain,
    ! [X0,X1] :
      ( ~ gt(X1,X0)
      | leq(X0,X1) ),
    inference(cnf_transformation,[],[f106]) ).

fof(f106,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | ~ gt(X1,X0) ),
    inference(ennf_transformation,[],[f8]) ).

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

fof(f170,plain,
    gt(n4,n0),
    inference(cnf_transformation,[],[f65]) ).

fof(f65,axiom,
    gt(n4,n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_4_0) ).

fof(f269,plain,
    ( ~ leq(n0,n4)
    | spl0_3 ),
    inference(backward_demodulation,[],[f217,f267]) ).

fof(f267,plain,
    n4 = minus(n5,n1),
    inference(superposition,[],[f198,f221]) ).

fof(f221,plain,
    n5 = succ(n4),
    inference(backward_demodulation,[],[f204,f220]) ).

fof(f220,plain,
    n4 = succ(n3),
    inference(forward_demodulation,[],[f219,f202]) ).

fof(f202,plain,
    n3 = succ(n2),
    inference(forward_demodulation,[],[f139,f192]) ).

fof(f192,plain,
    n2 = succ(succ(n0)),
    inference(cnf_transformation,[],[f92]) ).

fof(f92,axiom,
    n2 = succ(succ(n0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_2) ).

fof(f139,plain,
    n3 = succ(succ(succ(n0))),
    inference(cnf_transformation,[],[f93]) ).

fof(f93,axiom,
    n3 = succ(succ(succ(n0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_3) ).

fof(f219,plain,
    n4 = succ(succ(n2)),
    inference(forward_demodulation,[],[f158,f192]) ).

fof(f158,plain,
    n4 = succ(succ(succ(succ(n0)))),
    inference(cnf_transformation,[],[f89]) ).

fof(f89,axiom,
    n4 = succ(succ(succ(succ(n0)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_4) ).

fof(f204,plain,
    n5 = succ(succ(n3)),
    inference(forward_demodulation,[],[f203,f202]) ).

fof(f203,plain,
    n5 = succ(succ(succ(n2))),
    inference(forward_demodulation,[],[f141,f192]) ).

fof(f141,plain,
    n5 = succ(succ(succ(succ(succ(n0))))),
    inference(cnf_transformation,[],[f90]) ).

fof(f90,axiom,
    n5 = succ(succ(succ(succ(succ(n0))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_5) ).

fof(f198,plain,
    ! [X0] : minus(succ(X0),n1) = X0,
    inference(definition_unfolding,[],[f148,f157]) ).

fof(f157,plain,
    ! [X0] : minus(X0,n1) = pred(X0),
    inference(cnf_transformation,[],[f39]) ).

fof(f39,axiom,
    ! [X0] : minus(X0,n1) = pred(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_minus_1) ).

fof(f148,plain,
    ! [X0] : pred(succ(X0)) = X0,
    inference(cnf_transformation,[],[f40]) ).

fof(f40,axiom,
    ! [X0] : pred(succ(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_succ) ).

fof(f217,plain,
    ( ~ leq(n0,minus(n5,n1))
    | spl0_3 ),
    inference(avatar_component_clause,[],[f215]) ).

fof(f215,plain,
    ( spl0_3
  <=> leq(n0,minus(n5,n1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).

fof(f225,plain,
    spl0_1,
    inference(avatar_contradiction_clause,[],[f224]) ).

fof(f224,plain,
    ( $false
    | spl0_1 ),
    inference(subsumption_resolution,[],[f209,f197]) ).

fof(f197,plain,
    ! [X0] : leq(X0,X0),
    inference(cnf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X0] : leq(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_leq) ).

fof(f209,plain,
    ( ~ leq(n0,n0)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f207]) ).

fof(f207,plain,
    ( spl0_1
  <=> leq(n0,n0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).

fof(f223,plain,
    spl0_2,
    inference(avatar_split_clause,[],[f186,f211]) ).

fof(f211,plain,
    ( spl0_2
  <=> leq(pv10,minus(n135300,n1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).

fof(f186,plain,
    leq(pv10,minus(n135300,n1)),
    inference(cnf_transformation,[],[f110]) ).

fof(f110,plain,
    ( leq(pv10,minus(n135300,n1))
    & leq(n0,pv10)
    & ( ~ leq(pv10,minus(n135300,n1))
      | ~ leq(n0,minus(n5,n1))
      | ~ leq(n0,n0)
      | ~ leq(n0,pv10) ) ),
    inference(flattening,[],[f109]) ).

fof(f109,plain,
    ( ( ~ leq(pv10,minus(n135300,n1))
      | ~ leq(n0,minus(n5,n1))
      | ~ leq(n0,n0)
      | ~ leq(n0,pv10) )
    & leq(n0,pv10)
    & leq(pv10,minus(n135300,n1)) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(n0,pv10)
        & leq(pv10,minus(n135300,n1)) )
     => ( leq(n0,n0)
        & leq(pv10,minus(n135300,n1))
        & leq(n0,minus(n5,n1))
        & leq(n0,pv10) ) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    ( ( leq(n0,pv10)
      & leq(pv10,minus(n135300,n1)) )
   => ( leq(n0,n0)
      & leq(pv10,minus(n135300,n1))
      & leq(n0,minus(n5,n1))
      & leq(n0,pv10) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0010) ).

fof(f218,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(avatar_split_clause,[],[f205,f215,f211,f207]) ).

fof(f205,plain,
    ( ~ leq(n0,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(n0,n0) ),
    inference(subsumption_resolution,[],[f184,f185]) ).

fof(f185,plain,
    leq(n0,pv10),
    inference(cnf_transformation,[],[f110]) ).

fof(f184,plain,
    ( ~ leq(n0,n0)
    | ~ leq(n0,minus(n5,n1))
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    inference(cnf_transformation,[],[f110]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SWV069+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.06/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.34  % Computer : n006.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 18:57:54 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.50  % (2547)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)
% 0.20/0.52  % (2547)First to succeed.
% 0.20/0.52  % (2562)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.52  % (2536)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.52  % (2554)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.52  % (2540)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.52  % (2551)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.20/0.52  % (2537)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.52  % (2540)Also succeeded, but the first one will report.
% 0.20/0.53  % (2547)Refutation found. Thanks to Tanya!
% 0.20/0.53  % SZS status Theorem for theBenchmark
% 0.20/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53  % (2547)------------------------------
% 0.20/0.53  % (2547)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (2547)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (2547)Termination reason: Refutation
% 0.20/0.53  
% 0.20/0.53  % (2547)Memory used [KB]: 6140
% 0.20/0.53  % (2547)Time elapsed: 0.110 s
% 0.20/0.53  % (2547)Instructions burned: 5 (million)
% 0.20/0.53  % (2547)------------------------------
% 0.20/0.53  % (2547)------------------------------
% 0.20/0.53  % (2535)Success in time 0.177 s
%------------------------------------------------------------------------------