%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP191-2 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n024.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:16 EDT 2022 % Result : Unsatisfiable 0.72s 1.16s % Output : CNFRefutation 0.72s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.14 % Problem : GRP191-2 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.13/0.15 % Command : fiesta-wrapper %s % 0.14/0.36 % Computer : n024.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Tue Jun 14 00:02:18 EDT 2022 % 0.14/0.37 % CPUTime : % 0.72/1.16 Theorem Proved. % 0.72/1.16 % SZS status Unsatisfiable % 0.72/1.16 % SZS output start CNFRefutation % 0.72/1.16 [1=axiom,[], % 0.72/1.16 greatest_lower_bound(a,b) = b]. % 0.72/1.16 [2=axiom,[], % 0.72/1.16 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))]. % 0.72/1.16 [4=axiom,[], % 0.72/1.16 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))]. % 0.72/1.16 [7=axiom,[], % 0.72/1.16 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10]. % 0.72/1.16 [12=axiom,[], % 0.72/1.16 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 0.72/1.16 [13=axiom,[], % 0.72/1.16 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 0.72/1.16 [14=demod(1),[13], % 0.72/1.16 greatest_lower_bound(b,a) = b]. % 0.72/1.16 [15=axiom,[], % 0.72/1.16 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))]. % 0.72/1.16 [16=axiom,[], % 0.72/1.16 multiply(inverse(X10),X10) = identity]. % 0.72/1.16 [17=axiom,[], % 0.72/1.16 multiply(identity,X10) = X10]. % 0.72/1.16 [18=axiom,[], % 0.72/1.16 thtop(X10,X10) = thmfalse]. % 0.72/1.16 [19=axiom,[12], % 0.72/1.16 thtop(least_upper_bound(inverse(b),inverse(a)),inverse(b)) = thmtrue]. % 0.72/1.16 [21=param(4,14),[], % 0.72/1.16 greatest_lower_bound(multiply(X10,b),multiply(X10,a)) = multiply(X10,b)]. % 0.72/1.16 [63=param(15,16),[17], % 0.72/1.16 multiply(inverse(X11),multiply(X11,X10)) = X10]. % 0.72/1.16 [68=param(63,16),[], % 0.72/1.16 multiply(inverse(inverse(X10)),identity) = X10]. % 0.72/1.16 [70=param(63,63),[], % 0.72/1.16 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)]. % 0.72/1.16 [71=demod(68),[70], % 0.72/1.16 multiply(X10,identity) = X10]. % 0.72/1.16 [75=param(21,16),[16], % 0.72/1.16 greatest_lower_bound(identity,multiply(inverse(b),a)) = identity]. % 0.72/1.16 [77=param(2,75),[17,17,15], % 0.72/1.16 greatest_lower_bound(X10,multiply(inverse(b),multiply(a,X10))) = X10]. % 0.72/1.16 [81=param(70,16),[], % 0.72/1.16 multiply(X10,inverse(X10)) = identity]. % 0.72/1.16 [512=param(77,81),[71,13], % 0.72/1.16 greatest_lower_bound(inverse(b),inverse(a)) = inverse(a)]. % 0.72/1.16 [515=param(7,512),[], % 0.72/1.16 least_upper_bound(inverse(b),inverse(a)) = inverse(b)]. % 0.72/1.16 [524=param(19,515),[18], % 0.72/1.16 thmtrue = thmfalse]. % 0.72/1.16 % SZS output end CNFRefutation % 0.72/1.16 Space: 491 KB %------------------------------------------------------------------------------