%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP186-2 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n004.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:13 EDT 2022 % Result : Unsatisfiable 4.23s 4.61s % Output : CNFRefutation 4.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : GRP186-2 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.07/0.14 % Command : fiesta-wrapper %s % 0.13/0.36 % Computer : n004.cluster.edu % 0.13/0.36 % Model : x86_64 x86_64 % 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.36 % Memory : 8042.1875MB % 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.36 % CPULimit : 300 % 0.13/0.36 % WCLimit : 600 % 0.13/0.36 % DateTime : Mon Jun 13 18:47:54 EDT 2022 % 0.13/0.36 % CPUTime : % 4.23/4.61 Theorem Proved. % 4.23/4.61 % SZS status Unsatisfiable % 4.23/4.61 % SZS output start CNFRefutation % 4.23/4.61 [1=axiom,[], % 4.23/4.61 inverse(multiply(X10,X11)) = multiply(inverse(X11),inverse(X10))]. % 4.23/4.61 [2=axiom,[], % 4.23/4.61 inverse(inverse(X10)) = X10]. % 4.23/4.61 [3=axiom,[], % 4.23/4.61 inverse(identity) = identity]. % 4.23/4.61 [4=axiom,[], % 4.23/4.61 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))]. % 4.23/4.61 [5=axiom,[], % 4.23/4.61 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))]. % 4.23/4.61 [6=axiom,[], % 4.23/4.61 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))]. % 4.23/4.61 [7=axiom,[], % 4.23/4.61 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))]. % 4.23/4.61 [8=axiom,[], % 4.23/4.61 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 4.23/4.61 [9=axiom,[], % 4.23/4.61 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10]. % 4.23/4.61 [12=axiom,[], % 4.23/4.61 least_upper_bound(least_upper_bound(X10,X11),X12) = least_upper_bound(X10,least_upper_bound(X11,X12))]. % 4.23/4.61 [13=axiom,[], % 4.23/4.61 greatest_lower_bound(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(X10,greatest_lower_bound(X11,X12))]. % 4.23/4.61 [14=axiom,[], % 4.23/4.61 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 4.23/4.61 [15=axiom,[], % 4.23/4.61 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 4.23/4.61 [16=axiom,[], % 4.23/4.61 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))]. % 4.23/4.61 [17=axiom,[], % 4.23/4.61 multiply(inverse(X10),X10) = identity]. % 4.23/4.61 [18=axiom,[], % 4.23/4.61 multiply(identity,X10) = X10]. % 4.23/4.61 [19=axiom,[], % 4.23/4.61 thtop(X10,X10) = thmfalse]. % 4.23/4.61 [20=axiom,[14], % 4.23/4.61 thtop(least_upper_bound(identity,multiply(a,b)),multiply(a,inverse(greatest_lower_bound(a,inverse(b))))) = thmtrue]. % 4.23/4.61 [23=param(1,3),[18], % 4.23/4.61 inverse(multiply(X10,identity)) = inverse(X10)]. % 4.23/4.61 [24=param(2,1),[], % 4.23/4.61 inverse(multiply(inverse(X10),inverse(X11))) = multiply(X11,X10)]. % 4.23/4.61 [25=param(1,2),[], % 4.23/4.61 multiply(X10,inverse(X11)) = inverse(multiply(X11,inverse(X10)))]. % 4.23/4.61 [28=param(17,1),[-25], % 4.23/4.61 multiply(X10,inverse(X10)) = identity]. % 4.23/4.61 [30=param(28,4),[], % 4.23/4.61 greatest_lower_bound(multiply(X10,inverse(greatest_lower_bound(X10,X11))),multiply(X11,inverse(greatest_lower_bound(X10,X11)))) = identity]. % 4.23/4.61 [31=param(5,28),[], % 4.23/4.61 least_upper_bound(multiply(X10,inverse(least_upper_bound(X10,X11))),multiply(X11,inverse(least_upper_bound(X10,X11)))) = identity]. % 4.23/4.61 [33=param(2,23),[2], % 4.23/4.61 multiply(X10,identity) = X10]. % 4.23/4.61 [34=param(9,15),[], % 4.23/4.61 least_upper_bound(X10,greatest_lower_bound(X11,X10)) = X10]. % 4.23/4.61 [36=param(8,12),[], % 4.23/4.61 greatest_lower_bound(least_upper_bound(X10,X11),least_upper_bound(X10,least_upper_bound(X11,X12))) = least_upper_bound(X10,X11)]. % 4.23/4.61 [42=param(8,14),[], % 4.23/4.61 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10]. % 4.23/4.61 [48=param(34,42),[14], % 4.23/4.61 least_upper_bound(X10,least_upper_bound(X11,X10)) = least_upper_bound(X11,X10)]. % 4.23/4.61 [52=param(13,15),[], % 4.23/4.61 greatest_lower_bound(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(X12,greatest_lower_bound(X10,X11))]. % 4.23/4.61 [64=param(16,17),[18], % 4.23/4.61 multiply(inverse(X11),multiply(X11,X10)) = X10]. % 4.23/4.61 [66=param(16,28),[18], % 4.23/4.61 multiply(X11,multiply(inverse(X11),X10)) = X10]. % 4.23/4.61 [67=param(66,1),[], % 4.23/4.61 multiply(X10,inverse(multiply(X11,X10))) = inverse(X11)]. % 4.23/4.61 [76=param(20,24),[2,4,28,-1], % 4.23/4.61 thtop(least_upper_bound(identity,multiply(a,b)),inverse(greatest_lower_bound(identity,inverse(multiply(a,b))))) = thmtrue]. % 4.23/4.61 [77=param(67,4),[], % 4.23/4.61 multiply(X10,inverse(greatest_lower_bound(multiply(X11,X10),multiply(X12,X10)))) = inverse(greatest_lower_bound(X11,X12))]. % 4.23/4.61 [134=param(48,31),[14,31], % 4.23/4.61 least_upper_bound(identity,multiply(X10,inverse(least_upper_bound(X11,X10)))) = identity]. % 4.23/4.61 [136=param(7,134),[33,33], % 4.23/4.61 least_upper_bound(X10,multiply(X10,multiply(X11,inverse(least_upper_bound(X12,X11))))) = X10]. % 4.23/4.61 [370=param(77,18),[], % 4.23/4.61 multiply(X10,inverse(greatest_lower_bound(X10,multiply(X11,X10)))) = inverse(greatest_lower_bound(identity,X11))]. % 4.23/4.61 [392=param(370,17),[], % 4.23/4.61 multiply(X10,inverse(greatest_lower_bound(X10,identity))) = inverse(greatest_lower_bound(identity,inverse(X10)))]. % 4.23/4.61 [401=param(30,392),[18], % 4.23/4.61 greatest_lower_bound(inverse(greatest_lower_bound(identity,inverse(X10))),inverse(greatest_lower_bound(X10,identity))) = identity]. % 4.23/4.61 [410=param(34,401),[14], % 4.23/4.61 least_upper_bound(identity,inverse(greatest_lower_bound(X10,identity))) = inverse(greatest_lower_bound(X10,identity))]. % 4.23/4.61 [418=param(8,410),[], % 4.23/4.61 greatest_lower_bound(identity,inverse(greatest_lower_bound(X10,identity))) = identity]. % 4.23/4.61 [420=param(36,410),[], % 4.23/4.61 greatest_lower_bound(least_upper_bound(X10,identity),least_upper_bound(X10,inverse(greatest_lower_bound(X11,identity)))) = least_upper_bound(X10,identity)]. % 4.23/4.61 [428=param(6,418),[33,33], % 4.23/4.61 greatest_lower_bound(X10,multiply(X10,inverse(greatest_lower_bound(X11,identity)))) = X10]. % 4.23/4.61 [436=param(428,392),[], % 4.23/4.61 greatest_lower_bound(X10,inverse(greatest_lower_bound(identity,inverse(X10)))) = X10]. % 4.23/4.61 [437=param(436,2),[], % 4.23/4.61 greatest_lower_bound(inverse(X10),inverse(greatest_lower_bound(identity,X10))) = inverse(X10)]. % 4.23/4.61 [454=param(437,42),[3,15], % 4.23/4.61 greatest_lower_bound(identity,inverse(least_upper_bound(X10,identity))) = inverse(least_upper_bound(X10,identity))]. % 4.23/4.61 [818=param(136,64),[], % 4.23/4.61 least_upper_bound(inverse(X10),inverse(least_upper_bound(X11,X10))) = inverse(X10)]. % 4.23/4.61 [819=param(136,66),[], % 4.23/4.61 least_upper_bound(X10,inverse(least_upper_bound(X11,inverse(X10)))) = X10]. % 4.23/4.61 [829=param(819,14),[], % 4.23/4.61 least_upper_bound(X10,inverse(least_upper_bound(inverse(X10),X11))) = X10]. % 4.23/4.61 [848=param(829,2),[], % 4.23/4.61 least_upper_bound(inverse(X10),inverse(least_upper_bound(X10,X11))) = inverse(X10)]. % 4.23/4.61 [876=param(42,848),[15], % 4.23/4.61 greatest_lower_bound(inverse(X10),inverse(least_upper_bound(X10,X11))) = inverse(least_upper_bound(X10,X11))]. % 4.23/4.61 [892=param(42,818),[15], % 4.23/4.61 greatest_lower_bound(inverse(X10),inverse(least_upper_bound(X11,X10))) = inverse(least_upper_bound(X11,X10))]. % 4.23/4.61 [923=param(892,34),[15,34], % 4.23/4.61 greatest_lower_bound(inverse(X10),inverse(greatest_lower_bound(X11,X10))) = inverse(X10)]. % 4.23/4.61 [940=param(923,2),[2], % 4.23/4.61 greatest_lower_bound(X10,inverse(greatest_lower_bound(X11,inverse(X10)))) = X10]. % 4.23/4.61 [950=param(940,15),[], % 4.23/4.61 greatest_lower_bound(X10,inverse(greatest_lower_bound(inverse(X10),X11))) = X10]. % 4.23/4.61 [967=param(34,950),[14], % 4.23/4.61 least_upper_bound(X10,inverse(greatest_lower_bound(inverse(X10),X11))) = inverse(greatest_lower_bound(inverse(X10),X11))]. % 4.23/4.61 [3014=param(420,967),[15], % 4.23/4.61 greatest_lower_bound(least_upper_bound(X10,identity),inverse(greatest_lower_bound(identity,inverse(X10)))) = least_upper_bound(X10,identity)]. % 4.23/4.61 [3017=param(923,3014),[2,15,52,15,454,876,2], % 4.23/4.61 greatest_lower_bound(identity,inverse(X10)) = inverse(least_upper_bound(X10,identity))]. % 4.23/4.61 [3043=param(3017,2),[14], % 4.23/4.61 greatest_lower_bound(identity,X10) = inverse(least_upper_bound(identity,inverse(X10)))]. % 4.23/4.61 [3557=param(76,3043),[2,2,19], % 4.23/4.61 thmtrue = thmfalse]. % 4.23/4.61 % SZS output end CNFRefutation % 4.23/4.61 Space: 17161 KB %------------------------------------------------------------------------------