%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO238+3 : TPTP v8.1.0. Released v4.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 : n009.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 05:00:16 EDT 2022 % Result : Theorem 0.12s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : GEO238+3 : TPTP v8.1.0. Released v4.0.0. % 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n009.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:56:08 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % SZS status Theorem % 0.12/0.34 % SZS output begin IncompleteProof % 0.12/0.34 cnf(c0, axiom, % 0.12/0.34 divides_points(sK8,sK5,sK7)). % 0.12/0.34 cnf(c1, plain, % 0.12/0.34 divides_points(sK8,sK5,sK7), % 0.12/0.34 inference(start, [], [c0])). % 0.12/0.34 % 0.12/0.34 cnf(c2, axiom, % 0.12/0.34 sP1(X0,X1,X2) | ~divides_points(X0,X2,X1)). % 0.12/0.34 cnf(a0, assumption, % 0.12/0.34 sK8 = X0). % 0.12/0.34 cnf(a1, assumption, % 0.12/0.34 sK5 = X2). % 0.12/0.34 cnf(a2, assumption, % 0.12/0.34 sK7 = X1). % 0.12/0.34 cnf(c3, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.34 cnf(c4, plain, % 0.12/0.34 sP1(X0,X1,X2), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.34 % 0.12/0.34 cnf(c5, axiom, % 0.12/0.34 left_apart_point(X3,X4) | sP0(X4,X3,X5) | ~sP1(X4,X3,X5)). % 0.12/0.34 cnf(a3, assumption, % 0.12/0.34 X0 = X4). % 0.12/0.34 cnf(a4, assumption, % 0.12/0.34 X1 = X3). % 0.12/0.34 cnf(a5, assumption, % 0.12/0.34 X2 = X5). % 0.12/0.34 cnf(c6, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.12/0.34 cnf(c7, plain, % 0.12/0.34 left_apart_point(X3,X4) | sP0(X4,X3,X5), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.12/0.34 % 0.12/0.34 cnf(c8, axiom, % 0.12/0.34 ~left_apart_point(X6,X7)). % 0.12/0.34 cnf(a6, assumption, % 0.12/0.34 X3 = X6). % 0.12/0.34 cnf(a7, assumption, % 0.12/0.34 X4 = X7). % 0.12/0.34 cnf(c9, plain, % 0.12/0.34 sP0(X4,X3,X5), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c8])). % 0.12/0.34 cnf(c10, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c8])). % 0.12/0.34 % 0.12/0.34 cnf(c11, axiom, % 0.12/0.34 left_apart_point(X8,X9) | ~sP0(X9,X10,X8)). % 0.12/0.34 cnf(a8, assumption, % 0.12/0.34 X4 = X9). % 0.12/0.34 cnf(a9, assumption, % 0.12/0.34 X3 = X10). % 0.12/0.34 cnf(a10, assumption, % 0.12/0.34 X5 = X8). % 0.12/0.34 cnf(c12, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c9, c11])). % 0.12/0.34 cnf(c13, plain, % 0.12/0.34 left_apart_point(X8,X9), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c9, c11])). % 0.12/0.34 % 0.12/0.34 cnf(c14, axiom, % 0.12/0.34 ~left_apart_point(X11,X12)). % 0.12/0.34 cnf(a11, assumption, % 0.12/0.34 X8 = X11). % 0.12/0.34 cnf(a12, assumption, % 0.12/0.34 X9 = X12). % 0.12/0.34 cnf(c15, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a11, a12])], [c13, c14])). % 0.12/0.34 cnf(c16, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a11, a12])], [c13, c14])). % 0.12/0.34 % 0.12/0.34 cnf(c17, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(constraint_solving, [ % 0.12/0.34 bind(X0, sK8), % 0.12/0.34 bind(X1, sK7), % 0.12/0.34 bind(X2, sK5), % 0.12/0.34 bind(X3, sK7), % 0.12/0.34 bind(X4, sK8), % 0.12/0.34 bind(X5, sK5), % 0.12/0.34 bind(X6, sK7), % 0.12/0.34 bind(X7, sK8), % 0.12/0.34 bind(X8, sK5), % 0.12/0.34 bind(X9, sK8), % 0.12/0.34 bind(X10, sK7), % 0.12/0.34 bind(X11, sK5), % 0.12/0.34 bind(X12, sK8) % 0.12/0.34 ], % 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 0.12/0.34 % 0.12/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------