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

% Computer : n032.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:13:03 EDT 2022

% Result   : Unsatisfiable 0.54s 0.95s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : GRP170-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.10  % Command  : fiesta-wrapper %s
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Tue Jun 14 03:53:57 EDT 2022
% 0.10/0.29  % CPUTime  : 
% 0.54/0.95  Theorem Proved.
% 0.54/0.95  % SZS status Unsatisfiable
% 0.54/0.95  % SZS output start CNFRefutation
% 0.54/0.95  [1=axiom,[],
% 0.54/0.95  			least_upper_bound(c,d) 	= d].
% 0.54/0.95  [2=axiom,[],
% 0.54/0.95  			least_upper_bound(a,b) 	= b].
% 0.54/0.95  [4=axiom,[],
% 0.54/0.95  			multiply(least_upper_bound(X10,X11),X12) 	= least_upper_bound(multiply(X10,X12),multiply(X11,X12))].
% 0.54/0.95  [6=axiom,[],
% 0.54/0.95  			multiply(X10,least_upper_bound(X11,X12)) 	= least_upper_bound(multiply(X10,X11),multiply(X10,X12))].
% 0.54/0.95  [11=axiom,[],
% 0.54/0.95  			least_upper_bound(least_upper_bound(X10,X11),X12) 	= least_upper_bound(X10,least_upper_bound(X11,X12))].
% 0.54/0.95  [13=axiom,[],
% 0.54/0.95  			least_upper_bound(X10,X11) 	= least_upper_bound(X11,X10)].
% 0.54/0.95  [14=demod(1),[13],
% 0.54/0.95  			least_upper_bound(d,c) 	= d].
% 0.54/0.95  [15=demod(2),[13],
% 0.54/0.95  			least_upper_bound(b,a) 	= b].
% 0.54/0.95  [20=axiom,[],
% 0.54/0.95  			thtop(X10,X10) 	= thmfalse].
% 0.54/0.95  [21=axiom,[13],
% 0.54/0.95  			thtop(least_upper_bound(multiply(b,d),multiply(a,c)),multiply(b,d)) 	= thmtrue].
% 0.54/0.95  [23=param(4,15),[],
% 0.54/0.95  			least_upper_bound(multiply(b,X10),multiply(a,X10)) 	= multiply(b,X10)].
% 0.54/0.95  [26=param(6,14),[],
% 0.54/0.95  			least_upper_bound(multiply(X10,d),multiply(X10,c)) 	= multiply(X10,d)].
% 0.54/0.95  [81=param(11,23),[],
% 0.54/0.95  			least_upper_bound(multiply(b,X10),least_upper_bound(multiply(a,X10),X11)) 	= least_upper_bound(multiply(b,X10),X11)].
% 0.54/0.95  [600=param(81,26),[23],
% 0.54/0.95  			least_upper_bound(multiply(b,d),multiply(a,c)) 	= multiply(b,d)].
% 0.54/0.95  [619=param(21,600),[20],
% 0.54/0.95  			thmtrue 	= thmfalse].
% 0.54/0.95  % SZS output end CNFRefutation
% 0.54/0.95  Space:    520 KB 
%------------------------------------------------------------------------------