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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWV133+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 : 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 May 21 05:54:09 EDT 2024

% Result   : Theorem 0.47s 0.67s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   6 unt;   0 def)
%            Number of atoms       :   68 (   0 equ)
%            Maximal formula atoms :   11 (   4 avg)
%            Number of connectives :   68 (  17   ~;   8   |;  39   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :   18 (  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f465,plain,
    $false,
    inference(unit_resulting_resolution,[],[f141,f358,f129]) ).

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

fof(f95,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(f358,plain,
    ~ leq(n0,n2),
    inference(unit_resulting_resolution,[],[f114,f120,f130]) ).

fof(f130,plain,
    ! [X2,X0,X1] :
      ( ~ leq(X1,X2)
      | ~ leq(X0,X1)
      | leq(X0,X2) ),
    inference(cnf_transformation,[],[f97]) ).

fof(f97,plain,
    ! [X0,X1,X2] :
      ( leq(X0,X2)
      | ~ leq(X1,X2)
      | ~ leq(X0,X1) ),
    inference(flattening,[],[f96]) ).

fof(f96,plain,
    ! [X0,X1,X2] :
      ( leq(X0,X2)
      | ~ leq(X1,X2)
      | ~ leq(X0,X1) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f5,axiom,
    ! [X0,X1,X2] :
      ( ( leq(X1,X2)
        & leq(X0,X1) )
     => leq(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_leq) ).

fof(f120,plain,
    ~ leq(n0,pv1325),
    inference(cnf_transformation,[],[f88]) ).

fof(f88,plain,
    ( ~ leq(n0,pv1325)
    & leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
    & 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(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) ),
    inference(flattening,[],[f87]) ).

fof(f87,plain,
    ( ~ leq(n0,pv1325)
    & leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
    & 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(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
        & 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(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
     => leq(n0,pv1325) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    ( ( leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
      & 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(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
   => leq(n0,pv1325) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0003) ).

fof(f114,plain,
    leq(n2,pv1325),
    inference(cnf_transformation,[],[f88]) ).

fof(f141,plain,
    gt(n2,n0),
    inference(cnf_transformation,[],[f65]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SWV133+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.10/0.13  % 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.14/0.34  % Computer : n011.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sun May 19 07:21:23 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.14/0.34  This is a FOF_THM_RFO_SEQ problem
% 0.14/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.47/0.67  % (20230)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.47/0.67  % (20224)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.47/0.67  % (20226)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.47/0.67  % (20227)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.47/0.67  % (20228)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.47/0.67  % (20225)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.47/0.67  % (20229)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.47/0.67  % (20230)First to succeed.
% 0.47/0.67  % (20230)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-20223"
% 0.47/0.67  % (20226)Also succeeded, but the first one will report.
% 0.47/0.67  % (20230)Refutation found. Thanks to Tanya!
% 0.47/0.67  % SZS status Theorem for theBenchmark
% 0.47/0.67  % SZS output start Proof for theBenchmark
% See solution above
% 0.47/0.67  % (20230)------------------------------
% 0.47/0.67  % (20230)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.67  % (20230)Termination reason: Refutation
% 0.47/0.67  
% 0.47/0.67  % (20230)Memory used [KB]: 1193
% 0.47/0.67  % (20230)Time elapsed: 0.005 s
% 0.47/0.67  % (20230)Instructions burned: 12 (million)
% 0.47/0.67  % (20223)Success in time 0.316 s
% 0.47/0.67  % Vampire---4.8 exiting
%------------------------------------------------------------------------------