TSTP Solution File: GRP162-1 by Fiesta---2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Fiesta---2
% Problem : GRP162-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : dedam
% Command : fiesta-wrapper %s
% Computer : n005.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:58 EDT 2022
% Result : Unsatisfiable 0.71s 1.06s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP162-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : fiesta-wrapper %s
% 0.12/0.33 % Computer : n005.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 05:08:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/1.06 Theorem Proved.
% 0.71/1.06 % SZS status Unsatisfiable
% 0.71/1.06 % SZS output start CNFRefutation
% 0.71/1.06 [1=axiom,[],
% 0.71/1.06 least_upper_bound(b,c) = c].
% 0.71/1.06 [2=axiom,[],
% 0.71/1.06 least_upper_bound(a,b) = b].
% 0.71/1.06 [7=axiom,[],
% 0.71/1.06 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10].
% 0.71/1.06 [8=axiom,[],
% 0.71/1.06 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10].
% 0.71/1.06 [12=axiom,[],
% 0.71/1.06 greatest_lower_bound(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(X10,greatest_lower_bound(X11,X12))].
% 0.71/1.06 [13=axiom,[],
% 0.71/1.06 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)].
% 0.71/1.06 [14=demod(1),[13],
% 0.71/1.06 least_upper_bound(c,b) = c].
% 0.71/1.06 [15=demod(2),[13],
% 0.71/1.06 least_upper_bound(b,a) = b].
% 0.71/1.06 [16=axiom,[],
% 0.71/1.06 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)].
% 0.71/1.06 [20=axiom,[],
% 0.71/1.06 thtop(X10,X10) = thmfalse].
% 0.71/1.06 [21=axiom,[13],
% 0.71/1.06 thtop(least_upper_bound(c,a),c) = thmtrue].
% 0.71/1.06 [30=param(7,13),[],
% 0.71/1.06 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10].
% 0.71/1.06 [43=param(30,14),[16],
% 0.71/1.06 greatest_lower_bound(c,b) = b].
% 0.71/1.06 [44=param(30,15),[16],
% 0.71/1.06 greatest_lower_bound(b,a) = a].
% 0.71/1.06 [60=param(12,43),[],
% 0.71/1.06 greatest_lower_bound(c,greatest_lower_bound(b,X10)) = greatest_lower_bound(b,X10)].
% 0.71/1.06 [63=param(60,44),[44],
% 0.71/1.06 greatest_lower_bound(c,a) = a].
% 0.71/1.06 [67=param(8,63),[],
% 0.71/1.06 least_upper_bound(c,a) = c].
% 0.71/1.06 [72=param(21,67),[20],
% 0.71/1.06 thmtrue = thmfalse].
% 0.71/1.06 % SZS output end CNFRefutation
% 0.71/1.06 Space: 46 KB
%------------------------------------------------------------------------------