%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO016-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 : n014.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:20 EDT 2022 % Result : Unsatisfiable 0.14s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GEO016-2 : TPTP v8.1.0. Released v1.0.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.34 % Computer : n014.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Sat Jun 18 14:42:19 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.35 % SZS status Unsatisfiable % 0.14/0.35 % SZS output begin IncompleteProof % 0.14/0.35 cnf(c0, axiom, % 0.14/0.35 ~equidistant(v,u,w,x)). % 0.14/0.35 cnf(c1, plain, % 0.14/0.35 ~equidistant(v,u,w,x), % 0.14/0.35 inference(start, [], [c0])). % 0.14/0.35 % 0.14/0.35 cnf(c2, axiom, % 0.14/0.35 equidistant(X0,X1,X2,X3) | ~equidistant(X4,X5,X2,X3) | ~equidistant(X4,X5,X0,X1)). % 0.14/0.35 cnf(a0, assumption, % 0.14/0.35 v = X0). % 0.14/0.35 cnf(a1, assumption, % 0.14/0.35 u = X1). % 0.14/0.35 cnf(a2, assumption, % 0.14/0.35 w = X2). % 0.14/0.35 cnf(a3, assumption, % 0.14/0.35 x = X3). % 0.14/0.35 cnf(c3, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 0.14/0.35 cnf(c4, plain, % 0.14/0.35 ~equidistant(X4,X5,X2,X3) | ~equidistant(X4,X5,X0,X1), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 0.14/0.35 % 0.14/0.35 cnf(c5, axiom, % 0.14/0.35 equidistant(u,v,w,x)). % 0.14/0.35 cnf(a4, assumption, % 0.14/0.35 X4 = u). % 0.14/0.35 cnf(a5, assumption, % 0.14/0.35 X5 = v). % 0.14/0.35 cnf(a6, assumption, % 0.14/0.35 X2 = w). % 0.14/0.35 cnf(a7, assumption, % 0.14/0.35 X3 = x). % 0.14/0.35 cnf(c6, plain, % 0.14/0.35 ~equidistant(X4,X5,X0,X1), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a4, a5, a6, a7])], [c4, c5])). % 0.14/0.35 cnf(c7, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a4, a5, a6, a7])], [c4, c5])). % 0.14/0.35 % 0.14/0.35 cnf(c8, axiom, % 0.14/0.35 equidistant(X6,X7,X7,X6)). % 0.14/0.35 cnf(a8, assumption, % 0.14/0.35 X4 = X6). % 0.14/0.35 cnf(a9, assumption, % 0.14/0.35 X5 = X7). % 0.14/0.35 cnf(a10, assumption, % 0.14/0.35 X0 = X7). % 0.14/0.35 cnf(a11, assumption, % 0.14/0.35 X1 = X6). % 0.14/0.35 cnf(c9, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a8, a9, a10, a11])], [c6, c8])). % 0.14/0.35 cnf(c10, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a8, a9, a10, a11])], [c6, c8])). % 0.14/0.35 % 0.14/0.35 cnf(c11, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(constraint_solving, [ % 0.14/0.35 bind(X0, v), % 0.14/0.35 bind(X1, u), % 0.14/0.35 bind(X2, w), % 0.14/0.35 bind(X3, x), % 0.14/0.35 bind(X4, u), % 0.14/0.35 bind(X5, v), % 0.14/0.35 bind(X6, u), % 0.14/0.35 bind(X7, v) % 0.14/0.35 ], % 0.14/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.14/0.35 % 0.14/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------