TSTP Solution File: GRP167-2 by Fiesta---2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Fiesta---2
% Problem : GRP167-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : dedam
% Command : fiesta-wrapper %s
% Computer : n028.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:01 EDT 2022
% Result : Unsatisfiable 2.06s 2.49s
% Output : CNFRefutation 2.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP167-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : fiesta-wrapper %s
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jun 13 04:09:07 EDT 2022
% 0.12/0.32 % CPUTime :
% 2.06/2.49 Theorem Proved.
% 2.06/2.49 % SZS status Unsatisfiable
% 2.06/2.49 % SZS output start CNFRefutation
% 2.06/2.49 [1=axiom,[],
% 2.06/2.49 greatest_lower_bound(X10,least_upper_bound(X11,X12)) = least_upper_bound(greatest_lower_bound(X10,X11),greatest_lower_bound(X10,X12))].
% 2.06/2.49 [2=axiom,[1],
% 2.06/2.49 least_upper_bound(greatest_lower_bound(least_upper_bound(X10,X11),X10),greatest_lower_bound(least_upper_bound(X10,X11),X12)) = least_upper_bound(X10,greatest_lower_bound(X11,X12))].
% 2.06/2.49 [3=axiom,[],
% 2.06/2.49 greatest_lower_bound(X10,identity) = negative_part(X10)].
% 2.06/2.49 [4=axiom,[],
% 2.06/2.49 least_upper_bound(X10,identity) = positive_part(X10)].
% 2.06/2.49 [5=axiom,[],
% 2.06/2.49 inverse(multiply(X10,X11)) = multiply(inverse(X11),inverse(X10))].
% 2.06/2.49 [6=axiom,[],
% 2.06/2.49 inverse(inverse(X10)) = X10].
% 2.06/2.49 [7=axiom,[],
% 2.06/2.49 inverse(identity) = identity].
% 2.06/2.49 [8=axiom,[],
% 2.06/2.49 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))].
% 2.06/2.49 [9=axiom,[],
% 2.06/2.49 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))].
% 2.06/2.49 [10=axiom,[],
% 2.06/2.49 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))].
% 2.06/2.49 [11=axiom,[],
% 2.06/2.49 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))].
% 2.06/2.49 [13=axiom,[],
% 2.06/2.49 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10].
% 2.06/2.49 [14=axiom,[],
% 2.06/2.49 greatest_lower_bound(X10,X10) = X10].
% 2.06/2.49 [15=axiom,[],
% 2.06/2.49 least_upper_bound(X10,X10) = X10].
% 2.06/2.49 [16=axiom,[],
% 2.06/2.49 least_upper_bound(least_upper_bound(X10,X11),X12) = least_upper_bound(X10,least_upper_bound(X11,X12))].
% 2.06/2.49 [17=axiom,[],
% 2.06/2.49 greatest_lower_bound(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(X10,greatest_lower_bound(X11,X12))].
% 2.06/2.49 [18=axiom,[],
% 2.06/2.49 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)].
% 2.06/2.49 [19=axiom,[],
% 2.06/2.49 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)].
% 2.06/2.49 [20=demod(2),[19,1,14,13],
% 2.06/2.49 least_upper_bound(X10,greatest_lower_bound(least_upper_bound(X10,X11),X12)) = least_upper_bound(X10,greatest_lower_bound(X11,X12))].
% 2.06/2.49 [21=axiom,[],
% 2.06/2.49 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))].
% 2.06/2.49 [22=axiom,[],
% 2.06/2.49 multiply(inverse(X10),X10) = identity].
% 2.06/2.49 [23=axiom,[],
% 2.06/2.49 multiply(identity,X10) = X10].
% 2.06/2.49 [24=axiom,[],
% 2.06/2.49 thtop(X10,X10) = thmfalse].
% 2.06/2.49 [25=axiom,[],
% 2.06/2.49 thtop(a,multiply(positive_part(a),negative_part(a))) = thmtrue].
% 2.06/2.49 [26=param(3,14),[],
% 2.06/2.49 negative_part(identity) = identity].
% 2.06/2.49 [27=param(1,4),[3,18],
% 2.06/2.49 greatest_lower_bound(X10,positive_part(X11)) = least_upper_bound(negative_part(X10),greatest_lower_bound(X10,X11))].
% 2.06/2.49 [30=param(6,5),[],
% 2.06/2.49 inverse(multiply(inverse(X10),inverse(X11))) = multiply(X11,X10)].
% 2.06/2.49 [32=param(5,6),[],
% 2.06/2.49 multiply(X10,inverse(X11)) = inverse(multiply(X11,inverse(X10)))].
% 2.06/2.49 [33=param(5,6),[],
% 2.06/2.49 multiply(inverse(X10),X11) = inverse(multiply(inverse(X11),X10))].
% 2.06/2.49 [34=param(5,7),[23],
% 2.06/2.49 inverse(multiply(X10,identity)) = inverse(X10)].
% 2.06/2.49 [36=param(22,5),[-32],
% 2.06/2.49 multiply(X10,inverse(X10)) = identity].
% 2.06/2.49 [39=param(36,8),[],
% 2.06/2.49 greatest_lower_bound(multiply(X10,inverse(greatest_lower_bound(X10,X11))),multiply(X11,inverse(greatest_lower_bound(X10,X11)))) = identity].
% 2.06/2.49 [41=param(6,34),[6],
% 2.06/2.49 multiply(X10,identity) = X10].
% 2.06/2.49 [42=param(9,4),[23,18],
% 2.06/2.49 multiply(positive_part(X10),X11) = least_upper_bound(X11,multiply(X10,X11))].
% 2.06/2.49 [43=param(9,36),[],
% 2.06/2.49 least_upper_bound(multiply(X10,inverse(least_upper_bound(X10,X11))),multiply(X11,inverse(least_upper_bound(X10,X11)))) = identity].
% 2.06/2.49 [46=param(13,3),[],
% 2.06/2.49 least_upper_bound(X10,negative_part(X10)) = X10].
% 2.06/2.49 [47=param(10,3),[41,19],
% 2.06/2.49 multiply(X10,negative_part(X11)) = greatest_lower_bound(X10,multiply(X10,X11))].
% 2.06/2.49 [51=param(19,3),[],
% 2.06/2.49 greatest_lower_bound(identity,X10) = negative_part(X10)].
% 2.06/2.49 [52=param(13,19),[],
% 2.06/2.49 least_upper_bound(X10,greatest_lower_bound(X11,X10)) = X10].
% 2.06/2.49 [53=param(11,4),[41,18],
% 2.06/2.49 multiply(X10,positive_part(X11)) = least_upper_bound(X10,multiply(X10,X11))].
% 2.06/2.49 [54=param(51,1),[51,51],
% 2.06/2.49 least_upper_bound(negative_part(X10),negative_part(X11)) = negative_part(least_upper_bound(X10,X11))].
% 2.06/2.49 [55=param(13,51),[],
% 2.06/2.49 least_upper_bound(identity,negative_part(X10)) = identity].
% 2.06/2.49 [57=param(16,4),[4],
% 2.06/2.49 least_upper_bound(X10,positive_part(X11)) = positive_part(least_upper_bound(X10,X11))].
% 2.06/2.49 [60=param(16,13),[],
% 2.06/2.49 least_upper_bound(X10,least_upper_bound(greatest_lower_bound(X10,X12),X11)) = least_upper_bound(X10,X11)].
% 2.06/2.49 [62=param(16,15),[],
% 2.06/2.49 least_upper_bound(X10,least_upper_bound(X10,X11)) = least_upper_bound(X10,X11)].
% 2.06/2.49 [69=param(18,4),[],
% 2.06/2.49 least_upper_bound(identity,X10) = positive_part(X10)].
% 2.06/2.49 [70=demod(55),[69],
% 2.06/2.49 positive_part(negative_part(X10)) = identity].
% 2.06/2.49 [73=param(18,16),[],
% 2.06/2.49 least_upper_bound(X10,least_upper_bound(X11,X12)) = least_upper_bound(X11,least_upper_bound(X12,X10))].
% 2.06/2.49 [74=param(16,18),[16],
% 2.06/2.49 least_upper_bound(X10,least_upper_bound(X11,X12)) = least_upper_bound(X11,least_upper_bound(X10,X12))].
% 2.06/2.49 [75=param(17,3),[3],
% 2.06/2.49 greatest_lower_bound(X10,negative_part(X11)) = negative_part(greatest_lower_bound(X10,X11))].
% 2.06/2.49 [76=param(17,3),[51,75],
% 2.06/2.49 greatest_lower_bound(negative_part(X10),X11) = negative_part(greatest_lower_bound(X10,X11))].
% 2.06/2.49 [78=param(17,14),[],
% 2.06/2.49 greatest_lower_bound(X10,greatest_lower_bound(X10,X11)) = greatest_lower_bound(X10,X11)].
% 2.06/2.49 [82=param(20,3),[3],
% 2.06/2.49 least_upper_bound(X10,negative_part(least_upper_bound(X10,X11))) = least_upper_bound(X10,negative_part(X11))].
% 2.06/2.49 [83=param(20,4),[51],
% 2.06/2.49 least_upper_bound(X10,greatest_lower_bound(positive_part(X10),X11)) = least_upper_bound(X10,negative_part(X11))].
% 2.06/2.49 [90=param(76,14),[75,14],
% 2.06/2.49 negative_part(negative_part(X10)) = negative_part(X10)].
% 2.06/2.49 [97=param(21,36),[23],
% 2.06/2.49 multiply(X11,multiply(inverse(X11),X10)) = X10].
% 2.06/2.49 [104=param(27,51),[26,51,69,70],
% 2.06/2.49 negative_part(positive_part(X10)) = identity].
% 2.06/2.49 [120=param(25,30),[-5,47,42,1,19,27,14,18,46,83,6],
% 2.06/2.49 thtop(a,least_upper_bound(a,negative_part(multiply(a,a)))) = thmtrue].
% 2.06/2.49 [138=param(78,19),[],
% 2.06/2.49 greatest_lower_bound(X10,greatest_lower_bound(X11,X10)) = greatest_lower_bound(X10,X11)].
% 2.06/2.49 [154=param(62,18),[],
% 2.06/2.49 least_upper_bound(X10,least_upper_bound(X11,X10)) = least_upper_bound(X10,X11)].
% 2.06/2.49 [161=param(39,19),[],
% 2.06/2.49 greatest_lower_bound(multiply(X10,inverse(greatest_lower_bound(X11,X10))),multiply(X11,inverse(greatest_lower_bound(X11,X10)))) = identity].
% 2.06/2.49 [165=param(78,39),[3,39],
% 2.06/2.49 negative_part(multiply(X10,inverse(greatest_lower_bound(X10,X11)))) = identity].
% 2.06/2.49 [166=param(138,39),[3,161],
% 2.06/2.49 negative_part(multiply(X10,inverse(greatest_lower_bound(X11,X10)))) = identity].
% 2.06/2.49 [168=param(53,22),[33,53,22,4],
% 2.06/2.49 least_upper_bound(inverse(positive_part(X10)),inverse(positive_part(inverse(X10)))) = identity].
% 2.06/2.49 [192=param(54,18),[54],
% 2.06/2.49 negative_part(least_upper_bound(X10,X11)) = negative_part(least_upper_bound(X11,X10))].
% 2.06/2.49 [194=param(54,90),[54],
% 2.06/2.49 negative_part(least_upper_bound(X10,negative_part(X11))) = negative_part(least_upper_bound(X10,X11))].
% 2.06/2.49 [197=param(46,194),[18,73,54,154],
% 2.06/2.49 least_upper_bound(X10,negative_part(least_upper_bound(X11,X10))) = least_upper_bound(X10,negative_part(X11))].
% 2.06/2.49 [207=param(62,43),[4,43],
% 2.06/2.49 positive_part(multiply(X10,inverse(least_upper_bound(X10,X11)))) = identity].
% 2.06/2.49 [219=param(53,207),[41],
% 2.06/2.49 least_upper_bound(X10,multiply(X10,multiply(X11,inverse(least_upper_bound(X11,X12))))) = X10].
% 2.06/2.49 [238=param(47,166),[41],
% 2.06/2.49 greatest_lower_bound(X10,multiply(X10,multiply(X11,inverse(greatest_lower_bound(X12,X11))))) = X10].
% 2.06/2.49 [246=param(47,165),[41],
% 2.06/2.49 greatest_lower_bound(X10,multiply(X10,multiply(X11,inverse(greatest_lower_bound(X11,X12))))) = X10].
% 2.06/2.49 [313=param(74,60),[],
% 2.06/2.49 least_upper_bound(greatest_lower_bound(X10,X11),least_upper_bound(X10,X12)) = least_upper_bound(X10,X12)].
% 2.06/2.49 [1096=param(219,97),[],
% 2.06/2.49 least_upper_bound(X10,inverse(least_upper_bound(inverse(X10),X11))) = X10].
% 2.06/2.49 [1099=param(1096,4),[],
% 2.06/2.49 least_upper_bound(X10,inverse(positive_part(inverse(X10)))) = X10].
% 2.06/2.49 [1130=param(74,1099),[],
% 2.06/2.49 least_upper_bound(X11,least_upper_bound(X10,inverse(positive_part(inverse(X11))))) = least_upper_bound(X10,X11)].
% 2.06/2.49 [1292=param(238,97),[],
% 2.06/2.49 greatest_lower_bound(X10,inverse(greatest_lower_bound(X11,inverse(X10)))) = X10].
% 2.06/2.49 [1299=param(52,1292),[18],
% 2.06/2.49 least_upper_bound(X10,inverse(greatest_lower_bound(X11,inverse(X10)))) = inverse(greatest_lower_bound(X11,inverse(X10)))].
% 2.06/2.49 [1349=param(1130,168),[4,18],
% 2.06/2.49 least_upper_bound(X10,inverse(positive_part(X10))) = positive_part(X10)].
% 2.06/2.49 [1361=param(1130,1349),[57,18],
% 2.06/2.49 positive_part(least_upper_bound(X10,inverse(X10))) = least_upper_bound(X10,inverse(X10))].
% 2.06/2.49 [1363=param(246,97),[],
% 2.06/2.49 greatest_lower_bound(X10,inverse(greatest_lower_bound(inverse(X10),X11))) = X10].
% 2.06/2.49 [1366=param(104,1361),[],
% 2.06/2.49 negative_part(least_upper_bound(X10,inverse(X10))) = identity].
% 2.06/2.49 [1374=param(54,1366),[69,70,16],
% 2.06/2.49 negative_part(least_upper_bound(X10,least_upper_bound(inverse(X10),X11))) = identity].
% 2.06/2.49 [1410=param(82,1374),[4],
% 2.06/2.49 least_upper_bound(X10,negative_part(least_upper_bound(inverse(X10),X11))) = positive_part(X10)].
% 2.06/2.49 [1412=param(1363,3),[],
% 2.06/2.49 greatest_lower_bound(X10,inverse(negative_part(inverse(X10)))) = X10].
% 2.06/2.49 [1456=param(1410,192),[],
% 2.06/2.49 least_upper_bound(X10,negative_part(least_upper_bound(X11,inverse(X10)))) = positive_part(X10)].
% 2.06/2.49 [1464=param(197,1456),[104,4,70,18,54],
% 2.06/2.49 negative_part(least_upper_bound(X10,least_upper_bound(X11,inverse(X10)))) = identity].
% 2.06/2.49 [1475=param(1464,313),[],
% 2.06/2.49 negative_part(least_upper_bound(X10,inverse(greatest_lower_bound(X10,X11)))) = identity].
% 2.06/2.49 [1488=param(1475,1299),[],
% 2.06/2.49 negative_part(inverse(greatest_lower_bound(X10,inverse(X10)))) = identity].
% 2.06/2.49 [1499=param(1412,1488),[7,3],
% 2.06/2.49 negative_part(greatest_lower_bound(X10,inverse(X10))) = greatest_lower_bound(X10,inverse(X10))].
% 2.06/2.49 [1502=param(70,1499),[],
% 2.06/2.49 positive_part(greatest_lower_bound(X10,inverse(X10))) = identity].
% 2.06/2.49 [1532=param(53,1502),[41,10],
% 2.06/2.49 least_upper_bound(X10,greatest_lower_bound(multiply(X10,X11),multiply(X10,inverse(X11)))) = X10].
% 2.06/2.49 [3160=param(1532,22),[6,6,3,6],
% 2.06/2.49 least_upper_bound(X10,negative_part(multiply(X10,X10))) = X10].
% 2.06/2.49 [3174=param(120,3160),[24],
% 2.06/2.49 thmtrue = thmfalse].
% 2.06/2.49 % SZS output end CNFRefutation
% 2.06/2.49 Space: 12376 KB
%------------------------------------------------------------------------------