TSTP Solution File: SWV023+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWV023+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -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 : Tue May 21 05:53:36 EDT 2024

% Result   : Theorem 0.54s 0.74s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    9 (   4 unt;   0 def)
%            Number of atoms       :   59 (  20 equ)
%            Maximal formula atoms :   11 (   6 avg)
%            Number of connectives :   67 (  17   ~;  12   |;  26   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-3 aty)
%            Number of variables   :   15 (  15   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f158,plain,
    $false,
    inference(subsumption_resolution,[],[f113,f117]) ).

fof(f117,plain,
    true,
    inference(cnf_transformation,[],[f51]) ).

fof(f51,axiom,
    true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ttrue) ).

fof(f113,plain,
    ~ true,
    inference(cnf_transformation,[],[f89]) ).

fof(f89,plain,
    ( ~ true
    & ! [X0] :
        ( init = a_select2(s_values7_init,X0)
        | ~ leq(X0,n3)
        | ~ leq(n0,X0) )
    & ! [X1] :
        ( ! [X2] :
            ( init = a_select3(simplex7_init,X2,X1)
            | ~ leq(X2,n3)
            | ~ leq(n0,X2) )
        | ~ leq(X1,n2)
        | ~ leq(n0,X1) )
    & init = sigma_init
    & i0_init = init ),
    inference(flattening,[],[f88]) ).

fof(f88,plain,
    ( ~ true
    & ! [X0] :
        ( init = a_select2(s_values7_init,X0)
        | ~ leq(X0,n3)
        | ~ leq(n0,X0) )
    & ! [X1] :
        ( ! [X2] :
            ( init = a_select3(simplex7_init,X2,X1)
            | ~ leq(X2,n3)
            | ~ leq(n0,X2) )
        | ~ leq(X1,n2)
        | ~ leq(n0,X1) )
    & init = sigma_init
    & i0_init = init ),
    inference(ennf_transformation,[],[f87]) ).

fof(f87,plain,
    ~ ( ( ! [X0] :
            ( ( leq(X0,n3)
              & leq(n0,X0) )
           => init = a_select2(s_values7_init,X0) )
        & ! [X1] :
            ( ( leq(X1,n2)
              & leq(n0,X1) )
           => ! [X2] :
                ( ( leq(X2,n3)
                  & leq(n0,X2) )
               => init = a_select3(simplex7_init,X2,X1) ) )
        & init = sigma_init
        & i0_init = init )
     => true ),
    inference(rectify,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ ( ( ! [X3] :
            ( ( leq(X3,n3)
              & leq(n0,X3) )
           => init = a_select2(s_values7_init,X3) )
        & ! [X13] :
            ( ( leq(X13,n2)
              & leq(n0,X13) )
           => ! [X17] :
                ( ( leq(X17,n3)
                  & leq(n0,X17) )
               => init = a_select3(simplex7_init,X17,X13) ) )
        & init = sigma_init
        & i0_init = init )
     => true ),
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    ( ( ! [X3] :
          ( ( leq(X3,n3)
            & leq(n0,X3) )
         => init = a_select2(s_values7_init,X3) )
      & ! [X13] :
          ( ( leq(X13,n2)
            & leq(n0,X13) )
         => ! [X17] :
              ( ( leq(X17,n3)
                & leq(n0,X17) )
             => init = a_select3(simplex7_init,X17,X13) ) )
      & init = sigma_init
      & i0_init = init )
   => true ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_init_0005) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWV023+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.07/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -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   : Sun May 19 07:13:08 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.54/0.73  % (1973)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.54/0.74  % (1972)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.54/0.74  % (1966)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.54/0.74  % (1968)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.74  % (1969)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.54/0.74  % (1967)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.54/0.74  % (1970)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.54/0.74  % (1971)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.54/0.74  % (1973)First to succeed.
% 0.54/0.74  % (1972)Also succeeded, but the first one will report.
% 0.54/0.74  % (1969)Also succeeded, but the first one will report.
% 0.54/0.74  % (1973)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1965"
% 0.54/0.74  % (1968)Also succeeded, but the first one will report.
% 0.54/0.74  % (1971)Also succeeded, but the first one will report.
% 0.54/0.74  % (1966)Also succeeded, but the first one will report.
% 0.54/0.74  % (1973)Refutation found. Thanks to Tanya!
% 0.54/0.74  % SZS status Theorem for theBenchmark
% 0.54/0.74  % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.74  % (1973)------------------------------
% 0.54/0.74  % (1973)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74  % (1973)Termination reason: Refutation
% 0.54/0.74  
% 0.54/0.74  % (1973)Memory used [KB]: 1080
% 0.54/0.74  % (1973)Time elapsed: 0.004 s
% 0.54/0.74  % (1973)Instructions burned: 3 (million)
% 0.54/0.74  % (1965)Success in time 0.381 s
% 0.54/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------