TSTP Solution File: GRP193-2 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : n019.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 16:20:51 EDT 2022

% Result   : Unsatisfiable 1.59s 0.57s
% Output   : Refutation 1.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   27 (  27 unt;   0 def)
%            Number of atoms       :   27 (  26 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    1 (   1   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   28 (  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f114,plain,
    $false,
    inference(subsumption_resolution,[],[f113,f21]) ).

fof(f21,axiom,
    greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p8_9b) ).

fof(f113,plain,
    greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c),
    inference(forward_demodulation,[],[f112,f1]) ).

fof(f1,axiom,
    ! [X0] : multiply(identity,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).

fof(f112,plain,
    greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,multiply(identity,c)),
    inference(forward_demodulation,[],[f111,f17]) ).

fof(f17,axiom,
    identity = greatest_lower_bound(identity,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_9b_2) ).

fof(f111,plain,
    greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,multiply(greatest_lower_bound(identity,b),c)),
    inference(forward_demodulation,[],[f110,f108]) ).

fof(f108,plain,
    ! [X10,X11,X12] : multiply(greatest_lower_bound(X10,X12),X11) = multiply(greatest_lower_bound(X12,X10),X11),
    inference(forward_demodulation,[],[f102,f15]) ).

fof(f15,axiom,
    ! [X2,X0,X1] : multiply(greatest_lower_bound(X1,X2),X0) = greatest_lower_bound(multiply(X1,X0),multiply(X2,X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_glb2) ).

fof(f102,plain,
    ! [X10,X11,X12] : multiply(greatest_lower_bound(X10,X12),X11) = greatest_lower_bound(multiply(X12,X11),multiply(X10,X11)),
    inference(superposition,[],[f15,f4]) ).

fof(f4,axiom,
    ! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_glb) ).

fof(f110,plain,
    greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,multiply(greatest_lower_bound(b,identity),c)),
    inference(backward_demodulation,[],[f48,f109]) ).

fof(f109,plain,
    ! [X0,X1] : multiply(greatest_lower_bound(X1,identity),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
    inference(forward_demodulation,[],[f97,f4]) ).

fof(f97,plain,
    ! [X0,X1] : greatest_lower_bound(multiply(X1,X0),X0) = multiply(greatest_lower_bound(X1,identity),X0),
    inference(superposition,[],[f15,f1]) ).

fof(f48,plain,
    greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(c,multiply(b,c))),
    inference(backward_demodulation,[],[f47,f30]) ).

fof(f30,plain,
    ! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X0,X1)),
    inference(superposition,[],[f6,f9]) ).

fof(f9,axiom,
    ! [X0] : greatest_lower_bound(X0,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_of_gld) ).

fof(f6,axiom,
    ! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_glb) ).

fof(f47,plain,
    greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(a,greatest_lower_bound(c,multiply(b,c)))),
    inference(backward_demodulation,[],[f25,f46]) ).

fof(f46,plain,
    ! [X2,X3,X4] : greatest_lower_bound(X2,greatest_lower_bound(X3,X4)) = greatest_lower_bound(X3,greatest_lower_bound(X2,X4)),
    inference(forward_demodulation,[],[f31,f6]) ).

fof(f31,plain,
    ! [X2,X3,X4] : greatest_lower_bound(X2,greatest_lower_bound(X3,X4)) = greatest_lower_bound(greatest_lower_bound(X3,X2),X4),
    inference(superposition,[],[f6,f4]) ).

fof(f25,plain,
    greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(c,greatest_lower_bound(a,multiply(b,c)))),
    inference(forward_demodulation,[],[f24,f6]) ).

fof(f24,plain,
    greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(greatest_lower_bound(a,c),greatest_lower_bound(a,multiply(b,c))),
    inference(forward_demodulation,[],[f23,f1]) ).

fof(f23,plain,
    greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(multiply(identity,greatest_lower_bound(a,c)),greatest_lower_bound(a,multiply(b,c))),
    inference(forward_demodulation,[],[f22,f19]) ).

fof(f19,axiom,
    identity = greatest_lower_bound(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_9b_4) ).

fof(f22,plain,
    greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)),greatest_lower_bound(a,multiply(b,c))),
    inference(forward_demodulation,[],[f20,f4]) ).

fof(f20,axiom,
    greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_9b_5) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13  % Problem    : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.05/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 : n019.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 22:23:05 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.54  % (19887)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 (2999ds/467Mi)
% 0.21/0.54  % (19879)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 (2999ds/75Mi)
% 0.21/0.54  % (19880)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 (2999ds/99Mi)
% 0.21/0.55  % (19871)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.55  % (19872)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.55  % (19872)Instruction limit reached!
% 0.21/0.55  % (19872)------------------------------
% 0.21/0.55  % (19872)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55  % (19872)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55  % (19872)Termination reason: Unknown
% 0.21/0.55  % (19872)Termination phase: Saturation
% 0.21/0.55  
% 0.21/0.55  % (19872)Memory used [KB]: 5373
% 0.21/0.55  % (19872)Time elapsed: 0.129 s
% 0.21/0.55  % (19872)Instructions burned: 2 (million)
% 0.21/0.55  % (19872)------------------------------
% 0.21/0.55  % (19872)------------------------------
% 0.21/0.55  % (19871)Instruction limit reached!
% 0.21/0.55  % (19871)------------------------------
% 0.21/0.55  % (19871)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55  % (19888)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.21/0.56  % (19871)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56  % (19871)Termination reason: Unknown
% 0.21/0.56  % (19871)Termination phase: Saturation
% 0.21/0.56  
% 0.21/0.56  % (19871)Memory used [KB]: 5500
% 0.21/0.56  % (19871)Time elapsed: 0.132 s
% 0.21/0.56  % (19871)Instructions burned: 7 (million)
% 0.21/0.56  % (19871)------------------------------
% 0.21/0.56  % (19871)------------------------------
% 1.59/0.57  % (19887)First to succeed.
% 1.59/0.57  % (19887)Refutation found. Thanks to Tanya!
% 1.59/0.57  % SZS status Unsatisfiable for theBenchmark
% 1.59/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 1.59/0.57  % (19887)------------------------------
% 1.59/0.57  % (19887)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.57  % (19887)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.57  % (19887)Termination reason: Refutation
% 1.59/0.57  
% 1.59/0.57  % (19887)Memory used [KB]: 5500
% 1.59/0.57  % (19887)Time elapsed: 0.145 s
% 1.59/0.57  % (19887)Instructions burned: 7 (million)
% 1.59/0.57  % (19887)------------------------------
% 1.59/0.57  % (19887)------------------------------
% 1.59/0.57  % (19863)Success in time 0.204 s
%------------------------------------------------------------------------------