TSTP Solution File: GRP157-1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : GRP157-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_sat --cores 0 -t %d %s

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

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    6 (   6 unt;   0 def)
%            Number of atoms       :    6 (   5 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :    3 (   3   !;   0   ?)

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

fof(f193,plain,
    multiply(c,b) != multiply(c,b),
    inference(forward_demodulation,[],[f174,f16]) ).

fof(f16,axiom,
    b = least_upper_bound(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_mono2a_1) ).

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

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(f17,axiom,
    multiply(c,b) != least_upper_bound(multiply(c,a),multiply(c,b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_mono2a) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GRP157-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Aug 29 22:19:30 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.50  % (3807)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.20/0.51  % (3807)First to succeed.
% 0.20/0.51  % (3807)Refutation found. Thanks to Tanya!
% 0.20/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (3807)------------------------------
% 0.20/0.51  % (3807)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (3807)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (3807)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (3807)Memory used [KB]: 5628
% 0.20/0.51  % (3807)Time elapsed: 0.102 s
% 0.20/0.51  % (3807)Instructions burned: 12 (million)
% 0.20/0.51  % (3807)------------------------------
% 0.20/0.51  % (3807)------------------------------
% 0.20/0.51  % (3786)Success in time 0.151 s
%------------------------------------------------------------------------------