TSTP Solution File: ARI119_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : ARI119_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 : n015.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:14 EDT 2024

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

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

tff(f41,plain,
    $false,
    inference(resolution,[],[f37,f40]) ).

tff(f40,plain,
    ~ sQ0_eqProxy($int,16,16),
    inference(evaluation,[],[f27]) ).

tff(f27,plain,
    ~ sQ0_eqProxy($int,16,$product(4,4)),
    inference(equality_proxy_replacement,[],[f24,f26]) ).

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

tff(f24,plain,
    16 != $product(4,4),
    inference(equality_resolution,[],[f23]) ).

tff(f23,plain,
    ! [X0: $int] :
      ( ( 4 != X0 )
      | ( 16 != $product(X0,4) ) ),
    inference(equality_resolution,[],[f22]) ).

tff(f22,plain,
    ! [X0: $int,X1: $int] :
      ( ( 4 != X1 )
      | ( 4 != X0 )
      | ( $product(X0,X1) != 16 ) ),
    inference(cnf_transformation,[],[f21]) ).

tff(f21,plain,
    ! [X0: $int,X1: $int] :
      ( ( 4 != X1 )
      | ( 4 != X0 )
      | ( $product(X0,X1) != 16 ) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ? [X0: $int,X1: $int] :
        ( ( 4 = X1 )
        & ( 4 = X0 )
        & ( $product(X0,X1) = 16 ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ? [X0: $int,X1: $int] :
      ( ( 4 = X1 )
      & ( 4 = X0 )
      & ( $product(X0,X1) = 16 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.2oVckSElZC/Vampire---4.8_10716',product_4_4_16) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : ARI119_1 : TPTP v8.1.2. Released v5.0.0.
% 0.06/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.13/0.35  % Computer : n015.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Apr 30 19:11:48 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  This is a TF0_THM_EQU_ARI problem
% 0.13/0.35  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.2oVckSElZC/Vampire---4.8_10716
% 0.44/0.71  % (10825)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.44/0.71  % (10831)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.44/0.71  % (10828)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.44/0.71  % (10827)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.44/0.71  % (10829)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.44/0.71  % (10830)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.44/0.71  % (10826)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.44/0.71  % (10832)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.44/0.71  % (10825)First to succeed.
% 0.44/0.71  % (10828)Also succeeded, but the first one will report.
% 0.44/0.72  % (10825)Refutation found. Thanks to Tanya!
% 0.44/0.72  % SZS status Theorem for Vampire---4
% 0.44/0.72  % SZS output start Proof for Vampire---4
% See solution above
% 0.44/0.72  % (10825)------------------------------
% 0.44/0.72  % (10825)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.44/0.72  % (10825)Termination reason: Refutation
% 0.44/0.72  
% 0.44/0.72  % (10825)Memory used [KB]: 963
% 0.44/0.72  % (10825)Time elapsed: 0.002 s
% 0.44/0.72  % (10825)Instructions burned: 3 (million)
% 0.44/0.72  % (10825)------------------------------
% 0.44/0.72  % (10825)------------------------------
% 0.44/0.72  % (10824)Success in time 0.347 s
% 0.55/0.72  % Vampire---4.8 exiting
%------------------------------------------------------------------------------