TSTP Solution File: GRP159-1 by SnakeForV---1.0

View Problem - Process Solution

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

% Computer : n016.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:14:36 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f126,plain,
    $false,
    inference(trivial_inequality_removal,[],[f125]) ).

fof(f125,plain,
    multiply(c,b) != multiply(c,b),
    inference(backward_demodulation,[],[f23,f115]) ).

fof(f115,plain,
    ! [X14] : multiply(X14,b) = least_upper_bound(multiply(X14,b),multiply(X14,a)),
    inference(superposition,[],[f12,f28]) ).

fof(f28,plain,
    b = least_upper_bound(b,a),
    inference(superposition,[],[f10,f20]) ).

fof(f20,plain,
    a = greatest_lower_bound(b,a),
    inference(superposition,[],[f16,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(f16,axiom,
    a = greatest_lower_bound(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_mono2c_1) ).

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

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

fof(f23,plain,
    multiply(c,b) != least_upper_bound(multiply(c,b),multiply(c,a)),
    inference(superposition,[],[f17,f5]) ).

fof(f5,axiom,
    ! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).

fof(f17,axiom,
    multiply(c,b) != least_upper_bound(multiply(c,a),multiply(c,b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_mono2c) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : GRP159-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.33  % Computer : n016.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon Aug 29 22:40:00 EDT 2022
% 0.13/0.33  % CPUTime    : 
% 0.20/0.48  % (9163)lrs+10_1:1_drc=off:fd=preordered:plsq=on:sp=occurrence:to=lpo:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.49  % (9167)dis+10_1:7_drc=off:fd=preordered:plsq=on:sp=reverse_frequency:to=lpo:i=212:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/212Mi)
% 0.20/0.49  % (9181)lrs+10_1:1_drc=off:fd=preordered:plsq=on:sp=occurrence:to=lpo:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.49  % (9152)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99788:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99788Mi)
% 0.20/0.50  % (9164)dis+10_1:1024_anc=all:drc=off:flr=on:fsr=off:sac=on:urr=on:i=292:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/292Mi)
% 0.20/0.50  % (9163)First to succeed.
% 0.20/0.50  % (9163)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (9163)------------------------------
% 0.20/0.50  % (9163)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (9163)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (9163)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (9163)Memory used [KB]: 5628
% 0.20/0.50  % (9163)Time elapsed: 0.106 s
% 0.20/0.50  % (9163)Instructions burned: 7 (million)
% 0.20/0.50  % (9163)------------------------------
% 0.20/0.50  % (9163)------------------------------
% 0.20/0.50  % (9151)Success in time 0.159 s
%------------------------------------------------------------------------------