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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWV155+1 : TPTP v8.1.2. 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 : n020.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 : Wed May  1 04:02:43 EDT 2024

% Result   : Theorem 0.60s 0.76s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (   9 unt;   0 def)
%            Number of atoms       :  135 (  45 equ)
%            Maximal formula atoms :   15 (   6 avg)
%            Number of connectives :  157 (  44   ~;  23   |;  73   &)
%                                         (   1 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;  12 con; 0-3 aty)
%            Number of variables   :   28 (  24   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f285,plain,
    $false,
    inference(subsumption_resolution,[],[f284,f133]) ).

fof(f133,plain,
    leq(n0,sK0),
    inference(cnf_transformation,[],[f122]) ).

fof(f122,plain,
    ( n1 != sum(n0,n4,a_select3(q,sK0,tptp_sum_index))
    & pv10 != sK0
    & leq(sK0,pred(pv10))
    & leq(n0,sK0)
    & ! [X1] :
        ( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
        | ~ leq(X1,pred(pv10))
        | ~ leq(n0,X1) )
    & ! [X2] :
        ( a_select3(q,pv10,X2) = divide(sqrt(times(minus(a_select3(center,X2,n0),a_select2(x,pv10)),minus(a_select3(center,X2,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
        | ~ leq(X2,pred(pv12))
        | ~ leq(n0,X2) )
    & leq(pv12,n4)
    & leq(pv10,n135299)
    & leq(n0,pv12)
    & leq(n0,pv10)
    & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f120,f121]) ).

fof(f121,plain,
    ( ? [X0] :
        ( n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index))
        & pv10 != X0
        & leq(X0,pred(pv10))
        & leq(n0,X0) )
   => ( n1 != sum(n0,n4,a_select3(q,sK0,tptp_sum_index))
      & pv10 != sK0
      & leq(sK0,pred(pv10))
      & leq(n0,sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f120,plain,
    ( ? [X0] :
        ( n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index))
        & pv10 != X0
        & leq(X0,pred(pv10))
        & leq(n0,X0) )
    & ! [X1] :
        ( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
        | ~ leq(X1,pred(pv10))
        | ~ leq(n0,X1) )
    & ! [X2] :
        ( a_select3(q,pv10,X2) = divide(sqrt(times(minus(a_select3(center,X2,n0),a_select2(x,pv10)),minus(a_select3(center,X2,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
        | ~ leq(X2,pred(pv12))
        | ~ leq(n0,X2) )
    & leq(pv12,n4)
    & leq(pv10,n135299)
    & leq(n0,pv12)
    & leq(n0,pv10)
    & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) ),
    inference(rectify,[],[f97]) ).

fof(f97,plain,
    ( ? [X2] :
        ( n1 != sum(n0,n4,a_select3(q,X2,tptp_sum_index))
        & pv10 != X2
        & leq(X2,pred(pv10))
        & leq(n0,X2) )
    & ! [X0] :
        ( n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index))
        | ~ leq(X0,pred(pv10))
        | ~ leq(n0,X0) )
    & ! [X1] :
        ( a_select3(q,pv10,X1) = divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
        | ~ leq(X1,pred(pv12))
        | ~ leq(n0,X1) )
    & leq(pv12,n4)
    & leq(pv10,n135299)
    & leq(n0,pv12)
    & leq(n0,pv10)
    & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) ),
    inference(flattening,[],[f96]) ).

fof(f96,plain,
    ( ? [X2] :
        ( n1 != sum(n0,n4,a_select3(q,X2,tptp_sum_index))
        & pv10 != X2
        & leq(X2,pred(pv10))
        & leq(n0,X2) )
    & ! [X0] :
        ( n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index))
        | ~ leq(X0,pred(pv10))
        | ~ leq(n0,X0) )
    & ! [X1] :
        ( a_select3(q,pv10,X1) = divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
        | ~ leq(X1,pred(pv12))
        | ~ leq(n0,X1) )
    & leq(pv12,n4)
    & leq(pv10,n135299)
    & leq(n0,pv12)
    & leq(n0,pv10)
    & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) ),
    inference(ennf_transformation,[],[f94]) ).

fof(f94,plain,
    ~ ( ( ! [X0] :
            ( ( leq(X0,pred(pv10))
              & leq(n0,X0) )
           => n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index)) )
        & ! [X1] :
            ( ( leq(X1,pred(pv12))
              & leq(n0,X1) )
           => a_select3(q,pv10,X1) = divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
        & leq(pv12,n4)
        & leq(pv10,n135299)
        & leq(n0,pv12)
        & leq(n0,pv10)
        & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) )
     => ! [X2] :
          ( ( leq(X2,pred(pv10))
            & leq(n0,X2) )
         => ( pv10 != X2
           => n1 = sum(n0,n4,a_select3(q,X2,tptp_sum_index)) ) ) ),
    inference(rectify,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ ( ( ! [X17] :
            ( ( leq(X17,pred(pv10))
              & leq(n0,X17) )
           => n1 = sum(n0,n4,a_select3(q,X17,tptp_sum_index)) )
        & ! [X13] :
            ( ( leq(X13,pred(pv12))
              & leq(n0,X13) )
           => a_select3(q,pv10,X13) = divide(sqrt(times(minus(a_select3(center,X13,n0),a_select2(x,pv10)),minus(a_select3(center,X13,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
        & leq(pv12,n4)
        & leq(pv10,n135299)
        & leq(n0,pv12)
        & leq(n0,pv10)
        & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) )
     => ! [X3] :
          ( ( leq(X3,pred(pv10))
            & leq(n0,X3) )
         => ( pv10 != X3
           => n1 = sum(n0,n4,a_select3(q,X3,tptp_sum_index)) ) ) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    ( ( ! [X17] :
          ( ( leq(X17,pred(pv10))
            & leq(n0,X17) )
         => n1 = sum(n0,n4,a_select3(q,X17,tptp_sum_index)) )
      & ! [X13] :
          ( ( leq(X13,pred(pv12))
            & leq(n0,X13) )
         => a_select3(q,pv10,X13) = divide(sqrt(times(minus(a_select3(center,X13,n0),a_select2(x,pv10)),minus(a_select3(center,X13,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
      & leq(pv12,n4)
      & leq(pv10,n135299)
      & leq(n0,pv12)
      & leq(n0,pv10)
      & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) )
   => ! [X3] :
        ( ( leq(X3,pred(pv10))
          & leq(n0,X3) )
       => ( pv10 != X3
         => n1 = sum(n0,n4,a_select3(q,X3,tptp_sum_index)) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.t2fGiriauJ/Vampire---4.8_24732',cl5_nebula_norm_0005) ).

fof(f284,plain,
    ~ leq(n0,sK0),
    inference(subsumption_resolution,[],[f283,f198]) ).

fof(f198,plain,
    leq(sK0,minus(pv10,n1)),
    inference(definition_unfolding,[],[f134,f157]) ).

fof(f157,plain,
    ! [X0] : minus(X0,n1) = pred(X0),
    inference(cnf_transformation,[],[f39]) ).

fof(f39,axiom,
    ! [X0] : minus(X0,n1) = pred(X0),
    file('/export/starexec/sandbox2/tmp/tmp.t2fGiriauJ/Vampire---4.8_24732',pred_minus_1) ).

fof(f134,plain,
    leq(sK0,pred(pv10)),
    inference(cnf_transformation,[],[f122]) ).

fof(f283,plain,
    ( ~ leq(sK0,minus(pv10,n1))
    | ~ leq(n0,sK0) ),
    inference(resolution,[],[f208,f206]) ).

fof(f206,plain,
    ~ sQ1_eqProxy(n1,sum(n0,n4,a_select3(q,sK0,tptp_sum_index))),
    inference(equality_proxy_replacement,[],[f136,f205]) ).

fof(f205,plain,
    ! [X0,X1] :
      ( sQ1_eqProxy(X0,X1)
    <=> X0 = X1 ),
    introduced(equality_proxy_definition,[new_symbols(naming,[sQ1_eqProxy])]) ).

fof(f136,plain,
    n1 != sum(n0,n4,a_select3(q,sK0,tptp_sum_index)),
    inference(cnf_transformation,[],[f122]) ).

fof(f208,plain,
    ! [X1] :
      ( sQ1_eqProxy(n1,sum(n0,n4,a_select3(q,X1,tptp_sum_index)))
      | ~ leq(X1,minus(pv10,n1))
      | ~ leq(n0,X1) ),
    inference(equality_proxy_replacement,[],[f199,f205]) ).

fof(f199,plain,
    ! [X1] :
      ( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
      | ~ leq(X1,minus(pv10,n1))
      | ~ leq(n0,X1) ),
    inference(definition_unfolding,[],[f132,f157]) ).

fof(f132,plain,
    ! [X1] :
      ( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
      | ~ leq(X1,pred(pv10))
      | ~ leq(n0,X1) ),
    inference(cnf_transformation,[],[f122]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWV155+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.15  % 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.16/0.36  % Computer : n020.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit   : 300
% 0.16/0.36  % WCLimit    : 300
% 0.16/0.36  % DateTime   : Tue Apr 30 18:35:02 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.16/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37  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/tmp/tmp.t2fGiriauJ/Vampire---4.8_24732
% 0.60/0.76  % (24944)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.60/0.76  % (24946)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.60/0.76  % (24939)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 Vampire---4 for (2996ds/34Mi)
% 0.60/0.76  % (24941)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.60/0.76  % (24940)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 Vampire---4 for (2996ds/51Mi)
% 0.60/0.76  % (24942)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.60/0.76  % (24943)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 Vampire---4 for (2996ds/34Mi)
% 0.60/0.76  % (24945)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 Vampire---4 for (2996ds/83Mi)
% 0.60/0.76  % (24946)First to succeed.
% 0.60/0.76  % (24946)Refutation found. Thanks to Tanya!
% 0.60/0.76  % SZS status Theorem for Vampire---4
% 0.60/0.76  % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.76  % (24946)------------------------------
% 0.60/0.76  % (24946)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.76  % (24946)Termination reason: Refutation
% 0.60/0.76  
% 0.60/0.76  % (24946)Memory used [KB]: 1114
% 0.60/0.76  % (24946)Time elapsed: 0.003 s
% 0.60/0.76  % (24946)Instructions burned: 7 (million)
% 0.60/0.76  % (24946)------------------------------
% 0.60/0.76  % (24946)------------------------------
% 0.60/0.76  % (24918)Success in time 0.386 s
% 0.60/0.76  % Vampire---4.8 exiting
%------------------------------------------------------------------------------