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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWV164+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 : n019.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:44 EDT 2024

% Result   : Theorem 0.61s 0.82s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   41 (  14 unt;   0 def)
%            Number of atoms       :  106 (  22 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   97 (  32   ~;  27   |;  24   &)
%                                         (   3 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :   11 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :   27 (  27 usr;  16 con; 0-3 aty)
%            Number of variables   :   40 (  38   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f342,plain,
    $false,
    inference(avatar_sat_refutation,[],[f256,f271,f341]) ).

fof(f341,plain,
    ~ spl1_1,
    inference(avatar_contradiction_clause,[],[f340]) ).

fof(f340,plain,
    ( $false
    | ~ spl1_1 ),
    inference(subsumption_resolution,[],[f330,f295]) ).

fof(f295,plain,
    gt(n0,sK0),
    inference(forward_demodulation,[],[f261,f224]) ).

fof(f224,plain,
    n0 = plus(n1,tptp_minus_1),
    inference(definition_unfolding,[],[f158,f211]) ).

fof(f211,plain,
    ! [X0] : succ(X0) = plus(n1,X0),
    inference(cnf_transformation,[],[f30]) ).

fof(f30,axiom,
    ! [X0] : succ(X0) = plus(n1,X0),
    file('/export/starexec/sandbox2/tmp/tmp.VooQs0zJmj/Vampire---4.8_20425',succ_plus_1_l) ).

fof(f158,plain,
    n0 = succ(tptp_minus_1),
    inference(cnf_transformation,[],[f28]) ).

fof(f28,axiom,
    n0 = succ(tptp_minus_1),
    file('/export/starexec/sandbox2/tmp/tmp.VooQs0zJmj/Vampire---4.8_20425',succ_tptp_minus_1) ).

fof(f261,plain,
    gt(plus(n1,tptp_minus_1),sK0),
    inference(unit_resulting_resolution,[],[f129,f221]) ).

fof(f221,plain,
    ! [X0,X1] :
      ( gt(plus(n1,X1),X0)
      | ~ leq(X0,X1) ),
    inference(definition_unfolding,[],[f145,f211]) ).

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

fof(f13,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
    <=> gt(succ(X1),X0) ),
    file('/export/starexec/sandbox2/tmp/tmp.VooQs0zJmj/Vampire---4.8_20425',leq_succ_gt_equiv) ).

fof(f129,plain,
    leq(sK0,tptp_minus_1),
    inference(cnf_transformation,[],[f105]) ).

fof(f105,plain,
    ( ? [X1] :
        ( a_select3(q,pv10,X1) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X1)),minus(a_select2(x,pv10),a_select2(mu,X1))),tptp_minus_2),times(a_select2(sigma,X1),a_select2(sigma,X1)))),a_select2(rho,X1)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X1))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))
        & leq(X1,tptp_minus_1)
        & leq(n0,X1) )
    & ! [X0] :
        ( n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index))
        | ~ leq(X0,pred(pv10))
        | ~ leq(n0,X0) )
    & leq(pv10,n135299)
    & leq(n0,pv10) ),
    inference(flattening,[],[f104]) ).

fof(f104,plain,
    ( ? [X1] :
        ( a_select3(q,pv10,X1) != divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X1)),minus(a_select2(x,pv10),a_select2(mu,X1))),tptp_minus_2),times(a_select2(sigma,X1),a_select2(sigma,X1)))),a_select2(rho,X1)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X1))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))
        & leq(X1,tptp_minus_1)
        & leq(n0,X1) )
    & ! [X0] :
        ( n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index))
        | ~ leq(X0,pred(pv10))
        | ~ leq(n0,X0) )
    & leq(pv10,n135299)
    & leq(n0,pv10) ),
    inference(ennf_transformation,[],[f102]) ).

fof(f102,plain,
    ~ ( ( ! [X0] :
            ( ( leq(X0,pred(pv10))
              & leq(n0,X0) )
           => n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index)) )
        & leq(pv10,n135299)
        & leq(n0,pv10) )
     => ! [X1] :
          ( ( leq(X1,tptp_minus_1)
            & leq(n0,X1) )
         => a_select3(q,pv10,X1) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X1)),minus(a_select2(x,pv10),a_select2(mu,X1))),tptp_minus_2),times(a_select2(sigma,X1),a_select2(sigma,X1)))),a_select2(rho,X1)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X1))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ),
    inference(rectify,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ ( ( ! [X13] :
            ( ( leq(X13,pred(pv10))
              & leq(n0,X13) )
           => n1 = sum(n0,n4,a_select3(q,X13,tptp_sum_index)) )
        & leq(pv10,n135299)
        & leq(n0,pv10) )
     => ! [X17] :
          ( ( leq(X17,tptp_minus_1)
            & leq(n0,X17) )
         => a_select3(q,pv10,X17) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X17)),minus(a_select2(x,pv10),a_select2(mu,X17))),tptp_minus_2),times(a_select2(sigma,X17),a_select2(sigma,X17)))),a_select2(rho,X17)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X17))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    ( ( ! [X13] :
          ( ( leq(X13,pred(pv10))
            & leq(n0,X13) )
         => n1 = sum(n0,n4,a_select3(q,X13,tptp_sum_index)) )
      & leq(pv10,n135299)
      & leq(n0,pv10) )
   => ! [X17] :
        ( ( leq(X17,tptp_minus_1)
          & leq(n0,X17) )
       => a_select3(q,pv10,X17) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X17)),minus(a_select2(x,pv10),a_select2(mu,X17))),tptp_minus_2),times(a_select2(sigma,X17),a_select2(sigma,X17)))),a_select2(rho,X17)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X17))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.VooQs0zJmj/Vampire---4.8_20425',cl5_nebula_norm_0014) ).

