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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWV137+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 : n032.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.44s 0.62s
% Output   : Refutation 0.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   24 (  14 unt;   0 def)
%            Number of atoms       :   70 (   5 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :   60 (  14   ~;   4   |;  38   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   12 (  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f185,plain,
    $false,
    inference(subsumption_resolution,[],[f184,f126]) ).

fof(f126,plain,
    leq(n2,pv1325),
    inference(cnf_transformation,[],[f93]) ).

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

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

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

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

fof(f184,plain,
    ~ leq(n2,pv1325),
    inference(forward_demodulation,[],[f183,f170]) ).

fof(f170,plain,
    n2 = succ(n1),
    inference(backward_demodulation,[],[f143,f160]) ).

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

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

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

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

fof(f183,plain,
    ~ leq(succ(n1),pv1325),
    inference(resolution,[],[f178,f153]) ).

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

fof(f110,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) ).

fof(f178,plain,
    ~ gt(pv1325,n1),
    inference(resolution,[],[f177,f164]) ).

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

fof(f116,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(f177,plain,
    ~ leq(n1,pv1325),
    inference(forward_demodulation,[],[f176,f160]) ).

fof(f176,plain,
    ~ leq(succ(n0),pv1325),
    inference(resolution,[],[f153,f174]) ).

fof(f174,plain,
    ~ gt(pv1325,n0),
    inference(resolution,[],[f164,f133]) ).

fof(f133,plain,
    ~ leq(n0,pv1325),
    inference(cnf_transformation,[],[f93]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08  % Problem    : SWV137+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.05/0.09  % 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.08/0.28  % Computer : n032.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit   : 300
% 0.08/0.28  % WCLimit    : 300
% 0.08/0.28  % DateTime   : Sun May 19 08:45:07 EDT 2024
% 0.08/0.28  % CPUTime    : 
% 0.08/0.28  This is a FOF_THM_RFO_SEQ problem
% 0.08/0.28  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.39/0.62  % (27762)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.39/0.62  % (27763)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.39/0.62  % (27764)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.44/0.62  % (27765)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.44/0.62  % (27766)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.44/0.62  % (27767)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.44/0.62  % (27760)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.44/0.62  % (27762)First to succeed.
% 0.44/0.62  % (27762)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27759"
% 0.44/0.62  % (27762)Refutation found. Thanks to Tanya!
% 0.44/0.62  % SZS status Theorem for theBenchmark
% 0.44/0.62  % SZS output start Proof for theBenchmark
% See solution above
% 0.44/0.62  % (27762)------------------------------
% 0.44/0.62  % (27762)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.44/0.62  % (27762)Termination reason: Refutation
% 0.44/0.62  
% 0.44/0.62  % (27762)Memory used [KB]: 1116
% 0.44/0.62  % (27762)Time elapsed: 0.003 s
% 0.44/0.62  % (27762)Instructions burned: 6 (million)
% 0.44/0.62  % (27759)Success in time 0.331 s
% 0.44/0.62  % Vampire---4.8 exiting
%------------------------------------------------------------------------------