%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n019.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:17 EDT 2022 % Result : Unsatisfiable 0.44s 1.10s % Output : CNFRefutation 0.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.07/0.13 % Command : fiesta-wrapper %s % 0.13/0.34 % Computer : n019.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 09:12:24 EDT 2022 % 0.13/0.35 % CPUTime : % 0.44/1.10 Theorem Proved. % 0.44/1.10 % SZS status Unsatisfiable % 0.44/1.10 % SZS output start CNFRefutation % 0.44/1.10 [1=axiom,[], % 0.44/1.10 greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c))]. % 0.44/1.10 [2=axiom,[], % 0.44/1.10 greatest_lower_bound(a,b) = identity]. % 0.44/1.10 [3=demod(1),[2], % 0.44/1.10 greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(identity,greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c))]. % 0.44/1.10 [5=axiom,[], % 0.44/1.10 greatest_lower_bound(identity,b) = identity]. % 0.44/1.10 [7=axiom,[], % 0.44/1.10 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))]. % 0.44/1.10 [9=axiom,[], % 0.44/1.10 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))]. % 0.44/1.10 [10=demod(3),[9], % 0.44/1.10 greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(multiply(identity,a),multiply(identity,c))) = greatest_lower_bound(a,multiply(b,c))]. % 0.44/1.10 [14=axiom,[], % 0.44/1.10 greatest_lower_bound(X10,X10) = X10]. % 0.44/1.10 [17=axiom,[], % 0.44/1.10 greatest_lower_bound(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(X10,greatest_lower_bound(X11,X12))]. % 0.44/1.10 [18=demod(10),[17], % 0.44/1.10 greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(multiply(identity,a),multiply(identity,c)))) = greatest_lower_bound(a,multiply(b,c))]. % 0.44/1.10 [20=axiom,[], % 0.44/1.10 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 0.44/1.10 [22=demod(18),[20], % 0.44/1.10 greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(multiply(identity,c),multiply(identity,a)))) = greatest_lower_bound(a,multiply(b,c))]. % 0.44/1.10 [24=demod(5),[20], % 0.44/1.10 greatest_lower_bound(b,identity) = identity]. % 0.44/1.10 [28=axiom,[], % 0.44/1.10 multiply(identity,X10) = X10]. % 0.44/1.10 [29=demod(22),[28,28,20,17], % 0.44/1.10 greatest_lower_bound(a,greatest_lower_bound(c,greatest_lower_bound(a,multiply(b,c)))) = greatest_lower_bound(a,multiply(b,c))]. % 0.44/1.10 [30=axiom,[], % 0.44/1.10 thtop(X10,X10) = thmfalse]. % 0.44/1.10 [31=axiom,[20], % 0.44/1.10 thtop(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(c,a)) = thmtrue]. % 0.44/1.10 [32=param(7,24),[28,28,20], % 0.44/1.10 greatest_lower_bound(X10,multiply(b,X10)) = X10]. % 0.44/1.10 [45=param(32,9),[17], % 0.44/1.10 greatest_lower_bound(X10,greatest_lower_bound(X11,greatest_lower_bound(multiply(b,X10),multiply(b,X11)))) = greatest_lower_bound(X10,X11)]. % 0.44/1.10 [72=param(17,32),[], % 0.44/1.10 greatest_lower_bound(X10,greatest_lower_bound(multiply(b,X10),X11)) = greatest_lower_bound(X10,X11)]. % 0.44/1.10 [78=param(20,17),[], % 0.44/1.10 greatest_lower_bound(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(X11,greatest_lower_bound(X12,X10))]. % 0.44/1.10 [80=demod(29),[], % 0.44/1.10 greatest_lower_bound(a,greatest_lower_bound(c,greatest_lower_bound(a,multiply(b,c)))) = greatest_lower_bound(a,multiply(b,c))]. % 0.44/1.10 [199=param(45,20),[72], % 0.44/1.10 greatest_lower_bound(X10,greatest_lower_bound(X11,multiply(b,X10))) = greatest_lower_bound(X10,X11)]. % 0.44/1.10 [200=demod(80),[199,78,14], % 0.44/1.10 greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(c,a)]. % 0.44/1.10 [202=param(31,200),[30], % 0.44/1.10 thmtrue = thmfalse]. % 0.44/1.10 % SZS output end CNFRefutation % 0.44/1.10 Space: 156 KB %------------------------------------------------------------------------------