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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : ARI691_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 : n018.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:48:59 EDT 2022

% Result   : Theorem 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   14 (  11 unt;   3 typ;   0 def)
%            Number of atoms       :   11 (  10 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number arithmetic     :   22 (   0 atm;  20 fun;   0 num;   2 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    1 (   1   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    2 (   2   !;   0   ?;   2   :)

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

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

tff(func_def_2,type,
    f: $int > $int ).

tff(f101,plain,
    $false,
    inference(trivial_inequality_removal,[],[f100]) ).

tff(f100,plain,
    $product(a,b) != $product(a,b),
    inference(superposition,[],[f27,f23]) ).

tff(f23,plain,
    $product(a,b) = f($product(a,b)),
    inference(cnf_transformation,[],[f1]) ).

tff(f1,axiom,
    $product(a,b) = f($product(a,b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq) ).

tff(f27,plain,
    $product(a,b) != f($product(a,b)),
    inference(forward_demodulation,[],[f26,f23]) ).

tff(f26,plain,
    $product(a,b) != f(f($product(a,b))),
    inference(forward_demodulation,[],[f24,f15]) ).

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

tff(f24,plain,
    f(f($product(a,b))) != $product(b,a),
    inference(cnf_transformation,[],[f22]) ).

tff(f22,plain,
    f(f($product(a,b))) != $product(b,a),
    inference(flattening,[],[f3]) ).

tff(f3,negated_conjecture,
    ( ( ~ f(f($product(a,b))) )
    = $product(b,a) ),
    inference(negated_conjecture,[],[f2]) ).

tff(f2,conjecture,
    f(f($product(a,b))) = $product(b,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : ARI691=1 : TPTP v8.1.0. Released v6.3.0.
% 0.03/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.33  % Computer : n018.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Aug 29 15:58:54 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.49  % (25554)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.50  % (25538)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  % (25537)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.19/0.50  % (25550)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.19/0.50  % (25542)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.50  % (25537)First to succeed.
% 0.19/0.50  % (25540)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.19/0.50  % (25536)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  % (25537)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  % (25537)------------------------------
% 0.19/0.50  % (25537)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (25537)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (25537)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (25537)Memory used [KB]: 895
% 0.19/0.50  % (25537)Time elapsed: 0.107 s
% 0.19/0.50  % (25537)Instructions burned: 5 (million)
% 0.19/0.50  % (25537)------------------------------
% 0.19/0.50  % (25537)------------------------------
% 0.19/0.50  % (25527)Success in time 0.16 s
%------------------------------------------------------------------------------