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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SWV142+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 : n011.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:41 EDT 2024

% Result   : Theorem 0.15s 0.39s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   7 unt;   0 def)
%            Number of atoms       :  129 (   2 equ)
%            Maximal formula atoms :   27 (   7 avg)
%            Number of connectives :  146 (  35   ~;  30   |;  54   &)
%                                         (   0 <=>;  27  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-1 aty)
%            Number of variables   :    7 (   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f577,plain,
    $false,
    inference(subsumption_resolution,[],[f569,f415]) ).

fof(f415,plain,
    ~ gt(loopcounter,n0),
    inference(global_subsumption,[],[f260,f259,f258,f257]) ).

fof(f257,plain,
    ( leq(s_best7,n3)
    | ~ gt(loopcounter,n0) ),
    inference(cnf_transformation,[],[f109]) ).

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

fof(f108,plain,
    ( ~ leq(s_best7,n3)
    & ( leq(s_worst7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_sworst7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_best7,n3)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_worst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_sworst7)
      | ~ gt(loopcounter,n0) )
    & ( leq(n0,s_best7)
      | ~ gt(loopcounter,n0) )
    & ( leq(s_worst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_sworst7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(s_best7,n3)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_worst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_sworst7)
      | leq(tptp_float_0_001,pv1341) )
    & ( leq(n0,s_best7)
      | leq(tptp_float_0_001,pv1341) )
    & leq(n1,loopcounter)
    & leq(tptp_float_0_001,pv1341) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ ( ( ( gt(loopcounter,n0)
         => leq(s_worst7,n3) )
        & ( gt(loopcounter,n0)
         => leq(s_sworst7,n3) )
        & ( gt(loopcounter,n0)
         => leq(s_best7,n3) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_worst7) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_sworst7) )
        & ( gt(loopcounter,n0)
         => leq(n0,s_best7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_worst7,n3) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_sworst7,n3) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(s_best7,n3) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_worst7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_sworst7) )
        & ( ~ leq(tptp_float_0_001,pv1341)
         => leq(n0,s_best7) )
        & leq(n1,loopcounter)
        & leq(tptp_float_0_001,pv1341) )
     => leq(s_best7,n3) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    ( ( ( gt(loopcounter,n0)
       => leq(s_worst7,n3) )
      & ( gt(loopcounter,n0)
       => leq(s_sworst7,n3) )
      & ( gt(loopcounter,n0)
       => leq(s_best7,n3) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_worst7) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_sworst7) )
      & ( gt(loopcounter,n0)
       => leq(n0,s_best7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_worst7,n3) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_sworst7,n3) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(s_best7,n3) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_worst7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_sworst7) )
      & ( ~ leq(tptp_float_0_001,pv1341)
       => leq(n0,s_best7) )
      & leq(n1,loopcounter)
      & leq(tptp_float_0_001,pv1341) )
   => leq(s_best7,n3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0012) ).

fof(f258,plain,
    ( leq(s_sworst7,n3)
    | ~ gt(loopcounter,n0) ),
    inference(cnf_transformation,[],[f109]) ).

fof(f259,plain,
    ( leq(s_worst7,n3)
    | ~ gt(loopcounter,n0) ),
    inference(cnf_transformation,[],[f109]) ).

fof(f260,plain,
    ~ leq(s_best7,n3),
    inference(cnf_transformation,[],[f109]) ).

fof(f569,plain,
    gt(loopcounter,n0),
    inference(resolution,[],[f562,f247]) ).

fof(f247,plain,
    leq(n1,loopcounter),
    inference(cnf_transformation,[],[f109]) ).

fof(f562,plain,
    ! [X0] :
      ( ~ leq(n1,X0)
      | gt(X0,n0) ),
    inference(superposition,[],[f318,f283]) ).

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

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

fof(f318,plain,
    ! [X0,X1] :
      ( ~ leq(succ(X0),X1)
      | gt(X1,X0) ),
    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/sandbox2/benchmark/theBenchmark.p',leq_succ_gt) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWV142+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n011.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:40:01 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  % (8166)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38  % (8169)WARNING: value z3 for option sas not known
% 0.15/0.38  % (8169)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.15/0.38  % (8170)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38  % (8167)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38  % (8168)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38  % (8171)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.15/0.38  % (8172)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.15/0.38  % (8173)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.15/0.39  % (8169)First to succeed.
% 0.15/0.39  % (8172)Also succeeded, but the first one will report.
% 0.15/0.39  % (8169)Refutation found. Thanks to Tanya!
% 0.15/0.39  % SZS status Theorem for theBenchmark
% 0.15/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.40  % (8169)------------------------------
% 0.15/0.40  % (8169)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.40  % (8169)Termination reason: Refutation
% 0.15/0.40  
% 0.15/0.40  % (8169)Memory used [KB]: 1115
% 0.15/0.40  % (8169)Time elapsed: 0.013 s
% 0.15/0.40  % (8169)Instructions burned: 20 (million)
% 0.15/0.40  % (8169)------------------------------
% 0.15/0.40  % (8169)------------------------------
% 0.15/0.40  % (8166)Success in time 0.02 s
%------------------------------------------------------------------------------