TSTP Solution File: GRP184-4 by Fiesta---2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Fiesta---2
% Problem : GRP184-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : dedam
% Command : fiesta-wrapper %s
% Computer : n016.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:12 EDT 2022
% Result : Unsatisfiable 0.72s 1.09s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP184-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : fiesta-wrapper %s
% 0.12/0.33 % Computer : n016.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 11:03:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.09 Theorem Proved.
% 0.72/1.09 % SZS status Unsatisfiable
% 0.72/1.09 % SZS output start CNFRefutation
% 0.72/1.09 [2=axiom,[],
% 0.72/1.09 inverse(greatest_lower_bound(X10,X11)) = least_upper_bound(inverse(X10),inverse(X11))].
% 0.72/1.09 [3=axiom,[],
% 0.72/1.09 inverse(multiply(X10,X11)) = multiply(inverse(X11),inverse(X10))].
% 0.72/1.09 [4=axiom,[],
% 0.72/1.09 inverse(inverse(X10)) = X10].
% 0.72/1.09 [5=axiom,[],
% 0.72/1.09 inverse(identity) = identity].
% 0.72/1.09 [7=axiom,[],
% 0.72/1.09 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))].
% 0.72/1.09 [9=axiom,[],
% 0.72/1.09 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))].
% 0.72/1.09 [13=axiom,[],
% 0.72/1.09 least_upper_bound(X10,X10) = X10].
% 0.72/1.09 [14=axiom,[],
% 0.72/1.09 least_upper_bound(least_upper_bound(X10,X11),X12) = least_upper_bound(X10,least_upper_bound(X11,X12))].
% 0.72/1.09 [16=axiom,[],
% 0.72/1.09 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)].
% 0.72/1.09 [19=axiom,[],
% 0.72/1.09 multiply(inverse(X10),X10) = identity].
% 0.72/1.09 [20=axiom,[],
% 0.72/1.09 multiply(identity,X10) = X10].
% 0.72/1.09 [21=axiom,[],
% 0.72/1.09 thtop(X10,X10) = thmfalse].
% 0.72/1.09 [22=axiom,[2,5,16,7,9,9,20,20,16,14,2,5,16,7,9,20,20,9,19,14],
% 0.72/1.09 thtop(least_upper_bound(identity,least_upper_bound(inverse(a),least_upper_bound(multiply(a,identity),multiply(a,inverse(a))))),least_upper_bound(a,least_upper_bound(identity,least_upper_bound(identity,multiply(inverse(a),identity))))) = thmtrue].
% 0.72/1.09 [32=param(19,4),[],
% 0.72/1.09 multiply(X10,inverse(X10)) = identity].
% 0.72/1.09 [39=param(3,5),[20],
% 0.72/1.09 inverse(multiply(X10,identity)) = inverse(X10)].
% 0.72/1.09 [41=param(4,39),[4],
% 0.72/1.09 multiply(X10,identity) = X10].
% 0.72/1.09 [54=param(14,13),[],
% 0.72/1.09 least_upper_bound(X10,least_upper_bound(X10,X11)) = least_upper_bound(X10,X11)].
% 0.72/1.09 [55=param(14,16),[],
% 0.72/1.09 least_upper_bound(X10,least_upper_bound(X11,X12)) = least_upper_bound(X12,least_upper_bound(X10,X11))].
% 0.72/1.09 [58=param(54,16),[],
% 0.72/1.09 least_upper_bound(X10,least_upper_bound(X11,X10)) = least_upper_bound(X10,X11)].
% 0.72/1.09 [179=param(22,55),[41,32,55,16,54,41,16,55,16,58,16,55,16,21],
% 0.72/1.09 thmtrue = thmfalse].
% 0.72/1.09 % SZS output end CNFRefutation
% 0.72/1.09 Space: 248 KB
%------------------------------------------------------------------------------