TSTP Solution File: GRP184-1 by Fiesta---2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Fiesta---2
% Problem : GRP184-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : dedam
% Command : fiesta-wrapper %s
% Computer : n027.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:11 EDT 2022
% Result : Unsatisfiable 0.72s 1.07s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP184-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : fiesta-wrapper %s
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 14:06:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.07 Theorem Proved.
% 0.72/1.07 % SZS status Unsatisfiable
% 0.72/1.07 % SZS output start CNFRefutation
% 0.72/1.07 [1=axiom,[],
% 0.72/1.07 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))].
% 0.72/1.07 [2=axiom,[],
% 0.72/1.07 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))].
% 0.72/1.07 [3=axiom,[],
% 0.72/1.07 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))].
% 0.72/1.07 [4=axiom,[],
% 0.72/1.07 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))].
% 0.72/1.07 [11=axiom,[],
% 0.72/1.07 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)].
% 0.72/1.07 [13=axiom,[],
% 0.72/1.07 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))].
% 0.72/1.07 [14=axiom,[],
% 0.72/1.07 multiply(inverse(X10),X10) = identity].
% 0.72/1.07 [15=axiom,[],
% 0.72/1.07 multiply(identity,X10) = X10].
% 0.72/1.07 [16=axiom,[],
% 0.72/1.07 thtop(X10,X10) = thmfalse].
% 0.72/1.07 [17=axiom,[2,15,11,4],
% 0.72/1.07 thtop(least_upper_bound(inverse(greatest_lower_bound(a,identity)),multiply(a,inverse(greatest_lower_bound(a,identity)))),least_upper_bound(multiply(inverse(greatest_lower_bound(a,identity)),a),multiply(inverse(greatest_lower_bound(a,identity)),identity))) = thmtrue].
% 0.72/1.07 [53=param(13,14),[15],
% 0.72/1.07 multiply(inverse(X11),multiply(X11,X10)) = X10].
% 0.72/1.07 [55=param(53,14),[],
% 0.72/1.07 multiply(inverse(inverse(X10)),identity) = X10].
% 0.72/1.07 [57=param(53,53),[],
% 0.72/1.07 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)].
% 0.72/1.07 [58=demod(55),[57],
% 0.72/1.07 multiply(X10,identity) = X10].
% 0.72/1.07 [65=param(57,14),[],
% 0.72/1.07 multiply(X10,inverse(X10)) = identity].
% 0.72/1.07 [67=param(57,58),[58],
% 0.72/1.07 inverse(inverse(X10)) = X10].
% 0.72/1.07 [75=param(65,13),[],
% 0.72/1.07 multiply(X10,multiply(X11,inverse(multiply(X10,X11)))) = identity].
% 0.72/1.07 [129=param(53,75),[58],
% 0.72/1.07 multiply(X11,inverse(multiply(X10,X11))) = inverse(X10)].
% 0.72/1.07 [136=param(53,129),[],
% 0.72/1.07 multiply(inverse(X10),inverse(X11)) = inverse(multiply(X11,X10))].
% 0.72/1.07 [167=param(67,136),[],
% 0.72/1.07 inverse(multiply(inverse(X10),inverse(X11))) = multiply(X11,X10)].
% 0.72/1.07 [172=param(17,167),[67,1,65,15,-167,67,3,14,58,58,11,16],
% 0.72/1.07 thmtrue = thmfalse].
% 0.72/1.07 % SZS output end CNFRefutation
% 0.72/1.07 Space: 154 KB
%------------------------------------------------------------------------------