%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO117+1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n008.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:59:08 EDT 2022 % Result : Theorem 0.19s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GEO117+1 : TPTP v8.1.0. Released v2.4.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n008.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 : Sat Jun 18 14:57:22 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.35 % SZS status Theorem % 0.19/0.35 % SZS output begin IncompleteProof % 0.19/0.35 cnf(c0, axiom, % 0.19/0.35 ordered_by(sK35,sK36,sK36)). % 0.19/0.35 cnf(c1, plain, % 0.19/0.35 ordered_by(sK35,sK36,sK36), % 0.19/0.35 inference(start, [], [c0])). % 0.19/0.35 % 0.19/0.35 cnf(c2, axiom, % 0.19/0.35 sP5(X0,X1,X2,X3) | ~ordered_by(X2,X1,X0) | ~ordered_by(X2,X3,X1)). % 0.19/0.35 cnf(a0, assumption, % 0.19/0.35 sK35 = X2). % 0.19/0.35 cnf(a1, assumption, % 0.19/0.35 sK36 = X1). % 0.19/0.35 cnf(a2, assumption, % 0.19/0.35 sK36 = X0). % 0.19/0.35 cnf(c3, plain, % 0.19/0.35 $false, % 0.19/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.19/0.35 cnf(c4, plain, % 0.19/0.35 sP5(X0,X1,X2,X3) | ~ordered_by(X2,X3,X1), % 0.19/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.19/0.35 % 0.19/0.35 cnf(c5, axiom, % 0.19/0.35 between_o(X4,X5,X6,X7) | ~sP5(X5,X6,X4,X7)). % 0.19/0.35 cnf(a3, assumption, % 0.19/0.35 X0 = X5). % 0.19/0.35 cnf(a4, assumption, % 0.19/0.35 X1 = X6). % 0.19/0.35 cnf(a5, assumption, % 0.19/0.35 X2 = X4). % 0.19/0.35 cnf(a6, assumption, % 0.19/0.35 X3 = X7). % 0.19/0.35 cnf(c6, plain, % 0.19/0.35 ~ordered_by(X2,X3,X1), % 0.19/0.35 inference(strict_predicate_extension, [assumptions([a3, a4, a5, a6])], [c4, c5])). % 0.19/0.35 cnf(c7, plain, % 0.19/0.35 between_o(X4,X5,X6,X7), % 0.19/0.35 inference(strict_predicate_extension, [assumptions([a3, a4, a5, a6])], [c4, c5])). % 0.19/0.35 % 0.19/0.35 cnf(c8, axiom, % 0.19/0.35 between_c(sK29(X8,X9,X10,X11),X8,X9,X10) | ~between_o(X11,X8,X9,X10)). % 0.19/0.35 cnf(a7, assumption, % 0.19/0.35 X4 = X11). % 0.19/0.35 cnf(a8, assumption, % 0.19/0.35 X5 = X8). % 0.19/0.35 cnf(a9, assumption, % 0.19/0.35 X6 = X9). % 0.19/0.35 cnf(a10, assumption, % 0.19/0.35 X7 = X10). % 0.19/0.35 cnf(c9, plain, % 0.19/0.35 $false, % 0.19/0.35 inference(strict_predicate_extension, [assumptions([a7, a8, a9, a10])], [c7, c8])). % 0.19/0.35 cnf(c10, plain, % 0.19/0.35 between_c(sK29(X8,X9,X10,X11),X8,X9,X10), % 0.19/0.35 inference(strict_predicate_extension, [assumptions([a7, a8, a9, a10])], [c7, c8])). % 0.19/0.35 % 0.19/0.35 cnf(c11, axiom, % 0.19/0.35 ~between_c(X12,X13,X14,X13)). % 0.19/0.35 cnf(a11, assumption, % 0.19/0.35 sK29(X8,X9,X10,X11) = X12). % 0.19/0.35 cnf(a12, assumption, % 0.19/0.35 X8 = X13). % 0.19/0.35 cnf(a13, assumption, % 0.19/0.35 X9 = X14). % 0.19/0.35 cnf(a14, assumption, % 0.19/0.35 X10 = X13). % 0.19/0.35 cnf(c12, plain, % 0.19/0.35 $false, % 0.19/0.35 inference(strict_predicate_extension, [assumptions([a11, a12, a13, a14])], [c10, c11])). % 0.19/0.35 cnf(c13, plain, % 0.19/0.35 $false, % 0.19/0.35 inference(strict_predicate_extension, [assumptions([a11, a12, a13, a14])], [c10, c11])). % 0.19/0.35 % 0.19/0.35 cnf(c14, plain, % 0.19/0.35 ordered_by(sK35,sK36,sK36)). % 0.19/0.35 cnf(a15, assumption, % 0.19/0.35 X2 = sK35). % 0.19/0.35 cnf(a16, assumption, % 0.19/0.35 X3 = sK36). % 0.19/0.35 cnf(a17, assumption, % 0.19/0.35 X1 = sK36). % 0.19/0.35 cnf(c15, plain, % 0.19/0.35 $false, % 0.19/0.35 inference(predicate_reduction, [assumptions([a15, a16, a17])], [c6, c14])). % 0.19/0.35 % 0.19/0.35 cnf(c16, plain, % 0.19/0.35 $false, % 0.19/0.35 inference(constraint_solving, [ % 0.19/0.35 bind(X0, sK36), % 0.19/0.35 bind(X1, sK36), % 0.19/0.35 bind(X2, sK35), % 0.19/0.35 bind(X3, sK36), % 0.19/0.35 bind(X4, sK35), % 0.19/0.35 bind(X5, sK36), % 0.19/0.35 bind(X6, sK36), % 0.19/0.35 bind(X7, sK36), % 0.19/0.35 bind(X8, sK36), % 0.19/0.35 bind(X9, sK36), % 0.19/0.35 bind(X10, sK36), % 0.19/0.35 bind(X11, sK35), % 0.19/0.35 bind(X12, sK29(X8,X9,X10,X11)), % 0.19/0.35 bind(X13, sK36), % 0.19/0.35 bind(X14, sK36) % 0.19/0.35 ], % 0.19/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])). % 0.19/0.35 % 0.19/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------