fof(f330,plain,
    ( ~ gt(n0,sK0)
    | ~ spl1_1 ),
    inference(unit_resulting_resolution,[],[f197,f251,f198]) ).

fof(f198,plain,
    ! [X2,X0,X1] :
      ( ~ gt(X1,X2)
      | ~ gt(X0,X1)
      | gt(X0,X2) ),
    inference(cnf_transformation,[],[f127]) ).

fof(f127,plain,
    ! [X0,X1,X2] :
      ( gt(X0,X2)
      | ~ gt(X1,X2)
      | ~ gt(X0,X1) ),
    inference(flattening,[],[f126]) ).

fof(f126,plain,
    ! [X0,X1,X2] :
      ( gt(X0,X2)
      | ~ gt(X1,X2)
      | ~ gt(X0,X1) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1,X2] :
      ( ( gt(X1,X2)
        & gt(X0,X1) )
     => gt(X0,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.VooQs0zJmj/Vampire---4.8_20425',transitivity_gt) ).

fof(f251,plain,
    ( gt(sK0,n0)
    | ~ spl1_1 ),
    inference(avatar_component_clause,[],[f249]) ).

fof(f249,plain,
    ( spl1_1
  <=> gt(sK0,n0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).

fof(f197,plain,
    ! [X0] : ~ gt(X0,X0),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0] : ~ gt(X0,X0),
    file('/export/starexec/sandbox2/tmp/tmp.VooQs0zJmj/Vampire---4.8_20425',irreflexivity_gt) ).

fof(f271,plain,
    ~ spl1_2,
    inference(avatar_contradiction_clause,[],[f270]) ).

fof(f270,plain,
    ( $false
    | ~ spl1_2 ),
    inference(subsumption_resolution,[],[f269,f197]) ).

fof(f269,plain,
    ( gt(n0,n0)
    | ~ spl1_2 ),
    inference(forward_demodulation,[],[f268,f224]) ).

fof(f268,plain,
    ( gt(plus(n1,tptp_minus_1),n0)
    | ~ spl1_2 ),
    inference(forward_demodulation,[],[f261,f255]) ).

fof(f255,plain,
    ( n0 = sK0
    | ~ spl1_2 ),
    inference(avatar_component_clause,[],[f253]) ).

fof(f253,plain,
    ( spl1_2
  <=> n0 = sK0 ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).

fof(f256,plain,
    ( spl1_1
    | spl1_2 ),
    inference(avatar_split_clause,[],[f246,f253,f249]) ).

fof(f246,plain,
    ( n0 = sK0
    | gt(sK0,n0) ),
    inference(resolution,[],[f128,f135]) ).

fof(f135,plain,
    ! [X0,X1] :
      ( ~ leq(X0,X1)
      | X0 = X1
      | gt(X1,X0) ),
    inference(cnf_transformation,[],[f109]) ).

fof(f109,plain,
    ! [X0,X1] :
      ( gt(X1,X0)
      | X0 = X1
      | ~ leq(X0,X1) ),
    inference(flattening,[],[f108]) ).

fof(f108,plain,
    ! [X0,X1] :
      ( gt(X1,X0)
      | X0 = X1
      | ~ leq(X0,X1) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,axiom,
    ! [X0,X1] :
      ( ( X0 != X1
        & leq(X0,X1) )
     => gt(X1,X0) ),
    file('/export/starexec/sandbox2/tmp/tmp.VooQs0zJmj/Vampire---4.8_20425',leq_gt2) ).

fof(f128,plain,
    leq(n0,sK0),
    inference(cnf_transformation,[],[f105]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem    : SWV164+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.09/0.12  % 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.12/0.32  % Computer : n019.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 300
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Tue Apr 30 18:38:14 EDT 2024
% 0.12/0.32  % CPUTime    : 
% 0.12/0.32  This is a FOF_THM_RFO_SEQ problem
% 0.12/0.32  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.VooQs0zJmj/Vampire---4.8_20425
% 0.61/0.81  % (20540)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.81  % (20537)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 (2995ds/34Mi)
% 0.61/0.81  % (20539)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.81  % (20541)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 (2995ds/34Mi)
% 0.61/0.81  % (20538)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 (2995ds/51Mi)
% 0.61/0.81  % (20542)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.81  % (20543)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 (2995ds/83Mi)
% 0.61/0.81  % (20544)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 (2995ds/56Mi)
% 0.61/0.81  % (20544)Refutation not found, incomplete strategy% (20544)------------------------------
% 0.61/0.81  % (20544)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.81  % (20544)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.81  
% 0.61/0.81  % (20544)Memory used [KB]: 1108
% 0.61/0.81  % (20544)Time elapsed: 0.004 s
% 0.61/0.81  % (20544)Instructions burned: 5 (million)
% 0.61/0.81  % (20544)------------------------------
% 0.61/0.81  % (20544)------------------------------
% 0.61/0.82  % (20543)First to succeed.
% 0.61/0.82  % (20543)Refutation found. Thanks to Tanya!
% 0.61/0.82  % SZS status Theorem for Vampire---4
% 0.61/0.82  % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.82  % (20543)------------------------------
% 0.61/0.82  % (20543)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82  % (20543)Termination reason: Refutation
% 0.61/0.82  
% 0.61/0.82  % (20543)Memory used [KB]: 1187
% 0.61/0.82  % (20543)Time elapsed: 0.007 s
% 0.61/0.82  % (20543)Instructions burned: 11 (million)
% 0.61/0.82  % (20543)------------------------------
% 0.61/0.82  % (20543)------------------------------
% 0.61/0.82  % (20534)Success in time 0.487 s
% 0.61/0.82  % Vampire---4.8 exiting
%------------------------------------------------------------------------------