TSTP Solution File: ARI063_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : ARI063_1 : TPTP v8.2.0. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n017.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 : Mon May 20 18:46:26 EDT 2024

% Result   : Theorem 0.48s 0.68s
% Output   : Refutation 0.48s
% 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     :   39 (   0 atm;   8 fun;  25 num;   6 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-2 aty)
%            Number of functors    :    5 (   1 usr;   4 con; 0-2 aty)
%            Number of variables   :    6 (   4   !;   2   ?;   6   :)

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

tff(pred_def_2,type,
    sQ1_eqProxy: ( $int * $int ) > $o ).

tff(f27,plain,
    $false,
    inference(subsumption_resolution,[],[f26,f21]) ).

tff(f21,plain,
    ~ sQ1_eqProxy(5,sK0),
    inference(equality_proxy_replacement,[],[f19,f20]) ).

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

tff(f19,plain,
    5 != sK0,
    inference(cnf_transformation,[],[f17]) ).

tff(f17,plain,
    ( ( 5 != sK0 )
    & ( $sum(2,3) = sK0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f15,f16]) ).

tff(f16,plain,
    ( ? [X0: $int] :
        ( ( 5 != X0 )
        & ( $sum(2,3) = X0 ) )
   => ( ( 5 != sK0 )
      & ( $sum(2,3) = sK0 ) ) ),
    introduced(choice_axiom,[]) ).

tff(f15,plain,
    ? [X0: $int] :
      ( ( 5 != X0 )
      & ( $sum(2,3) = X0 ) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ! [X0: $int] :
        ( ( $sum(2,3) = X0 )
       => ( 5 = X0 ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ! [X0: $int] :
      ( ( $sum(2,3) = X0 )
     => ( 5 = X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_2_3_only_5) ).

tff(f26,plain,
    sQ1_eqProxy(5,sK0),
    inference(evaluation,[],[f22]) ).

tff(f22,plain,
    sQ1_eqProxy($sum(2,3),sK0),
    inference(equality_proxy_replacement,[],[f18,f20]) ).

tff(f18,plain,
    $sum(2,3) = sK0,
    inference(cnf_transformation,[],[f17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : ARI063_1 : TPTP v8.2.0. Released v5.0.0.
% 0.03/0.15  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36  % Computer : n017.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   : Sun May 19 13:13:23 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.16/0.36  This is a TF0_THM_EQU_ARI problem
% 0.16/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.68  % (6136)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.48/0.68  % (6136)First to succeed.
% 0.48/0.68  % (6136)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6127"
% 0.48/0.68  % (6128)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.48/0.68  % (6131)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.48/0.68  % (6136)Refutation found. Thanks to Tanya!
% 0.48/0.68  % SZS status Theorem for theBenchmark
% 0.48/0.68  % SZS output start Proof for theBenchmark
% See solution above
% 0.48/0.68  % (6136)------------------------------
% 0.48/0.68  % (6136)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.68  % (6136)Termination reason: Refutation
% 0.48/0.68  
% 0.48/0.68  % (6136)Memory used [KB]: 957
% 0.48/0.68  % (6136)Time elapsed: 0.001 s
% 0.48/0.68  % (6136)Instructions burned: 2 (million)
% 0.48/0.68  % (6127)Success in time 0.31 s
% 0.48/0.68  % Vampire---4.8 exiting
%------------------------------------------------------------------------------