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

View Problem - Process Solution

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

% Computer : n017.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:16 EDT 2022

% Result   : Unsatisfiable 0.45s 1.15s
% Output   : CNFRefutation 0.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP191-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : fiesta-wrapper %s
% 0.13/0.34  % Computer : n017.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  : 600
% 0.13/0.34  % DateTime : Mon Jun 13 22:31:23 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.45/1.15  Theorem Proved.
% 0.45/1.15  % SZS status Unsatisfiable
% 0.45/1.15  % SZS output start CNFRefutation
% 0.45/1.15  [1=axiom,[],
% 0.45/1.15  			greatest_lower_bound(a,b) 	= b].
% 0.45/1.15  [2=axiom,[],
% 0.45/1.15  			multiply(greatest_lower_bound(X10,X11),X12) 	= greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))].
% 0.45/1.15  [4=axiom,[],
% 0.45/1.15  			multiply(X10,greatest_lower_bound(X11,X12)) 	= greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))].
% 0.45/1.15  [13=axiom,[],
% 0.45/1.15  			greatest_lower_bound(X10,X11) 	= greatest_lower_bound(X11,X10)].
% 0.45/1.15  [14=demod(1),[13],
% 0.45/1.15  			greatest_lower_bound(b,a) 	= b].
% 0.45/1.15  [15=axiom,[],
% 0.45/1.15  			multiply(multiply(X10,X11),X12) 	= multiply(X10,multiply(X11,X12))].
% 0.45/1.15  [16=axiom,[],
% 0.45/1.15  			multiply(inverse(X10),X10) 	= identity].
% 0.45/1.15  [17=axiom,[],
% 0.45/1.15  			multiply(identity,X10) 	= X10].
% 0.45/1.15  [18=axiom,[],
% 0.45/1.15  			thtop(X10,X10) 	= thmfalse].
% 0.45/1.15  [19=axiom,[13],
% 0.45/1.15  			thtop(greatest_lower_bound(inverse(b),inverse(a)),inverse(a)) 	= thmtrue].
% 0.45/1.15  [21=param(4,14),[],
% 0.45/1.15  			greatest_lower_bound(multiply(X10,b),multiply(X10,a)) 	= multiply(X10,b)].
% 0.45/1.15  [63=param(15,16),[17],
% 0.45/1.15  			multiply(inverse(X11),multiply(X11,X10)) 	= X10].
% 0.45/1.15  [68=param(63,16),[],
% 0.45/1.15  			multiply(inverse(inverse(X10)),identity) 	= X10].
% 0.45/1.15  [70=param(63,63),[],
% 0.45/1.15  			multiply(inverse(inverse(X10)),X11) 	= multiply(X10,X11)].
% 0.45/1.15  [71=demod(68),[70],
% 0.45/1.15  			multiply(X10,identity) 	= X10].
% 0.45/1.15  [75=param(21,16),[16],
% 0.45/1.15  			greatest_lower_bound(identity,multiply(inverse(b),a)) 	= identity].
% 0.45/1.15  [77=param(2,75),[17,17,15],
% 0.45/1.15  			greatest_lower_bound(X10,multiply(inverse(b),multiply(a,X10))) 	= X10].
% 0.45/1.15  [81=param(70,16),[],
% 0.45/1.15  			multiply(X10,inverse(X10)) 	= identity].
% 0.45/1.15  [512=param(77,81),[71,13],
% 0.45/1.15  			greatest_lower_bound(inverse(b),inverse(a)) 	= inverse(a)].
% 0.45/1.15  [517=param(19,512),[18],
% 0.45/1.15  			thmtrue 	= thmfalse].
% 0.45/1.15  % SZS output end CNFRefutation
% 0.45/1.15  Space:    486 KB 
%------------------------------------------------------------------------------