TSTP Solution File: GRP140-1 by Fiesta---2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Fiesta---2
% Problem : GRP140-1 : 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:12:53 EDT 2022
% Result : Unsatisfiable 0.73s 1.10s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP140-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/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 10:29:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.73/1.10 Theorem Proved.
% 0.73/1.10 % SZS status Unsatisfiable
% 0.73/1.10 % SZS output start CNFRefutation
% 0.73/1.10 [1=axiom,[],
% 0.73/1.10 greatest_lower_bound(b,c) = c].
% 0.73/1.10 [2=axiom,[],
% 0.73/1.10 greatest_lower_bound(a,c) = c].
% 0.73/1.10 [7=axiom,[],
% 0.73/1.10 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10].
% 0.73/1.10 [8=axiom,[],
% 0.73/1.10 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10].
% 0.73/1.10 [12=axiom,[],
% 0.73/1.10 greatest_lower_bound(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(X10,greatest_lower_bound(X11,X12))].
% 0.73/1.10 [13=axiom,[],
% 0.73/1.10 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)].
% 0.73/1.10 [14=axiom,[],
% 0.73/1.10 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)].
% 0.73/1.10 [15=demod(2),[14],
% 0.73/1.10 greatest_lower_bound(c,a) = c].
% 0.73/1.10 [19=axiom,[],
% 0.73/1.10 thtop(X10,X10) = thmfalse].
% 0.73/1.10 [20=axiom,[14,13,14],
% 0.73/1.10 thtop(least_upper_bound(c,greatest_lower_bound(b,a)),greatest_lower_bound(b,a)) = thmtrue].
% 0.73/1.10 [25=param(8,14),[],
% 0.73/1.10 least_upper_bound(X10,greatest_lower_bound(X11,X10)) = X10].
% 0.73/1.10 [35=param(7,13),[],
% 0.73/1.10 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10].
% 0.73/1.10 [54=param(12,1),[],
% 0.73/1.10 greatest_lower_bound(b,greatest_lower_bound(c,X10)) = greatest_lower_bound(c,X10)].
% 0.73/1.10 [58=param(12,14),[],
% 0.73/1.10 greatest_lower_bound(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(X12,greatest_lower_bound(X10,X11))].
% 0.73/1.10 [60=param(12,15),[],
% 0.73/1.10 greatest_lower_bound(c,greatest_lower_bound(a,X10)) = greatest_lower_bound(c,X10)].
% 0.73/1.10 [61=param(25,12),[],
% 0.73/1.10 least_upper_bound(X10,greatest_lower_bound(X11,greatest_lower_bound(X12,X10))) = X10].
% 0.73/1.10 [127=param(60,14),[],
% 0.73/1.10 greatest_lower_bound(c,greatest_lower_bound(X10,a)) = greatest_lower_bound(c,X10)].
% 0.73/1.10 [130=param(12,127),[12,12],
% 0.73/1.10 greatest_lower_bound(c,greatest_lower_bound(X10,greatest_lower_bound(a,X11))) = greatest_lower_bound(c,greatest_lower_bound(X10,X11))].
% 0.73/1.10 [133=param(8,54),[],
% 0.73/1.10 least_upper_bound(b,greatest_lower_bound(c,X10)) = b].
% 0.73/1.10 [138=param(133,14),[],
% 0.73/1.10 least_upper_bound(b,greatest_lower_bound(X10,c)) = b].
% 0.73/1.10 [147=param(35,138),[14],
% 0.73/1.10 greatest_lower_bound(b,greatest_lower_bound(X10,c)) = greatest_lower_bound(X10,c)].
% 0.73/1.10 [212=param(61,127),[],
% 0.73/1.10 least_upper_bound(a,greatest_lower_bound(c,X10)) = a].
% 0.73/1.10 [221=param(35,212),[14],
% 0.73/1.10 greatest_lower_bound(a,greatest_lower_bound(c,X10)) = greatest_lower_bound(c,X10)].
% 0.73/1.10 [400=param(58,147),[],
% 0.73/1.10 greatest_lower_bound(c,greatest_lower_bound(b,X10)) = greatest_lower_bound(X10,c)].
% 0.73/1.10 [405=param(12,400),[12,12],
% 0.73/1.10 greatest_lower_bound(X10,greatest_lower_bound(c,X11)) = greatest_lower_bound(c,greatest_lower_bound(b,greatest_lower_bound(X10,X11)))].
% 0.73/1.10 [406=demod(221),[405,130],
% 0.73/1.10 greatest_lower_bound(c,greatest_lower_bound(b,X10)) = greatest_lower_bound(c,X10)].
% 0.73/1.10 [407=param(25,406),[],
% 0.73/1.10 least_upper_bound(greatest_lower_bound(b,X10),greatest_lower_bound(c,X10)) = greatest_lower_bound(b,X10)].
% 0.73/1.10 [461=param(407,15),[13],
% 0.73/1.10 least_upper_bound(c,greatest_lower_bound(b,a)) = greatest_lower_bound(b,a)].
% 0.73/1.10 [476=param(20,461),[19],
% 0.73/1.10 thmtrue = thmfalse].
% 0.73/1.10 % SZS output end CNFRefutation
% 0.73/1.10 Space: 386 KB
%------------------------------------------------------------------------------