TSTP Solution File: SWV135+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SWV135+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n017.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 : Tue Apr 30 16:40:40 EDT 2024

% Result   : Theorem 0.22s 0.40s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   24 (  14 unt;   0 def)
%            Number of atoms       :   62 (   5 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   52 (  14   ~;   4   |;  30   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-1 aty)
%            Number of variables   :   12 (  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f476,plain,
    $false,
    inference(resolution,[],[f475,f249]) ).

fof(f249,plain,
    leq(n2,pv1325),
    inference(cnf_transformation,[],[f109]) ).

fof(f109,plain,
    ( ~ leq(n0,pv1325)
    & leq(pv1325,n3)
    & leq(s_worst7,n3)
    & leq(s_sworst7,n3)
    & leq(s_best7,n3)
    & leq(n2,pv1325)
    & leq(n0,s_worst7)
    & leq(n0,s_sworst7)
    & leq(n0,s_best7) ),
    inference(flattening,[],[f108]) ).

fof(f108,plain,
    ( ~ leq(n0,pv1325)
    & leq(pv1325,n3)
    & leq(s_worst7,n3)
    & leq(s_sworst7,n3)
    & leq(s_best7,n3)
    & leq(n2,pv1325)
    & leq(n0,s_worst7)
    & leq(n0,s_sworst7)
    & leq(n0,s_best7) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(pv1325,n3)
        & leq(s_worst7,n3)
        & leq(s_sworst7,n3)
        & leq(s_best7,n3)
        & leq(n2,pv1325)
        & leq(n0,s_worst7)
        & leq(n0,s_sworst7)
        & leq(n0,s_best7) )
     => leq(n0,pv1325) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    ( ( leq(pv1325,n3)
      & leq(s_worst7,n3)
      & leq(s_sworst7,n3)
      & leq(s_best7,n3)
      & leq(n2,pv1325)
      & leq(n0,s_worst7)
      & leq(n0,s_sworst7)
      & leq(n0,s_best7) )
   => leq(n0,pv1325) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0005) ).

fof(f475,plain,
    ~ leq(n2,pv1325),
    inference(forward_demodulation,[],[f474,f409]) ).

fof(f409,plain,
    n2 = succ(n1),
    inference(forward_demodulation,[],[f279,f277]) ).

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

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

fof(f279,plain,
    n2 = succ(succ(n0)),
    inference(cnf_transformation,[],[f85]) ).

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

fof(f474,plain,
    ~ leq(succ(n1),pv1325),
    inference(resolution,[],[f473,f312]) ).

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

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

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

fof(f473,plain,
    ~ gt(pv1325,n1),
    inference(resolution,[],[f472,f308]) ).

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

fof(f122,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/sandbox/benchmark/theBenchmark.p',leq_gt1) ).

fof(f472,plain,
    ~ leq(n1,pv1325),
    inference(forward_demodulation,[],[f471,f277]) ).

fof(f471,plain,
    ~ leq(succ(n0),pv1325),
    inference(resolution,[],[f312,f450]) ).

fof(f450,plain,
    ~ gt(pv1325,n0),
    inference(resolution,[],[f308,f254]) ).

fof(f254,plain,
    ~ leq(n0,pv1325),
    inference(cnf_transformation,[],[f109]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13  % Problem    : SWV135+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.15/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n017.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Tue Apr 30 04:10:04 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.22/0.37  % (30248)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.38  % (30251)WARNING: value z3 for option sas not known
% 0.22/0.39  % (30249)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.22/0.39  % (30250)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.22/0.39  % (30252)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.22/0.39  % (30251)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.39  % (30253)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.22/0.39  % (30254)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.22/0.39  % (30255)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.22/0.40  % (30254)First to succeed.
% 0.22/0.40  % (30254)Refutation found. Thanks to Tanya!
% 0.22/0.40  % SZS status Theorem for theBenchmark
% 0.22/0.40  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.40  % (30254)------------------------------
% 0.22/0.40  % (30254)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.22/0.40  % (30254)Termination reason: Refutation
% 0.22/0.40  
% 0.22/0.40  % (30254)Memory used [KB]: 1150
% 0.22/0.40  % (30254)Time elapsed: 0.012 s
% 0.22/0.40  % (30254)Instructions burned: 18 (million)
% 0.22/0.40  % (30254)------------------------------
% 0.22/0.40  % (30254)------------------------------
% 0.22/0.40  % (30248)Success in time 0.031 s
%------------------------------------------------------------------------------