TSTP Solution File: ARI257_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : ARI257_1 : TPTP v8.1.2. Released v5.0.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 : n021.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 : Sun May  5 04:33:13 EDT 2024

% Result   : Theorem 0.56s 0.74s
% Output   : Refutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (   6 unt;   2 typ;   0 def)
%            Number of atoms       :   20 (  15 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   15 (   7   ~;   0   |;   4   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number arithmetic     :   37 (   0 atm;   8 fun;  25 num;   4 var)
%            Number of types       :    2 (   0 usr;   1 ari)
%            Number of type conns  :    2 (   1   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   1 usr;   4 con; 0-2 aty)
%            Number of variables   :    8 (   5   !;   2   ?;   8   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_7,type,
    sK0: $rat ).

tff(pred_def_2,type,
    sQ1_eqProxy: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(f31,plain,
    $false,
    inference(subsumption_resolution,[],[f30,f20]) ).

tff(f20,plain,
    ~ sQ1_eqProxy($rat,10/1,sK0),
    inference(equality_proxy_replacement,[],[f18,f19]) ).

tff(f19,plain,
    ! [X0: $tType,X2: X0,X1: X0] :
      ( sQ1_eqProxy(X0,X1,X2)
    <=> ( X1 = X2 ) ),
    introduced(equality_proxy_definition,[new_symbols(naming,[sQ1_eqProxy])]) ).

tff(f18,plain,
    10/1 != sK0,
    inference(cnf_transformation,[],[f16]) ).

tff(f16,plain,
    ( ( 10/1 != sK0 )
    & ( $sum(17/4,23/4) = sK0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f14,f15]) ).

tff(f15,plain,
    ( ? [X0: $rat] :
        ( ( 10/1 != X0 )
        & ( $sum(17/4,23/4) = X0 ) )
   => ( ( 10/1 != sK0 )
      & ( $sum(17/4,23/4) = sK0 ) ) ),
    introduced(choice_axiom,[]) ).

tff(f14,plain,
    ? [X0: $rat] :
      ( ( 10/1 != X0 )
      & ( $sum(17/4,23/4) = X0 ) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ! [X0: $rat] :
        ( ( $sum(17/4,23/4) = X0 )
       => ( 10/1 = X0 ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ! [X0: $rat] :
      ( ( $sum(17/4,23/4) = X0 )
     => ( 10/1 = X0 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.RQadfeNViv/Vampire---4.8_456',rat_sum_problem_12) ).

tff(f30,plain,
    sQ1_eqProxy($rat,10/1,sK0),
    inference(evaluation,[],[f21]) ).

tff(f21,plain,
    sQ1_eqProxy($rat,$sum(17/4,23/4),sK0),
    inference(equality_proxy_replacement,[],[f17,f19]) ).

tff(f17,plain,
    $sum(17/4,23/4) = sK0,
    inference(cnf_transformation,[],[f16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem    : ARI257_1 : TPTP v8.1.2. Released v5.0.0.
% 0.13/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.15/0.36  % Computer : n021.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 21:44:08 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a TF0_THM_EQU_ARI problem
% 0.15/0.36  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.RQadfeNViv/Vampire---4.8_456
% 0.56/0.74  % (663)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.56/0.74  % (670)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.56/0.74  % (670)Also succeeded, but the first one will report.
% 0.56/0.74  % (663)First to succeed.
% 0.56/0.74  % (663)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-642"
% 0.56/0.74  % (665)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.56/0.74  % (668)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.56/0.74  % (666)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.56/0.74  % (667)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.56/0.74  % (669)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.56/0.74  % (664)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.56/0.74  % (665)Also succeeded, but the first one will report.
% 0.56/0.74  % (666)Also succeeded, but the first one will report.
% 0.56/0.74  % (668)Also succeeded, but the first one will report.
% 0.56/0.74  % (667)Also succeeded, but the first one will report.
% 0.56/0.74  % (669)Also succeeded, but the first one will report.
% 0.56/0.74  % (663)Refutation found. Thanks to Tanya!
% 0.56/0.74  % SZS status Theorem for Vampire---4
% 0.56/0.74  % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.74  % (663)------------------------------
% 0.56/0.74  % (663)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74  % (663)Termination reason: Refutation
% 0.56/0.74  
% 0.56/0.74  % (663)Memory used [KB]: 958
% 0.56/0.74  % (663)Time elapsed: 0.002 s
% 0.56/0.74  % (663)Instructions burned: 2 (million)
% 0.56/0.74  % (642)Success in time 0.373 s
% 0.56/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------