TSTP Solution File: GRP171-2 by Fiesta---2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Fiesta---2
% Problem : GRP171-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : dedam
% Command : fiesta-wrapper %s
% Computer : n007.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:04 EDT 2022
% Result : Unsatisfiable 0.71s 1.10s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP171-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.13 % Command : fiesta-wrapper %s
% 0.13/0.34 % Computer : n007.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 08:09:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.71/1.10 Theorem Proved.
% 0.71/1.10 % SZS status Unsatisfiable
% 0.71/1.10 % SZS output start CNFRefutation
% 0.71/1.10 [1=axiom,[],
% 0.71/1.10 least_upper_bound(identity,b) = b].
% 0.71/1.10 [2=axiom,[],
% 0.71/1.10 least_upper_bound(identity,a) = a].
% 0.71/1.10 [6=axiom,[],
% 0.71/1.10 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))].
% 0.71/1.10 [7=axiom,[],
% 0.71/1.10 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10].
% 0.71/1.10 [11=axiom,[],
% 0.71/1.10 least_upper_bound(least_upper_bound(X10,X11),X12) = least_upper_bound(X10,least_upper_bound(X11,X12))].
% 0.71/1.10 [13=axiom,[],
% 0.71/1.10 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)].
% 0.71/1.10 [14=demod(1),[13],
% 0.71/1.10 least_upper_bound(b,identity) = b].
% 0.71/1.10 [15=demod(2),[13],
% 0.71/1.10 least_upper_bound(a,identity) = a].
% 0.71/1.10 [17=axiom,[],
% 0.71/1.10 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))].
% 0.71/1.10 [18=axiom,[],
% 0.71/1.10 multiply(inverse(X10),X10) = identity].
% 0.71/1.10 [19=axiom,[],
% 0.71/1.10 multiply(identity,X10) = X10].
% 0.71/1.10 [20=axiom,[],
% 0.71/1.10 thtop(X10,X10) = thmfalse].
% 0.71/1.10 [21=axiom,[],
% 0.71/1.10 thtop(greatest_lower_bound(identity,multiply(a,b)),identity) = thmtrue].
% 0.71/1.10 [26=param(6,14),[],
% 0.71/1.10 least_upper_bound(multiply(X10,b),multiply(X10,identity)) = multiply(X10,b)].
% 0.71/1.10 [30=param(7,13),[],
% 0.71/1.10 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10].
% 0.71/1.10 [42=param(30,11),[],
% 0.71/1.10 greatest_lower_bound(X10,least_upper_bound(X11,least_upper_bound(X12,X10))) = X10].
% 0.71/1.10 [65=param(17,18),[19],
% 0.71/1.10 multiply(inverse(X11),multiply(X11,X10)) = X10].
% 0.71/1.10 [71=param(65,18),[],
% 0.71/1.10 multiply(inverse(inverse(X10)),identity) = X10].
% 0.71/1.10 [73=param(65,65),[],
% 0.71/1.10 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)].
% 0.71/1.10 [74=demod(71),[73],
% 0.71/1.10 multiply(X10,identity) = X10].
% 0.71/1.10 [78=demod(26),[74,13],
% 0.71/1.10 least_upper_bound(X10,multiply(X10,b)) = multiply(X10,b)].
% 0.71/1.10 [279=param(42,15),[],
% 0.71/1.10 greatest_lower_bound(identity,least_upper_bound(X10,a)) = identity].
% 0.71/1.10 [303=param(279,13),[],
% 0.71/1.10 greatest_lower_bound(identity,least_upper_bound(a,X10)) = identity].
% 0.71/1.10 [310=param(303,78),[],
% 0.71/1.10 greatest_lower_bound(identity,multiply(a,b)) = identity].
% 0.71/1.10 [316=param(21,310),[20],
% 0.71/1.10 thmtrue = thmfalse].
% 0.71/1.10 % SZS output end CNFRefutation
% 0.71/1.10 Space: 224 KB
%------------------------------------------------------------------------------