%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP180-2 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n006.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:08 EDT 2022 % Result : Unsatisfiable 3.32s 3.69s % Output : CNFRefutation 3.32s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GRP180-2 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.11/0.12 % Command : fiesta-wrapper %s % 0.12/0.33 % Computer : n006.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 : Tue Jun 14 04:38:26 EDT 2022 % 0.12/0.34 % CPUTime : % 3.32/3.69 Theorem Proved. % 3.32/3.69 % SZS status Unsatisfiable % 3.32/3.69 % SZS output start CNFRefutation % 3.32/3.69 [1=axiom,[], % 3.32/3.69 inverse(multiply(X10,X11)) = multiply(inverse(X11),inverse(X10))]. % 3.32/3.69 [2=axiom,[], % 3.32/3.69 inverse(inverse(X10)) = X10]. % 3.32/3.69 [3=axiom,[], % 3.32/3.69 inverse(identity) = identity]. % 3.32/3.69 [4=axiom,[], % 3.32/3.69 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))]. % 3.32/3.69 [5=axiom,[], % 3.32/3.69 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))]. % 3.32/3.69 [6=axiom,[], % 3.32/3.69 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))]. % 3.32/3.69 [7=axiom,[], % 3.32/3.69 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))]. % 3.32/3.69 [8=axiom,[], % 3.32/3.69 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 3.32/3.69 [9=axiom,[], % 3.32/3.69 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10]. % 3.32/3.69 [12=axiom,[], % 3.32/3.69 least_upper_bound(least_upper_bound(X10,X11),X12) = least_upper_bound(X10,least_upper_bound(X11,X12))]. % 3.32/3.69 [13=axiom,[], % 3.32/3.69 greatest_lower_bound(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(X10,greatest_lower_bound(X11,X12))]. % 3.32/3.69 [14=axiom,[], % 3.32/3.69 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 3.32/3.69 [15=axiom,[], % 3.32/3.69 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 3.32/3.69 [16=axiom,[], % 3.32/3.69 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))]. % 3.32/3.69 [17=axiom,[], % 3.32/3.69 multiply(inverse(X10),X10) = identity]. % 3.32/3.69 [18=axiom,[], % 3.32/3.69 multiply(identity,X10) = X10]. % 3.32/3.69 [19=axiom,[], % 3.32/3.69 thtop(X10,X10) = thmfalse]. % 3.32/3.69 [20=axiom,[15,14], % 3.32/3.69 thtop(multiply(a,multiply(inverse(greatest_lower_bound(b,a)),b)),least_upper_bound(b,a)) = thmtrue]. % 3.32/3.69 [23=param(1,3),[18], % 3.32/3.69 inverse(multiply(X10,identity)) = inverse(X10)]. % 3.32/3.69 [24=param(2,1),[], % 3.32/3.69 inverse(multiply(inverse(X10),inverse(X11))) = multiply(X11,X10)]. % 3.32/3.69 [25=param(1,2),[], % 3.32/3.69 multiply(X10,inverse(X11)) = inverse(multiply(X11,inverse(X10)))]. % 3.32/3.69 [26=param(1,2),[], % 3.32/3.69 multiply(inverse(X10),X11) = inverse(multiply(inverse(X11),X10))]. % 3.32/3.69 [28=param(17,1),[-25], % 3.32/3.69 multiply(X10,inverse(X10)) = identity]. % 3.32/3.69 [30=param(28,4),[], % 3.32/3.69 greatest_lower_bound(multiply(X10,inverse(greatest_lower_bound(X10,X11))),multiply(X11,inverse(greatest_lower_bound(X10,X11)))) = identity]. % 3.32/3.69 [33=param(2,23),[2], % 3.32/3.69 multiply(X10,identity) = X10]. % 3.32/3.69 [34=param(9,15),[], % 3.32/3.69 least_upper_bound(X10,greatest_lower_bound(X11,X10)) = X10]. % 3.32/3.69 [37=param(8,14),[], % 3.32/3.69 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10]. % 3.32/3.69 [41=param(8,12),[], % 3.32/3.69 greatest_lower_bound(least_upper_bound(X10,X11),least_upper_bound(X10,least_upper_bound(X11,X12))) = least_upper_bound(X10,X11)]. % 3.32/3.69 [54=param(13,15),[], % 3.32/3.69 greatest_lower_bound(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(X12,greatest_lower_bound(X10,X11))]. % 3.32/3.69 [63=param(16,17),[18], % 3.32/3.69 multiply(inverse(X11),multiply(X11,X10)) = X10]. % 3.32/3.69 [65=param(16,28),[18], % 3.32/3.69 multiply(X11,multiply(inverse(X11),X10)) = X10]. % 3.32/3.69 [66=param(65,1),[], % 3.32/3.69 multiply(X10,inverse(multiply(X11,X10))) = inverse(X11)]. % 3.32/3.69 [72=param(66,4),[], % 3.32/3.69 multiply(X10,inverse(greatest_lower_bound(multiply(X11,X10),multiply(X12,X10)))) = inverse(greatest_lower_bound(X11,X12))]. % 3.32/3.69 [73=param(66,5),[], % 3.32/3.69 multiply(X10,inverse(least_upper_bound(multiply(X11,X10),multiply(X12,X10)))) = inverse(least_upper_bound(X11,X12))]. % 3.32/3.69 [84=param(24,16),[], % 3.32/3.69 inverse(multiply(inverse(X10),inverse(multiply(X11,X12)))) = multiply(X11,multiply(X12,X10))]. % 3.32/3.69 [356=param(72,18),[], % 3.32/3.69 multiply(X10,inverse(greatest_lower_bound(X10,multiply(X11,X10)))) = inverse(greatest_lower_bound(identity,X11))]. % 3.32/3.69 [366=param(73,18),[], % 3.32/3.69 multiply(X10,inverse(least_upper_bound(X10,multiply(X11,X10)))) = inverse(least_upper_bound(identity,X11))]. % 3.32/3.69 [367=param(366,17),[], % 3.32/3.69 multiply(X10,inverse(least_upper_bound(X10,identity))) = inverse(least_upper_bound(identity,inverse(X10)))]. % 3.32/3.69 [378=param(356,17),[], % 3.32/3.69 multiply(X10,inverse(greatest_lower_bound(X10,identity))) = inverse(greatest_lower_bound(identity,inverse(X10)))]. % 3.32/3.69 [387=param(30,378),[18], % 3.32/3.69 greatest_lower_bound(inverse(greatest_lower_bound(identity,inverse(X10))),inverse(greatest_lower_bound(X10,identity))) = identity]. % 3.32/3.70 [396=param(34,387),[14], % 3.32/3.70 least_upper_bound(identity,inverse(greatest_lower_bound(X10,identity))) = inverse(greatest_lower_bound(X10,identity))]. % 3.32/3.70 [404=param(8,396),[], % 3.32/3.70 greatest_lower_bound(identity,inverse(greatest_lower_bound(X10,identity))) = identity]. % 3.32/3.70 [405=param(41,396),[], % 3.32/3.70 greatest_lower_bound(least_upper_bound(X10,identity),least_upper_bound(X10,inverse(greatest_lower_bound(X11,identity)))) = least_upper_bound(X10,identity)]. % 3.32/3.70 [413=param(6,404),[33,33], % 3.32/3.70 greatest_lower_bound(X10,multiply(X10,inverse(greatest_lower_bound(X11,identity)))) = X10]. % 3.32/3.70 [421=param(413,378),[], % 3.32/3.70 greatest_lower_bound(X10,inverse(greatest_lower_bound(identity,inverse(X10)))) = X10]. % 3.32/3.70 [422=param(63,84),[], % 3.32/3.70 multiply(inverse(X10),inverse(multiply(inverse(X11),inverse(multiply(X10,X12))))) = multiply(X12,X11)]. % 3.32/3.70 [424=param(421,2),[], % 3.32/3.70 greatest_lower_bound(inverse(X10),inverse(greatest_lower_bound(identity,X10))) = inverse(X10)]. % 3.32/3.70 [441=param(424,37),[3,15], % 3.32/3.70 greatest_lower_bound(identity,inverse(least_upper_bound(X10,identity))) = inverse(least_upper_bound(X10,identity))]. % 3.32/3.70 [449=param(9,441),[], % 3.32/3.70 least_upper_bound(identity,inverse(least_upper_bound(X10,identity))) = identity]. % 3.32/3.70 [458=param(7,449),[33,33], % 3.32/3.70 least_upper_bound(X10,multiply(X10,inverse(least_upper_bound(X11,identity)))) = X10]. % 3.32/3.70 [513=param(458,367),[], % 3.32/3.70 least_upper_bound(X10,inverse(least_upper_bound(identity,inverse(X10)))) = X10]. % 3.32/3.70 [516=param(513,2),[], % 3.32/3.70 least_upper_bound(inverse(X10),inverse(least_upper_bound(identity,X10))) = inverse(X10)]. % 3.32/3.70 [532=param(516,9),[3,14], % 3.32/3.70 least_upper_bound(identity,inverse(greatest_lower_bound(identity,X10))) = inverse(greatest_lower_bound(identity,X10))]. % 3.32/3.70 [548=param(8,532),[], % 3.32/3.70 greatest_lower_bound(identity,inverse(greatest_lower_bound(identity,X10))) = identity]. % 3.32/3.70 [559=param(4,548),[18,18], % 3.32/3.70 greatest_lower_bound(X10,multiply(inverse(greatest_lower_bound(identity,X11)),X10)) = X10]. % 3.32/3.70 [581=param(559,1),[6,33], % 3.32/3.70 greatest_lower_bound(inverse(X10),inverse(greatest_lower_bound(X10,multiply(X10,X11)))) = inverse(X10)]. % 3.32/3.70 [822=param(581,63),[2,2], % 3.32/3.70 greatest_lower_bound(X10,inverse(greatest_lower_bound(inverse(X10),X11))) = X10]. % 3.32/3.70 [835=param(822,15),[], % 3.32/3.70 greatest_lower_bound(X10,inverse(greatest_lower_bound(X11,inverse(X10)))) = X10]. % 3.32/3.70 [836=param(34,822),[14], % 3.32/3.70 least_upper_bound(X10,inverse(greatest_lower_bound(inverse(X10),X11))) = inverse(greatest_lower_bound(inverse(X10),X11))]. % 3.32/3.70 [850=param(835,2),[], % 3.32/3.70 greatest_lower_bound(inverse(X10),inverse(greatest_lower_bound(X11,X10))) = inverse(X10)]. % 3.32/3.70 [874=param(850,8),[15], % 3.32/3.70 greatest_lower_bound(inverse(X10),inverse(least_upper_bound(X10,X11))) = inverse(least_upper_bound(X10,X11))]. % 3.32/3.70 [2845=param(405,836),[15], % 3.32/3.70 greatest_lower_bound(least_upper_bound(X10,identity),inverse(greatest_lower_bound(identity,inverse(X10)))) = least_upper_bound(X10,identity)]. % 3.32/3.70 [2848=param(835,2845),[15,54,15,441,874], % 3.32/3.70 greatest_lower_bound(identity,inverse(X10)) = inverse(least_upper_bound(X10,identity))]. % 3.32/3.70 [2873=param(2848,2),[14], % 3.32/3.70 greatest_lower_bound(identity,X10) = inverse(least_upper_bound(identity,inverse(X10)))]. % 3.32/3.70 [3320=param(20,422),[26,6,17,2873,2,422,7,33,66,2,14,19], % 3.32/3.70 thmtrue = thmfalse]. % 3.32/3.70 % SZS output end CNFRefutation % 3.32/3.70 Space: 17437 KB %------------------------------------------------------------------------------