%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n025.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 07:18:58 EDT 2022 % Result : Theorem 19.41s 2.85s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0. % 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n025.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 : Mon May 30 23:10:57 EDT 2022 % 0.12/0.34 % CPUTime : % 19.41/2.85 % SZS status Theorem % 19.41/2.85 % SZS output begin IncompleteProof % 19.41/2.85 cnf(c0, axiom, % 19.41/2.85 path(sK24,sK25,sK23)). % 19.41/2.85 cnf(c1, plain, % 19.41/2.85 path(sK24,sK25,sK23), % 19.41/2.85 inference(start, [], [c0])). % 19.41/2.85 % 19.41/2.85 cnf(c2, axiom, % 19.41/2.85 number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) | sP14(X0) | ~path(X1,X2,X0)). % 19.41/2.85 cnf(a0, assumption, % 19.41/2.85 sK24 = X1). % 19.41/2.85 cnf(a1, assumption, % 19.41/2.85 sK25 = X2). % 19.41/2.85 cnf(a2, assumption, % 19.41/2.85 sK23 = X0). % 19.41/2.85 cnf(c3, plain, % 19.41/2.85 $false, % 19.41/2.85 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 19.41/2.85 cnf(c4, plain, % 19.41/2.85 number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) | sP14(X0), % 19.41/2.85 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 19.41/2.85 % 19.41/2.85 cnf(c5, axiom, % 19.41/2.85 number_of_in(sequential_pairs,sK23) != number_of_in(triangles,sK23)). % 19.41/2.85 cnf(a3, assumption, % 19.41/2.85 number_of_in(triangles,sK23) = number_of_in(triangles,X0)). % 19.41/2.85 cnf(a4, assumption, % 19.41/2.85 number_of_in(sequential_pairs,X0) = X3). % 19.41/2.85 cnf(c6, plain, % 19.41/2.85 sP14(X0), % 19.41/2.85 inference(strict_subterm_extension, [assumptions([a3, a4])], [c4, c5])). % 19.41/2.85 cnf(c7, plain, % 19.41/2.85 $false, % 19.41/2.85 inference(strict_subterm_extension, [assumptions([a3, a4])], [c4, c5])). % 19.41/2.85 cnf(c8, plain, % 19.41/2.85 number_of_in(sequential_pairs,sK23) != X3, % 19.41/2.85 inference(strict_subterm_extension, [assumptions([a3, a4])], [c4, c5])). % 19.41/2.85 % 19.41/2.85 cnf(a5, assumption, % 19.41/2.85 number_of_in(sequential_pairs,sK23) = X3). % 19.41/2.85 cnf(c9, plain, % 19.41/2.85 $false, % 19.41/2.85 inference(reflexivity, [assumptions([a5])], [c8])). % 19.41/2.85 % 19.41/2.85 cnf(c10, axiom, % 19.41/2.85 ~triangle(sK21(X4),sK22(X4),X5) | ~sP14(X4)). % 19.41/2.85 cnf(a6, assumption, % 19.41/2.85 X0 = X4). % 19.41/2.85 cnf(c11, plain, % 19.41/2.85 $false, % 19.41/2.85 inference(strict_predicate_extension, [assumptions([a6])], [c6, c10])). % 19.41/2.85 cnf(c12, plain, % 19.41/2.85 ~triangle(sK21(X4),sK22(X4),X5), % 19.41/2.85 inference(strict_predicate_extension, [assumptions([a6])], [c6, c10])). % 19.41/2.85 % 19.41/2.85 cnf(c13, axiom, % 19.41/2.85 triangle(X6,X7,sK26(X6,X7)) | ~sequential(X6,X7) | ~on_path(X7,sK23) | ~on_path(X6,sK23)). % 19.41/2.85 cnf(a7, assumption, % 19.41/2.85 sK21(X4) = X6). % 19.41/2.85 cnf(a8, assumption, % 19.41/2.85 sK22(X4) = X7). % 19.41/2.85 cnf(a9, assumption, % 19.41/2.85 X5 = sK26(X6,X7)). % 19.41/2.85 cnf(c14, plain, % 19.41/2.85 $false, % 19.41/2.85 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c12, c13])). % 19.41/2.85 cnf(c15, plain, % 19.41/2.85 ~sequential(X6,X7) | ~on_path(X7,sK23) | ~on_path(X6,sK23), % 19.41/2.85 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c12, c13])). % 19.41/2.85 % 19.41/2.85 cnf(c16, axiom, % 19.41/2.85 sequential(sK21(X8),sK22(X8)) | ~sP14(X8)). % 19.41/2.85 cnf(a10, assumption, % 19.41/2.85 X6 = sK21(X8)). % 19.41/2.85 cnf(a11, assumption, % 19.41/2.85 X7 = sK22(X8)). % 19.41/2.85 cnf(c17, plain, % 19.41/2.85 ~on_path(X7,sK23) | ~on_path(X6,sK23), % 19.41/2.85 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c16])). % 19.41/2.85 cnf(c18, plain, % 19.41/2.85 ~sP14(X8), % 19.41/2.85 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c16])). % 19.41/2.85 % 19.41/2.85 cnf(c19, plain, % 19.41/2.85 sP14(X0)). % 19.41/2.85 cnf(a12, assumption, % 19.41/2.85 X8 = X0). % 19.41/2.85 cnf(c20, plain, % 19.41/2.85 $false, % 19.41/2.85 inference(predicate_reduction, [assumptions([a12])], [c18, c19])). % 19.41/2.85 % 19.41/2.85 cnf(c21, axiom, % 19.41/2.85 on_path(sK22(X9),X9) | ~sP14(X9)). % 19.41/2.85 cnf(a13, assumption, % 19.41/2.85 X7 = sK22(X9)). % 19.41/2.85 cnf(a14, assumption, % 19.41/2.85 sK23 = X9). % 19.41/2.85 cnf(c22, plain, % 19.41/2.85 ~on_path(X6,sK23), % 19.41/2.85 inference(strict_predicate_extension, [assumptions([a13, a14])], [c17, c21])). % 19.41/2.85 cnf(c23, plain, % 19.41/2.85 ~sP14(X9), % 19.41/2.85 inference(strict_predicate_extension, [assumptions([a13, a14])], [c17, c21])). % 19.41/2.85 % 19.41/2.85 cnf(c24, plain, % 19.41/2.85 sP14(X0)). % 19.41/2.85 cnf(a15, assumption, % 19.41/2.85 X9 = X0). % 19.41/2.85 cnf(c25, plain, % 19.41/2.85 $false, % 19.41/2.85 inference(predicate_reduction, [assumptions([a15])], [c23, c24])). % 19.41/2.85 % 19.41/2.85 cnf(c26, axiom, % 19.41/2.85 on_path(sK21(X10),X10) | ~sP14(X10)). % 19.41/2.85 cnf(a16, assumption, % 19.41/2.85 X6 = sK21(X10)). % 19.41/2.85 cnf(a17, assumption, % 19.41/2.85 sK23 = X10). % 19.41/2.85 cnf(c27, plain, % 19.41/2.85 $false, % 19.41/2.85 inference(strict_predicate_extension, [assumptions([a16, a17])], [c22, c26])). % 19.41/2.85 cnf(c28, plain, % 19.41/2.85 ~sP14(X10), % 19.41/2.85 inference(strict_predicate_extension, [assumptions([a16, a17])], [c22, c26])). % 19.41/2.85 % 19.41/2.85 cnf(c29, plain, % 19.41/2.85 sP14(X0)). % 19.41/2.85 cnf(a18, assumption, % 19.41/2.85 X10 = X0). % 19.41/2.85 cnf(c30, plain, % 19.41/2.85 $false, % 19.41/2.85 inference(predicate_reduction, [assumptions([a18])], [c28, c29])). % 19.41/2.85 % 19.41/2.85 cnf(c31, plain, % 19.41/2.85 $false, % 19.41/2.85 inference(constraint_solving, [ % 19.41/2.85 bind(X0, sK23), % 19.41/2.85 bind(X1, sK24), % 19.41/2.85 bind(X2, sK25), % 19.41/2.85 bind(X3, number_of_in(sequential_pairs,X0)), % 19.41/2.85 bind(X4, sK23), % 19.41/2.85 bind(X5, sK26(X6,X7)), % 19.41/2.85 bind(X6, sK21(X4)), % 19.41/2.85 bind(X7, sK22(X4)), % 19.41/2.85 bind(X8, sK23), % 19.41/2.85 bind(X9, sK23), % 19.41/2.85 bind(X10, sK23) % 19.41/2.85 ], % 19.41/2.85 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])). % 19.41/2.85 % 19.41/2.85 % SZS output end IncompleteProof %------------------------------------------------------------------------------