%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP175-3 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n011.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:06 EDT 2022 % Result : Unsatisfiable 0.86s 1.26s % Output : CNFRefutation 0.86s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP175-3 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.07/0.12 % Command : fiesta-wrapper %s % 0.12/0.33 % Computer : n011.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 05:46:49 EDT 2022 % 0.12/0.34 % CPUTime : % 0.86/1.26 Theorem Proved. % 0.86/1.26 % SZS status Unsatisfiable % 0.86/1.26 % SZS output start CNFRefutation % 0.86/1.26 [1=axiom,[], % 0.86/1.26 least_upper_bound(identity,b) = b]. % 0.86/1.26 [2=axiom,[], % 0.86/1.26 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))]. % 0.86/1.26 [4=axiom,[], % 0.86/1.26 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))]. % 0.86/1.26 [6=axiom,[], % 0.86/1.26 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 0.86/1.26 [12=axiom,[], % 0.86/1.26 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 0.86/1.26 [13=demod(1),[12], % 0.86/1.26 least_upper_bound(b,identity) = b]. % 0.86/1.26 [14=axiom,[], % 0.86/1.26 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 0.86/1.26 [16=axiom,[], % 0.86/1.26 multiply(inverse(X10),X10) = identity]. % 0.86/1.26 [17=axiom,[], % 0.86/1.26 multiply(identity,X10) = X10]. % 0.86/1.26 [18=axiom,[], % 0.86/1.26 thtop(X10,X10) = thmfalse]. % 0.86/1.26 [19=axiom,[], % 0.86/1.26 thtop(greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))),identity) = thmtrue]. % 0.86/1.26 [26=param(6,12),[], % 0.86/1.26 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10]. % 0.86/1.26 [28=param(26,13),[14], % 0.86/1.26 greatest_lower_bound(b,identity) = identity]. % 0.86/1.26 [40=param(2,28),[17,17,14], % 0.86/1.26 greatest_lower_bound(X10,multiply(b,X10)) = X10]. % 0.86/1.26 [43=param(4,40),[], % 0.86/1.26 greatest_lower_bound(multiply(X10,X11),multiply(X10,multiply(b,X11))) = multiply(X10,X11)]. % 0.86/1.26 [277=param(43,16),[16], % 0.86/1.26 greatest_lower_bound(identity,multiply(inverse(X10),multiply(b,X10))) = identity]. % 0.86/1.26 [1153=param(19,277),[18], % 0.86/1.26 thmtrue = thmfalse]. % 0.86/1.26 % SZS output end CNFRefutation % 0.86/1.26 Space: 1225 KB %------------------------------------------------------------------------------