TSTP Solution File: ARI123_1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : ARI123_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n008.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 Aug 31 15:47:30 EDT 2022

% Result   : Theorem 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    8 (   2 unt;   0 typ;   0 def)
%            Number of atoms       :   32 (  31 equ)
%            Maximal formula atoms :    5 (   4 avg)
%            Number of connectives :   30 (   6   ~;   0   |;  21   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (  10 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number arithmetic     :   68 (   0 atm;  24 fun;   0 num;  44 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   0 usr;   0 con; 2-2 aty)
%            Number of variables   :   44 (  23   !;  21   ?;  44   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f30,plain,
    $false,
    inference(equality_resolution,[],[f28]) ).

tff(f28,plain,
    ! [X0: $int,X4: $int] : ( X0 != X4 ),
    inference(cnf_transformation,[],[f24]) ).

tff(f24,plain,
    ! [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
      ( ( $product(X6,X2) = X5 )
      & ( X0 != X4 )
      & ( $product(X5,X1) = X4 )
      & ( $product(X2,X1) = X3 )
      & ( $product(X6,X3) = X0 ) ),
    inference(rectify,[],[f23]) ).

tff(f23,plain,
    ! [X4: $int,X0: $int,X1: $int,X6: $int,X3: $int,X5: $int,X2: $int] :
      ( ( $product(X2,X1) = X5 )
      & ( X3 != X4 )
      & ( $product(X5,X0) = X3 )
      & ( $product(X1,X0) = X6 )
      & ( $product(X2,X6) = X4 ) ),
    inference(flattening,[],[f22]) ).

tff(f22,plain,
    ! [X4: $int,X6: $int,X5: $int,X3: $int,X2: $int,X1: $int,X0: $int] :
      ( ( X3 != X4 )
      & ( $product(X2,X1) = X5 )
      & ( $product(X1,X0) = X6 )
      & ( $product(X2,X6) = X4 )
      & ( $product(X5,X0) = X3 ) ),
    inference(ennf_transformation,[],[f21]) ).

tff(f21,plain,
    ~ ? [X4: $int,X6: $int,X5: $int,X3: $int,X2: $int,X1: $int,X0: $int] :
        ( ( ( $product(X2,X1) = X5 )
          & ( $product(X1,X0) = X6 )
          & ( $product(X2,X6) = X4 )
          & ( $product(X5,X0) = X3 ) )
       => ( X3 = X4 ) ),
    inference(rectify,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ? [X2: $int,X1: $int,X0: $int,X4: $int,X6: $int,X3: $int,X5: $int] :
        ( ( ( $product(X0,X5) = X6 )
          & ( $product(X1,X2) = X5 )
          & ( $product(X3,X2) = X4 )
          & ( $product(X0,X1) = X3 ) )
       => ( X4 = X6 ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ? [X2: $int,X1: $int,X0: $int,X4: $int,X6: $int,X3: $int,X5: $int] :
      ( ( ( $product(X0,X5) = X6 )
        & ( $product(X1,X2) = X5 )
        & ( $product(X3,X2) = X4 )
        & ( $product(X0,X1) = X3 ) )
     => ( X4 = X6 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associative_product_exists) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : ARI123=1 : TPTP v8.1.0. Released v5.0.0.
% 0.11/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n008.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Aug 29 15:26:25 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.50  % (6636)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.19/0.51  % (6648)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.19/0.51  % (6636)First to succeed.
% 0.19/0.51  % (6641)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.19/0.51  % (6636)Refutation found. Thanks to Tanya!
% 0.19/0.51  % SZS status Theorem for theBenchmark
% 0.19/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51  % (6636)------------------------------
% 0.19/0.51  % (6636)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (6636)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (6636)Termination reason: Refutation
% 0.19/0.51  
% 0.19/0.51  % (6636)Memory used [KB]: 895
% 0.19/0.51  % (6636)Time elapsed: 0.003 s
% 0.19/0.51  % (6636)Instructions burned: 1 (million)
% 0.19/0.51  % (6636)------------------------------
% 0.19/0.51  % (6636)------------------------------
% 0.19/0.51  % (6632)Success in time 0.167 s
%------------------------------------------------------------------------------