%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUN062+1 : TPTP v8.1.0. Bugfixed v7.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 : 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 : Mon Jul 18 16:33:23 EDT 2022 % Result : Theorem 0.13s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : NUN062+1 : TPTP v8.1.0. Bugfixed v7.4.0. % 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.35 % Computer : n025.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Thu Jun 2 04:25:59 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 % SZS status Theorem % 0.13/0.38 % SZS output begin IncompleteProof % 0.13/0.38 cnf(c0, axiom, % 0.13/0.38 ~r3(sK29,X0,X1) | ~id(X1,X2) | r1(sK30(X0))). % 0.13/0.38 cnf(c1, plain, % 0.13/0.38 ~r3(sK29,X0,X1) | ~id(X1,X2) | r1(sK30(X0)), % 0.13/0.38 inference(start, [], [c0])). % 0.13/0.38 % 0.13/0.38 cnf(c2, axiom, % 0.13/0.38 r3(X3,X4,sK14(X3,X4))). % 0.13/0.38 cnf(a0, assumption, % 0.13/0.38 sK29 = X3). % 0.13/0.38 cnf(a1, assumption, % 0.13/0.38 X0 = X4). % 0.13/0.38 cnf(a2, assumption, % 0.13/0.38 X1 = sK14(X3,X4)). % 0.13/0.38 cnf(c3, plain, % 0.13/0.38 ~id(X1,X2) | r1(sK30(X0)), % 0.13/0.38 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.13/0.38 cnf(c4, plain, % 0.13/0.38 $false, % 0.13/0.38 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.13/0.38 % 0.13/0.38 cnf(c5, axiom, % 0.13/0.38 id(X5,X5)). % 0.13/0.38 cnf(a3, assumption, % 0.13/0.38 X1 = X5). % 0.13/0.38 cnf(a4, assumption, % 0.13/0.38 X2 = X5). % 0.13/0.38 cnf(c6, plain, % 0.13/0.38 r1(sK30(X0)), % 0.13/0.38 inference(strict_predicate_extension, [assumptions([a3, a4])], [c3, c5])). % 0.13/0.38 cnf(c7, plain, % 0.13/0.38 $false, % 0.13/0.38 inference(strict_predicate_extension, [assumptions([a3, a4])], [c3, c5])). % 0.13/0.38 % 0.13/0.38 cnf(c8, axiom, % 0.13/0.38 ~r2(X6,X7) | ~r1(X8) | ~id(X8,X7)). % 0.13/0.38 cnf(a5, assumption, % 0.13/0.38 sK30(X0) = X8). % 0.13/0.38 cnf(c9, plain, % 0.13/0.38 $false, % 0.13/0.38 inference(strict_predicate_extension, [assumptions([a5])], [c6, c8])). % 0.13/0.38 cnf(c10, plain, % 0.13/0.38 ~r2(X6,X7) | ~id(X8,X7), % 0.13/0.38 inference(strict_predicate_extension, [assumptions([a5])], [c6, c8])). % 0.13/0.38 % 0.13/0.38 cnf(c11, axiom, % 0.13/0.38 r2(sK14(X9,X10),sK13(X9,X10))). % 0.13/0.38 cnf(a6, assumption, % 0.13/0.38 X6 = sK14(X9,X10)). % 0.13/0.38 cnf(a7, assumption, % 0.13/0.38 X7 = sK13(X9,X10)). % 0.13/0.38 cnf(c12, plain, % 0.13/0.38 ~id(X8,X7), % 0.13/0.38 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.13/0.38 cnf(c13, plain, % 0.13/0.38 $false, % 0.13/0.38 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.13/0.38 % 0.13/0.38 cnf(c14, axiom, % 0.13/0.38 id(X11,X12) | ~id(X12,X11)). % 0.13/0.38 cnf(a8, assumption, % 0.13/0.38 X8 = X11). % 0.13/0.38 cnf(a9, assumption, % 0.13/0.38 X7 = X12). % 0.13/0.38 cnf(c15, plain, % 0.13/0.38 $false, % 0.13/0.38 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 0.13/0.38 cnf(c16, plain, % 0.13/0.38 ~id(X12,X11), % 0.13/0.38 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 0.13/0.38 % 0.13/0.38 cnf(c17, axiom, % 0.13/0.38 ~r3(sK29,X13,X14) | ~id(X14,X15) | id(X13,sK30(X13))). % 0.13/0.38 cnf(a10, assumption, % 0.13/0.38 X12 = X13). % 0.13/0.38 cnf(a11, assumption, % 0.13/0.38 X11 = sK30(X13)). % 0.13/0.38 cnf(c18, plain, % 0.13/0.38 $false, % 0.13/0.38 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 0.13/0.38 cnf(c19, plain, % 0.13/0.38 ~r3(sK29,X13,X14) | ~id(X14,X15), % 0.13/0.38 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 0.13/0.38 % 0.13/0.38 cnf(c20, plain, % 0.13/0.38 r3(sK29,X0,X1)). % 0.13/0.38 cnf(a12, assumption, % 0.13/0.38 sK29 = sK29). % 0.13/0.38 cnf(a13, assumption, % 0.13/0.38 X13 = X0). % 0.13/0.38 cnf(a14, assumption, % 0.13/0.38 X14 = X1). % 0.13/0.38 cnf(c21, plain, % 0.13/0.38 ~id(X14,X15), % 0.13/0.38 inference(predicate_reduction, [assumptions([a12, a13, a14])], [c19, c20])). % 0.13/0.38 % 0.13/0.38 cnf(c22, plain, % 0.13/0.38 id(X1,X2)). % 0.13/0.38 cnf(a15, assumption, % 0.13/0.38 X14 = X1). % 0.13/0.38 cnf(a16, assumption, % 0.13/0.38 X15 = X2). % 0.13/0.38 cnf(c23, plain, % 0.13/0.38 $false, % 0.13/0.38 inference(predicate_reduction, [assumptions([a15, a16])], [c21, c22])). % 0.13/0.38 % 0.13/0.38 cnf(c24, plain, % 0.13/0.38 $false, % 0.13/0.38 inference(constraint_solving, [ % 0.13/0.38 bind(X0, sK13(X9,X10)), % 0.13/0.38 bind(X1, sK14(X3,X4)), % 0.13/0.38 bind(X2, sK14(X3,X4)), % 0.13/0.38 bind(X3, sK29), % 0.13/0.38 bind(X4, sK13(X9,X10)), % 0.13/0.38 bind(X5, sK14(X3,X4)), % 0.13/0.38 bind(X6, sK14(X9,X10)), % 0.13/0.38 bind(X7, sK13(X9,X10)), % 0.13/0.38 bind(X8, sK30(X0)), % 0.13/0.38 bind(X9, X9), % 0.13/0.38 bind(X10, X10), % 0.13/0.38 bind(X11, sK30(X0)), % 0.13/0.38 bind(X12, sK13(X9,X10)), % 0.13/0.38 bind(X13, sK13(X9,X10)), % 0.13/0.38 bind(X14, sK14(X3,X4)), % 0.13/0.38 bind(X15, sK14(X3,X4)) % 0.13/0.38 ], % 0.13/0.38 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])). % 0.13/0.38 % 0.13/0.38 % SZS output end IncompleteProof %------------------------------------------------------------------------------