%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP180-1 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n012.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.23s 3.59s % Output : CNFRefutation 3.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : GRP180-1 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.12/0.13 % Command : fiesta-wrapper %s % 0.13/0.34 % Computer : n012.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue Jun 14 14:01:25 EDT 2022 % 0.13/0.34 % CPUTime : % 3.23/3.59 Theorem Proved. % 3.23/3.59 % SZS status Unsatisfiable % 3.23/3.59 % SZS output start CNFRefutation % 3.23/3.59 [2=axiom,[], % 3.23/3.59 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))]. % 3.23/3.59 [3=axiom,[], % 3.23/3.59 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))]. % 3.23/3.59 [4=axiom,[], % 3.23/3.59 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))]. % 3.23/3.59 [5=axiom,[], % 3.23/3.59 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 3.23/3.59 [6=axiom,[], % 3.23/3.59 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10]. % 3.23/3.59 [9=axiom,[], % 3.23/3.59 least_upper_bound(least_upper_bound(X10,X11),X12) = least_upper_bound(X10,least_upper_bound(X11,X12))]. % 3.23/3.59 [10=axiom,[], % 3.23/3.59 greatest_lower_bound(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(X10,greatest_lower_bound(X11,X12))]. % 3.23/3.59 [11=axiom,[], % 3.23/3.59 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 3.23/3.59 [12=axiom,[], % 3.23/3.59 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 3.23/3.59 [13=axiom,[], % 3.23/3.59 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))]. % 3.23/3.59 [14=axiom,[], % 3.23/3.59 multiply(inverse(X10),X10) = identity]. % 3.23/3.59 [15=axiom,[], % 3.23/3.59 multiply(identity,X10) = X10]. % 3.23/3.59 [16=axiom,[], % 3.23/3.59 thtop(X10,X10) = thmfalse]. % 3.23/3.59 [17=axiom,[12,11], % 3.23/3.59 thtop(multiply(a,multiply(inverse(greatest_lower_bound(b,a)),b)),least_upper_bound(b,a)) = thmtrue]. % 3.23/3.59 [18=param(6,12),[], % 3.23/3.59 least_upper_bound(X10,greatest_lower_bound(X11,X10)) = X10]. % 3.23/3.59 [21=param(5,11),[], % 3.23/3.59 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10]. % 3.23/3.59 [22=param(4,14),[], % 3.23/3.59 least_upper_bound(multiply(inverse(least_upper_bound(X10,X11)),X10),multiply(inverse(least_upper_bound(X10,X11)),X11)) = identity]. % 3.23/3.59 [38=param(6,10),[], % 3.23/3.59 least_upper_bound(greatest_lower_bound(X10,X11),greatest_lower_bound(X10,greatest_lower_bound(X11,X12))) = greatest_lower_bound(X10,X11)]. % 3.23/3.59 [53=param(13,14),[15], % 3.23/3.59 multiply(inverse(X11),multiply(X11,X10)) = X10]. % 3.23/3.59 [55=param(53,14),[], % 3.23/3.59 multiply(inverse(inverse(X10)),identity) = X10]. % 3.23/3.59 [57=param(53,53),[], % 3.23/3.59 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)]. % 3.23/3.59 [58=demod(55),[57], % 3.23/3.59 multiply(X10,identity) = X10]. % 3.23/3.59 [59=param(58,14),[], % 3.23/3.59 inverse(identity) = identity]. % 3.23/3.59 [65=param(57,14),[], % 3.23/3.59 multiply(X10,inverse(X10)) = identity]. % 3.23/3.59 [67=param(57,58),[58], % 3.23/3.59 inverse(inverse(X10)) = X10]. % 3.23/3.59 [71=param(22,58),[], % 3.23/3.59 least_upper_bound(inverse(least_upper_bound(identity,X10)),multiply(inverse(least_upper_bound(identity,X10)),X10)) = identity]. % 3.23/3.59 [75=param(65,13),[], % 3.23/3.59 multiply(X10,multiply(X11,inverse(multiply(X10,X11)))) = identity]. % 3.23/3.59 [129=param(53,75),[58], % 3.23/3.59 multiply(X11,inverse(multiply(X10,X11))) = inverse(X10)]. % 3.23/3.59 [136=param(53,129),[], % 3.23/3.59 multiply(inverse(X10),inverse(X11)) = inverse(multiply(X11,X10))]. % 3.23/3.59 [157=param(136,67),[], % 3.23/3.59 multiply(inverse(X10),X11) = inverse(multiply(inverse(X11),X10))]. % 3.23/3.59 [163=demod(71),[157,4,58,14,11], % 3.23/3.59 least_upper_bound(inverse(least_upper_bound(identity,X10)),inverse(least_upper_bound(identity,inverse(X10)))) = identity]. % 3.23/3.59 [167=param(67,136),[], % 3.23/3.59 inverse(multiply(inverse(X10),inverse(X11))) = multiply(X11,X10)]. % 3.23/3.59 [173=param(17,167),[67,3,14], % 3.23/3.59 thtop(multiply(a,inverse(greatest_lower_bound(identity,multiply(inverse(b),a)))),least_upper_bound(b,a)) = thmtrue]. % 3.23/3.59 [390=param(5,163),[12], % 3.23/3.59 greatest_lower_bound(identity,inverse(least_upper_bound(identity,X10))) = inverse(least_upper_bound(identity,X10))]. % 3.23/3.59 [398=param(6,390),[], % 3.23/3.59 least_upper_bound(identity,inverse(least_upper_bound(identity,X10))) = identity]. % 3.23/3.59 [405=param(38,390),[], % 3.23/3.59 least_upper_bound(greatest_lower_bound(X10,identity),greatest_lower_bound(X10,inverse(least_upper_bound(identity,X11)))) = greatest_lower_bound(X10,identity)]. % 3.23/3.59 [416=param(398,11),[], % 3.23/3.59 least_upper_bound(identity,inverse(least_upper_bound(X10,identity))) = identity]. % 3.23/3.59 [421=param(2,416),[15,15], % 3.23/3.59 least_upper_bound(X10,multiply(inverse(least_upper_bound(X11,identity)),X10)) = X10]. % 3.23/3.59 [465=param(421,157),[4,58,11], % 3.23/3.59 least_upper_bound(X10,inverse(least_upper_bound(inverse(X10),multiply(inverse(X10),X11)))) = X10]. % 3.23/3.59 [559=param(465,53),[], % 3.23/3.59 least_upper_bound(X10,inverse(least_upper_bound(inverse(X10),X11))) = X10]. % 3.23/3.59 [564=param(559,11),[], % 3.23/3.59 least_upper_bound(X10,inverse(least_upper_bound(X11,inverse(X10)))) = X10]. % 3.23/3.59 [587=param(21,564),[12], % 3.23/3.59 greatest_lower_bound(X10,inverse(least_upper_bound(X11,inverse(X10)))) = inverse(least_upper_bound(X11,inverse(X10)))]. % 3.23/3.59 [593=param(564,67),[], % 3.23/3.59 least_upper_bound(inverse(X10),inverse(least_upper_bound(X11,X10))) = inverse(X10)]. % 3.23/3.59 [601=param(593,6),[11], % 3.23/3.59 least_upper_bound(inverse(X10),inverse(greatest_lower_bound(X10,X11))) = inverse(greatest_lower_bound(X10,X11))]. % 3.23/3.59 [604=param(593,18),[11], % 3.23/3.59 least_upper_bound(inverse(X10),inverse(greatest_lower_bound(X11,X10))) = inverse(greatest_lower_bound(X11,X10))]. % 3.23/3.59 [623=param(604,59),[], % 3.23/3.59 least_upper_bound(identity,inverse(greatest_lower_bound(X10,identity))) = inverse(greatest_lower_bound(X10,identity))]. % 3.23/3.59 [2766=param(405,587),[11], % 3.23/3.59 least_upper_bound(inverse(least_upper_bound(identity,inverse(X10))),greatest_lower_bound(X10,identity)) = greatest_lower_bound(X10,identity)]. % 3.23/3.59 [2770=param(559,2766),[9,601,623], % 3.23/3.59 inverse(greatest_lower_bound(X10,identity)) = least_upper_bound(identity,inverse(X10))]. % 3.23/3.59 [2828=param(67,2770),[], % 3.23/3.59 greatest_lower_bound(X10,identity) = inverse(least_upper_bound(identity,inverse(X10)))]. % 3.23/3.59 [2906=param(2828,12),[], % 3.23/3.59 greatest_lower_bound(identity,X10) = inverse(least_upper_bound(identity,inverse(X10)))]. % 3.23/3.59 [3169=param(173,2906),[67,4,58,129,67,11,16], % 3.23/3.59 thmtrue = thmfalse]. % 3.23/3.59 % SZS output end CNFRefutation % 3.23/3.59 Space: 17003 KB %------------------------------------------------------------------------------