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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : ARI121_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 : n004.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.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   7 unt;   2 typ;   0 def)
%            Number of atoms       :   31 (  30 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   26 (   9   ~;   0   |;  13   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number arithmetic     :   69 (   0 atm;  18 fun;  39 num;  12 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    :    6 (   2 usr;   5 con; 0-2 aty)
%            Number of variables   :   12 (   6   !;   6   ?;  12   :)

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

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

tff(f33,plain,
    $false,
    inference(subsumption_resolution,[],[f32,f31]) ).

tff(f31,plain,
    42 = sK0,
    inference(evaluation,[],[f28]) ).

tff(f28,plain,
    $product(7,6) = sK0,
    inference(cnf_transformation,[],[f25]) ).

tff(f25,plain,
    ( ( $product(7,6) = sK0 )
    & ( $product(6,7) = sK1 )
    & ( sK0 != sK1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f23,f24]) ).

tff(f24,plain,
    ( ? [X0: $int,X1: $int] :
        ( ( $product(7,6) = X0 )
        & ( $product(6,7) = X1 )
        & ( X0 != X1 ) )
   => ( ( $product(7,6) = sK0 )
      & ( $product(6,7) = sK1 )
      & ( sK0 != sK1 ) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

tff(f32,plain,
    42 != sK0,
    inference(forward_demodulation,[],[f26,f30]) ).

tff(f30,plain,
    42 = sK1,
    inference(evaluation,[],[f27]) ).

tff(f27,plain,
    $product(6,7) = sK1,
    inference(cnf_transformation,[],[f25]) ).

tff(f26,plain,
    sK0 != sK1,
    inference(cnf_transformation,[],[f25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : ARI121=1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/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.12/0.34  % Computer : n004.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon Aug 29 15:19:19 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.49  % (22211)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.19/0.50  % (22226)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.19/0.50  % (22220)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.19/0.50  % (22218)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.19/0.50  % (22211)First to succeed.
% 0.19/0.50  % (22211)Refutation found. Thanks to Tanya!
% 0.19/0.50  % SZS status Theorem for theBenchmark
% 0.19/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50  % (22211)------------------------------
% 0.19/0.50  % (22211)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (22211)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (22211)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (22211)Memory used [KB]: 5373
% 0.19/0.50  % (22211)Time elapsed: 0.004 s
% 0.19/0.50  % (22211)Instructions burned: 3 (million)
% 0.19/0.50  % (22211)------------------------------
% 0.19/0.50  % (22211)------------------------------
% 0.19/0.50  % (22209)Success in time 0.155 s
%------------------------------------------------------------------------------