%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO024-2 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 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 04:58:24 EDT 2022 % Result : Unsatisfiable 0.12s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GEO024-2 : TPTP v8.1.0. Released v1.0.0. % 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 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 : Fri Jun 17 17:11:22 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.36 % SZS status Unsatisfiable % 0.12/0.36 % SZS output begin IncompleteProof % 0.12/0.36 cnf(c0, axiom, % 0.12/0.36 ~equidistant(u,u,v,v)). % 0.12/0.36 cnf(c1, plain, % 0.12/0.36 ~equidistant(u,u,v,v), % 0.12/0.36 inference(start, [], [c0])). % 0.12/0.36 % 0.12/0.36 cnf(c2, axiom, % 0.12/0.36 equidistant(X0,extension(X1,X0,X2,X3),X2,X3)). % 0.12/0.36 cnf(a0, assumption, % 0.12/0.36 X4 = u). % 0.12/0.36 cnf(a1, assumption, % 0.12/0.36 X5 = u). % 0.12/0.36 cnf(a2, assumption, % 0.12/0.36 X6 = v). % 0.12/0.36 cnf(a3, assumption, % 0.12/0.36 X7 = v). % 0.12/0.36 cnf(c3, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(lazy_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 0.12/0.36 cnf(c4, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(lazy_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 0.12/0.36 cnf(c5, plain, % 0.12/0.36 X0 != X4 | extension(X1,X0,X2,X3) != X5 | X2 != X6 | X3 != X7, % 0.12/0.36 inference(lazy_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 0.12/0.36 % 0.12/0.36 cnf(a4, assumption, % 0.12/0.36 X0 = X4). % 0.12/0.36 cnf(c6, plain, % 0.12/0.36 extension(X1,X0,X2,X3) != X5 | X2 != X6 | X3 != X7, % 0.12/0.36 inference(reflexivity, [assumptions([a4])], [c5])). % 0.12/0.36 % 0.12/0.36 cnf(c7, axiom, % 0.12/0.36 X8 = X9 | ~equidistant(X8,X9,X10,X10)). % 0.12/0.36 cnf(a5, assumption, % 0.12/0.36 extension(X1,X0,X2,X3) = X9). % 0.12/0.36 cnf(c8, plain, % 0.12/0.36 X2 != X6 | X3 != X7, % 0.12/0.36 inference(variable_extension, [assumptions([a5])], [c6, c7])). % 0.12/0.36 cnf(c9, plain, % 0.12/0.36 ~equidistant(X8,X9,X10,X10), % 0.12/0.36 inference(variable_extension, [assumptions([a5])], [c6, c7])). % 0.12/0.36 cnf(c10, plain, % 0.12/0.36 X8 != X11 | X11 != X5, % 0.12/0.36 inference(variable_extension, [assumptions([a5])], [c6, c7])). % 0.12/0.36 % 0.12/0.36 cnf(a6, assumption, % 0.12/0.36 X8 = X11). % 0.12/0.36 cnf(c11, plain, % 0.12/0.36 X11 != X5, % 0.12/0.36 inference(reflexivity, [assumptions([a6])], [c10])). % 0.12/0.36 % 0.12/0.36 cnf(a7, assumption, % 0.12/0.36 X11 = X5). % 0.12/0.36 cnf(c12, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(reflexivity, [assumptions([a7])], [c11])). % 0.12/0.36 % 0.12/0.36 cnf(c13, plain, % 0.12/0.36 equidistant(X0,extension(X1,X0,X2,X3),X2,X3)). % 0.12/0.36 cnf(a8, assumption, % 0.12/0.36 X8 = X0). % 0.12/0.36 cnf(a9, assumption, % 0.12/0.36 X9 = extension(X1,X0,X2,X3)). % 0.12/0.36 cnf(a10, assumption, % 0.12/0.36 X10 = X2). % 0.12/0.36 cnf(a11, assumption, % 0.12/0.36 X10 = X3). % 0.12/0.36 cnf(c14, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(predicate_reduction, [assumptions([a8, a9, a10, a11])], [c9, c13])). % 0.12/0.36 % 0.12/0.36 cnf(a12, assumption, % 0.12/0.36 X2 = X6). % 0.12/0.36 cnf(c15, plain, % 0.12/0.36 X3 != X7, % 0.12/0.36 inference(reflexivity, [assumptions([a12])], [c8])). % 0.12/0.36 % 0.12/0.36 cnf(a13, assumption, % 0.12/0.36 X3 = X7). % 0.12/0.36 cnf(c16, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(reflexivity, [assumptions([a13])], [c15])). % 0.12/0.36 % 0.12/0.36 cnf(c17, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(constraint_solving, [ % 0.12/0.36 bind(X0, u), % 0.12/0.36 bind(X1, X1), % 0.12/0.36 bind(X2, v), % 0.12/0.36 bind(X3, v), % 0.12/0.36 bind(X4, u), % 0.12/0.36 bind(X5, u), % 0.12/0.36 bind(X6, v), % 0.12/0.36 bind(X7, v), % 0.12/0.36 bind(X8, u), % 0.12/0.36 bind(X9, extension(X1,X0,X2,X3)), % 0.12/0.36 bind(X10, v), % 0.12/0.36 bind(X11, u) % 0.12/0.36 ], % 0.12/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])). % 0.12/0.36 % 0.12/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------