%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP138-1 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n027.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:12:52 EDT 2022 % Result : Unsatisfiable 0.75s 1.10s % Output : CNFRefutation 0.75s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : GRP138-1 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.06/0.12 % Command : fiesta-wrapper %s % 0.13/0.34 % Computer : n027.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 20:57:02 EDT 2022 % 0.13/0.34 % CPUTime : % 0.75/1.10 Theorem Proved. % 0.75/1.10 % SZS status Unsatisfiable % 0.75/1.10 % SZS output start CNFRefutation % 0.75/1.10 [1=axiom,[], % 0.75/1.10 least_upper_bound(b,c) = b]. % 0.75/1.10 [2=axiom,[], % 0.75/1.10 least_upper_bound(a,c) = a]. % 0.75/1.10 [7=axiom,[], % 0.75/1.10 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 0.75/1.10 [8=axiom,[], % 0.75/1.10 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10]. % 0.75/1.10 [12=axiom,[], % 0.75/1.10 greatest_lower_bound(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(X10,greatest_lower_bound(X11,X12))]. % 0.75/1.10 [13=axiom,[], % 0.75/1.10 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 0.75/1.10 [14=demod(2),[13], % 0.75/1.10 least_upper_bound(c,a) = a]. % 0.75/1.10 [15=axiom,[], % 0.75/1.10 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 0.75/1.10 [19=axiom,[], % 0.75/1.10 thtop(X10,X10) = thmfalse]. % 0.75/1.10 [20=axiom,[15,13,15], % 0.75/1.10 thtop(least_upper_bound(c,greatest_lower_bound(b,a)),greatest_lower_bound(b,a)) = thmtrue]. % 0.75/1.10 [21=param(7,14),[], % 0.75/1.10 greatest_lower_bound(c,a) = c]. % 0.75/1.10 [29=param(7,13),[], % 0.75/1.10 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10]. % 0.75/1.10 [33=param(29,1),[15], % 0.75/1.10 greatest_lower_bound(b,c) = c]. % 0.75/1.10 [56=param(8,12),[], % 0.75/1.10 least_upper_bound(greatest_lower_bound(X10,X11),greatest_lower_bound(X10,greatest_lower_bound(X11,X12))) = greatest_lower_bound(X10,X11)]. % 0.75/1.10 [63=param(12,33),[], % 0.75/1.10 greatest_lower_bound(b,greatest_lower_bound(c,X10)) = greatest_lower_bound(c,X10)]. % 0.75/1.10 [120=param(8,63),[], % 0.75/1.10 least_upper_bound(b,greatest_lower_bound(c,X10)) = b]. % 0.75/1.10 [126=param(120,15),[], % 0.75/1.10 least_upper_bound(b,greatest_lower_bound(X10,c)) = b]. % 0.75/1.10 [131=param(29,126),[15], % 0.75/1.10 greatest_lower_bound(b,greatest_lower_bound(X10,c)) = greatest_lower_bound(X10,c)]. % 0.75/1.10 [391=param(56,131),[], % 0.75/1.10 least_upper_bound(greatest_lower_bound(b,X10),greatest_lower_bound(X10,c)) = greatest_lower_bound(b,X10)]. % 0.75/1.10 [397=param(391,15),[], % 0.75/1.10 least_upper_bound(greatest_lower_bound(b,X10),greatest_lower_bound(c,X10)) = greatest_lower_bound(b,X10)]. % 0.75/1.10 [403=param(397,21),[13], % 0.75/1.10 least_upper_bound(c,greatest_lower_bound(b,a)) = greatest_lower_bound(b,a)]. % 0.75/1.10 [431=param(20,403),[19], % 0.75/1.10 thmtrue = thmfalse]. % 0.75/1.10 % SZS output end CNFRefutation % 0.75/1.10 Space: 353 KB %------------------------------------------------------------------------------