%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP169-2 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n013.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:03 EDT 2022 % Result : Unsatisfiable 0.81s 1.20s % Output : CNFRefutation 0.81s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP169-2 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.07/0.13 % Command : fiesta-wrapper %s % 0.13/0.34 % Computer : n013.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 : Mon Jun 13 11:56:59 EDT 2022 % 0.13/0.35 % CPUTime : % 0.81/1.20 Theorem Proved. % 0.81/1.20 % SZS status Unsatisfiable % 0.81/1.20 % SZS output start CNFRefutation % 0.81/1.20 [1=axiom,[], % 0.81/1.20 greatest_lower_bound(inverse(a),inverse(b)) = inverse(a)]. % 0.81/1.20 [2=axiom,[], % 0.81/1.20 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))]. % 0.81/1.20 [5=axiom,[], % 0.81/1.20 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))]. % 0.81/1.20 [6=axiom,[], % 0.81/1.20 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 0.81/1.20 [7=axiom,[], % 0.81/1.20 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10]. % 0.81/1.20 [12=axiom,[], % 0.81/1.20 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 0.81/1.20 [13=axiom,[], % 0.81/1.20 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 0.81/1.20 [14=demod(1),[13], % 0.81/1.20 greatest_lower_bound(inverse(b),inverse(a)) = inverse(a)]. % 0.81/1.20 [15=axiom,[], % 0.81/1.20 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))]. % 0.81/1.20 [16=axiom,[], % 0.81/1.20 multiply(inverse(X10),X10) = identity]. % 0.81/1.20 [17=axiom,[], % 0.81/1.20 multiply(identity,X10) = X10]. % 0.81/1.20 [18=axiom,[], % 0.81/1.20 thtop(X10,X10) = thmfalse]. % 0.81/1.20 [19=axiom,[13], % 0.81/1.20 thtop(greatest_lower_bound(b,a),b) = thmtrue]. % 0.81/1.20 [28=param(2,14),[], % 0.81/1.20 greatest_lower_bound(multiply(inverse(b),X10),multiply(inverse(a),X10)) = multiply(inverse(a),X10)]. % 0.81/1.20 [55=param(15,16),[17], % 0.81/1.20 multiply(inverse(X11),multiply(X11,X10)) = X10]. % 0.81/1.20 [57=param(55,16),[], % 0.81/1.20 multiply(inverse(inverse(X10)),identity) = X10]. % 0.81/1.20 [59=param(55,55),[], % 0.81/1.20 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)]. % 0.81/1.20 [60=demod(57),[59], % 0.81/1.20 multiply(X10,identity) = X10]. % 0.81/1.20 [69=param(59,60),[60], % 0.81/1.20 inverse(inverse(X10)) = X10]. % 0.81/1.20 [85=param(28,16),[], % 0.81/1.20 greatest_lower_bound(identity,multiply(inverse(a),b)) = multiply(inverse(a),b)]. % 0.81/1.20 [180=param(7,85),[], % 0.81/1.20 least_upper_bound(identity,multiply(inverse(a),b)) = identity]. % 0.81/1.20 [186=param(5,180),[60,60], % 0.81/1.20 least_upper_bound(X10,multiply(X10,multiply(inverse(a),b))) = X10]. % 0.81/1.20 [193=param(186,55),[69,12,69], % 0.81/1.20 least_upper_bound(b,a) = a]. % 0.81/1.20 [203=param(6,193),[], % 0.81/1.20 greatest_lower_bound(b,a) = b]. % 0.81/1.20 [211=param(19,203),[18], % 0.81/1.20 thmtrue = thmfalse]. % 0.81/1.20 % SZS output end CNFRefutation % 0.81/1.20 Space: 174 KB %------------------------------------------------------------------------------