TSTP Solution File: GRP156-1 by Fiesta---2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Fiesta---2
% Problem  : GRP156-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : dedam
% Command  : fiesta-wrapper %s

% Computer : n008.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  : 600s
% DateTime : Sat Jul 16 09:12:57 EDT 2022

% Result   : Unsatisfiable 0.41s 1.06s
% Output   : CNFRefutation 0.41s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP156-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12  % Command  : fiesta-wrapper %s
% 0.11/0.33  % Computer : n008.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Tue Jun 14 13:34:22 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.41/1.06  Theorem Proved.
% 0.41/1.06  % SZS status Unsatisfiable
% 0.41/1.06  % SZS output start CNFRefutation
% 0.41/1.06  [1=axiom,[],
% 0.41/1.06  			least_upper_bound(a,b) 	= b].
% 0.41/1.06  [2=axiom,[],
% 0.41/1.06  			multiply(greatest_lower_bound(X10,X11),X12) 	= greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))].
% 0.41/1.06  [6=axiom,[],
% 0.41/1.06  			greatest_lower_bound(X10,least_upper_bound(X10,X11)) 	= X10].
% 0.41/1.06  [12=axiom,[],
% 0.41/1.06  			least_upper_bound(X10,X11) 	= least_upper_bound(X11,X10)].
% 0.41/1.06  [13=demod(1),[12],
% 0.41/1.06  			least_upper_bound(b,a) 	= b].
% 0.41/1.06  [14=axiom,[],
% 0.41/1.06  			greatest_lower_bound(X10,X11) 	= greatest_lower_bound(X11,X10)].
% 0.41/1.06  [18=axiom,[],
% 0.41/1.06  			thtop(X10,X10) 	= thmfalse].
% 0.41/1.06  [19=axiom,[14],
% 0.41/1.06  			thtop(greatest_lower_bound(multiply(b,c),multiply(a,c)),multiply(a,c)) 	= thmtrue].
% 0.41/1.06  [26=param(6,12),[],
% 0.41/1.06  			greatest_lower_bound(X10,least_upper_bound(X11,X10)) 	= X10].
% 0.41/1.06  [28=param(26,13),[14],
% 0.41/1.06  			greatest_lower_bound(b,a) 	= a].
% 0.41/1.06  [40=param(2,28),[],
% 0.41/1.06  			greatest_lower_bound(multiply(b,X10),multiply(a,X10)) 	= multiply(a,X10)].
% 0.41/1.06  [221=param(19,40),[18],
% 0.41/1.06  			thmtrue 	= thmfalse].
% 0.41/1.06  % SZS output end CNFRefutation
% 0.41/1.06  Space:    184 KB 
%------------------------------------------------------------------------------