TSTP Solution File: ARI107_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : ARI107_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 : n006.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 02:08:12 EDT 2024

% Result   : Theorem 0.62s 0.79s
% Output   : Refutation 0.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   10 (   8 unt;   1 typ;   0 def)
%            Number of atoms       :   10 (   5 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   5   ~;   0   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number arithmetic     :   22 (   0 atm;   5 fun;  17 num;   0 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    :    4 (   0 usr;   3 con; 0-2 aty)
%            Number of variables   :    6 (   5   !;   0   ?;   6   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_2,type,
    sQ0_eqProxy: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(f39,plain,
    $false,
    inference(resolution,[],[f35,f38]) ).

tff(f38,plain,
    ~ sQ0_eqProxy($int,10,10),
    inference(evaluation,[],[f25]) ).

tff(f25,plain,
    ~ sQ0_eqProxy($int,$product(-2,-5),10),
    inference(equality_proxy_replacement,[],[f22,f24]) ).

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

tff(f22,plain,
    $product(-2,-5) != 10,
    inference(cnf_transformation,[],[f21]) ).

tff(f21,plain,
    $product(-2,-5) != 10,
    inference(flattening,[],[f2]) ).

tff(f2,negated_conjecture,
    ( ~ $product(-2,-5) = 10 ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    $product(-2,-5) = 10,
    file('/export/starexec/sandbox2/tmp/tmp.KOnYCV7Abv/Vampire---4.8_31619',product_n2_n5_10) ).

tff(f35,plain,
    ! [X0: $tType,X1: X0] : sQ0_eqProxy(X0,X1,X1),
    inference(equality_proxy_axiom,[],[f24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : ARI107_1 : TPTP v8.1.2. Released v5.0.0.
% 0.04/0.14  % 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.35  % Computer : n006.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % 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   : Tue Apr 30 18:48:20 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.KOnYCV7Abv/Vampire---4.8_31619
% 0.62/0.79  % (31811)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.62/0.79  % (31818)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.62/0.79  % (31811)First to succeed.
% 0.62/0.79  % (31818)Also succeeded, but the first one will report.
% 0.62/0.79  % (31813)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.62/0.79  % (31811)Refutation found. Thanks to Tanya!
% 0.62/0.79  % SZS status Theorem for Vampire---4
% 0.62/0.79  % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.79  % (31811)------------------------------
% 0.62/0.79  % (31811)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.79  % (31811)Termination reason: Refutation
% 0.62/0.79  
% 0.62/0.79  % (31811)Memory used [KB]: 961
% 0.62/0.79  % (31811)Time elapsed: 0.002 s
% 0.62/0.79  % (31811)Instructions burned: 3 (million)
% 0.62/0.79  % (31811)------------------------------
% 0.62/0.79  % (31811)------------------------------
% 0.62/0.79  % (31784)Success in time 0.426 s
% 0.62/0.79  % Vampire---4.8 exiting
%------------------------------------------------------------------------------