TSTP Solution File: ARI122_1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : ARI122_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_uns --cores 0 -t %d %s

% Computer : n013.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:45:29 EDT 2022

% Result   : Theorem 0.21s 0.48s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   27 (  15 unt;   4 typ;   0 def)
%            Number of atoms       :   60 (  59 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   47 (  10   ~;   0   |;  33   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number arithmetic     :  145 (   0 atm;  45 fun;  70 num;  30 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    :   10 (   4 usr;   9 con; 0-2 aty)
%            Number of variables   :   30 (  14   !;  16   ?;  30   :)

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

tff(func_def_9,type,
    sK1: $int ).

tff(func_def_10,type,
    sK2: $int ).

tff(func_def_11,type,
    sK3: $int ).

tff(f41,plain,
    $false,
    inference(subsumption_resolution,[],[f40,f38]) ).

tff(f38,plain,
    sK0 != 36,
    inference(backward_demodulation,[],[f29,f37]) ).

tff(f37,plain,
    sK2 = 36,
    inference(evaluation,[],[f36]) ).

tff(f36,plain,
    sK2 = $product(6,6),
    inference(backward_demodulation,[],[f35,f34]) ).

tff(f34,plain,
    6 = sK3,
    inference(evaluation,[],[f27]) ).

tff(f27,plain,
    $product(2,3) = sK3,
    inference(cnf_transformation,[],[f26]) ).

tff(f26,plain,
    ( ( sK2 = $product(sK3,6) )
    & ( sK0 = $product(2,sK1) )
    & ( sK0 != sK2 )
    & ( $product(3,6) = sK1 )
    & ( $product(2,3) = sK3 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f24,f25]) ).

tff(f25,plain,
    ( ? [X0: $int,X1: $int,X2: $int,X3: $int] :
        ( ( $product(X3,6) = X2 )
        & ( $product(2,X1) = X0 )
        & ( X0 != X2 )
        & ( $product(3,6) = X1 )
        & ( $product(2,3) = X3 ) )
   => ( ( sK2 = $product(sK3,6) )
      & ( sK0 = $product(2,sK1) )
      & ( sK0 != sK2 )
      & ( $product(3,6) = sK1 )
      & ( $product(2,3) = sK3 ) ) ),
    introduced(choice_axiom,[]) ).

tff(f24,plain,
    ? [X0: $int,X1: $int,X2: $int,X3: $int] :
      ( ( $product(X3,6) = X2 )
      & ( $product(2,X1) = X0 )
      & ( X0 != X2 )
      & ( $product(3,6) = X1 )
      & ( $product(2,3) = X3 ) ),
    inference(rectify,[],[f23]) ).

tff(f23,plain,
    ? [X3: $int,X1: $int,X2: $int,X0: $int] :
      ( ( $product(X0,6) = X2 )
      & ( $product(2,X1) = X3 )
      & ( X2 != X3 )
      & ( $product(3,6) = X1 )
      & ( $product(2,3) = X0 ) ),
    inference(flattening,[],[f22]) ).

tff(f22,plain,
    ? [X3: $int,X1: $int,X2: $int,X0: $int] :
      ( ( X2 != X3 )
      & ( $product(3,6) = X1 )
      & ( $product(X0,6) = X2 )
      & ( $product(2,3) = X0 )
      & ( $product(2,X1) = X3 ) ),
    inference(ennf_transformation,[],[f21]) ).

tff(f21,plain,
    ~ ! [X3: $int,X1: $int,X2: $int,X0: $int] :
        ( ( ( $product(3,6) = X1 )
          & ( $product(X0,6) = X2 )
          & ( $product(2,3) = X0 )
          & ( $product(2,X1) = X3 ) )
       => ( X2 = X3 ) ),
    inference(rectify,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ! [X0: $int,X2: $int,X1: $int,X3: $int] :
        ( ( ( $product(2,X2) = X3 )
          & ( $product(2,3) = X0 )
          & ( $product(3,6) = X2 )
          & ( $product(X0,6) = X1 ) )
       => ( X1 = X3 ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ! [X0: $int,X2: $int,X1: $int,X3: $int] :
      ( ( ( $product(2,X2) = X3 )
        & ( $product(2,3) = X0 )
        & ( $product(3,6) = X2 )
        & ( $product(X0,6) = X1 ) )
     => ( X1 = X3 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',associative_product) ).

tff(f35,plain,
    $product(6,sK3) = sK2,
    inference(forward_demodulation,[],[f31,f14]) ).

tff(f14,plain,
    ! [X0: $int,X1: $int] : ( $product(X0,X1) = $product(X1,X0) ),
    introduced(theory_axiom_140,[]) ).

tff(f31,plain,
    sK2 = $product(sK3,6),
    inference(cnf_transformation,[],[f26]) ).

tff(f29,plain,
    sK0 != sK2,
    inference(cnf_transformation,[],[f26]) ).

tff(f40,plain,
    sK0 = 36,
    inference(evaluation,[],[f39]) ).

tff(f39,plain,
    $product(2,18) = sK0,
    inference(backward_demodulation,[],[f30,f33]) ).

tff(f33,plain,
    18 = sK1,
    inference(evaluation,[],[f28]) ).

tff(f28,plain,
    $product(3,6) = sK1,
    inference(cnf_transformation,[],[f26]) ).

tff(f30,plain,
    sK0 = $product(2,sK1),
    inference(cnf_transformation,[],[f26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : ARI122=1 : TPTP v8.1.0. Released v5.0.0.
% 0.08/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.36  % Computer : n013.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Mon Aug 29 15:19:01 EDT 2022
% 0.14/0.36  % CPUTime    : 
% 0.21/0.47  % (6946)lrs+1_1:10_av=off:drc=off:nwc=2.0:sp=reverse_frequency:thsq=on:thsqc=64:thsql=off:i=47:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/47Mi)
% 0.21/0.47  % (6946)First to succeed.
% 0.21/0.47  % (6938)lrs+10_1:1_ev=force:gve=cautious:tha=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.48  % (6946)Refutation found. Thanks to Tanya!
% 0.21/0.48  % SZS status Theorem for theBenchmark
% 0.21/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.48  % (6946)------------------------------
% 0.21/0.48  % (6946)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.48  % (6946)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.48  % (6946)Termination reason: Refutation
% 0.21/0.48  
% 0.21/0.48  % (6946)Memory used [KB]: 1023
% 0.21/0.48  % (6946)Time elapsed: 0.006 s
% 0.21/0.48  % (6946)Instructions burned: 3 (million)
% 0.21/0.48  % (6946)------------------------------
% 0.21/0.48  % (6946)------------------------------
% 0.21/0.48  % (6921)Success in time 0.113 s
%------------------------------------------------------------------------------