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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : ARI701_1 : TPTP v8.1.0. Released v6.3.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 : 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:49:01 EDT 2022

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   31 (  24 unt;   7 typ;   0 def)
%            Number of atoms       :   24 (  23 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number arithmetic     :   45 (   0 atm;  31 fun;   8 num;   6 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    :    9 (   7 usr;   8 con; 0-2 aty)
%            Number of variables   :    6 (   6   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    x: $int ).

tff(func_def_1,type,
    y: $int ).

tff(func_def_2,type,
    a: $int ).

tff(func_def_3,type,
    z: $int ).

tff(func_def_4,type,
    b: $int ).

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

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

tff(f258,plain,
    $false,
    inference(subsumption_resolution,[],[f257,f32]) ).

tff(f32,plain,
    1 != sF1,
    inference(definition_folding,[],[f28,f31,f30]) ).

tff(f30,plain,
    $product(z,y) = sF0,
    introduced(function_definition,[]) ).

tff(f31,plain,
    sF1 = $product(sF0,x),
    introduced(function_definition,[]) ).

tff(f28,plain,
    1 != $product($product(z,y),x),
    inference(cnf_transformation,[],[f24]) ).

tff(f24,plain,
    1 != $product($product(z,y),x),
    inference(flattening,[],[f5]) ).

tff(f5,negated_conjecture,
    ( ( ~ 1 )
    = $product($product(z,y),x) ),
    inference(negated_conjecture,[],[f4]) ).

tff(f4,conjecture,
    1 = $product($product(z,y),x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

tff(f257,plain,
    1 = sF1,
    inference(forward_demodulation,[],[f256,f26]) ).

tff(f26,plain,
    $product(a,z) = 1,
    inference(cnf_transformation,[],[f3]) ).

tff(f3,axiom,
    $product(a,z) = 1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq3) ).

tff(f256,plain,
    $product(a,z) = sF1,
    inference(forward_demodulation,[],[f248,f50]) ).

tff(f50,plain,
    sF1 = $product(x,b),
    inference(backward_demodulation,[],[f44,f49]) ).

tff(f49,plain,
    b = sF0,
    inference(forward_demodulation,[],[f47,f27]) ).

tff(f27,plain,
    $product(y,z) = b,
    inference(cnf_transformation,[],[f2]) ).

tff(f2,axiom,
    $product(y,z) = b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq2) ).

tff(f47,plain,
    $product(y,z) = sF0,
    inference(superposition,[],[f30,f17]) ).

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

tff(f44,plain,
    $product(x,sF0) = sF1,
    inference(superposition,[],[f31,f17]) ).

tff(f248,plain,
    $product(a,z) = $product(x,b),
    inference(superposition,[],[f124,f27]) ).

tff(f124,plain,
    ! [X10: $int] : ( $product(x,$product(y,X10)) = $product(a,X10) ),
    inference(superposition,[],[f18,f25]) ).

tff(f25,plain,
    $product(x,y) = a,
    inference(cnf_transformation,[],[f1]) ).

tff(f1,axiom,
    $product(x,y) = a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq1) ).

tff(f18,plain,
    ! [X2: $int,X0: $int,X1: $int] : ( $product($product(X0,X1),X2) = $product(X0,$product(X1,X2)) ),
    introduced(theory_axiom_141,[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : ARI701=1 : TPTP v8.1.0. Released v6.3.0.
% 0.12/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.14/0.35  % Computer : n013.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Aug 29 15:53:17 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  % (28657)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.50  % (28677)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.20/0.50  % (28669)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.20/0.50  % (28658)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.51  % (28661)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.20/0.51  % (28671)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/59Mi)
% 0.20/0.51  % (28671)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.20/0.51  % (28671)Terminated due to inappropriate strategy.
% 0.20/0.51  % (28671)------------------------------
% 0.20/0.51  % (28671)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (28671)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (28671)Termination reason: Inappropriate
% 0.20/0.51  
% 0.20/0.51  % (28671)Memory used [KB]: 895
% 0.20/0.51  % (28671)Time elapsed: 0.003 s
% 0.20/0.51  % (28671)Instructions burned: 1 (million)
% 0.20/0.51  % (28671)------------------------------
% 0.20/0.51  % (28671)------------------------------
% 0.20/0.51  % (28665)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.20/0.51  % (28659)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/48Mi)
% 0.20/0.51  % (28658)First to succeed.
% 0.20/0.52  % (28658)Refutation found. Thanks to Tanya!
% 0.20/0.52  % SZS status Theorem for theBenchmark
% 0.20/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52  % (28658)------------------------------
% 0.20/0.52  % (28658)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (28658)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (28658)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (28658)Memory used [KB]: 5500
% 0.20/0.52  % (28658)Time elapsed: 0.116 s
% 0.20/0.52  % (28658)Instructions burned: 11 (million)
% 0.20/0.52  % (28658)------------------------------
% 0.20/0.52  % (28658)------------------------------
% 0.20/0.52  % (28651)Success in time 0.161 s
%------------------------------------------------------------------------------