%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MSC017+1 : 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 : 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 : Sun Jul 17 22:49:56 EDT 2022 % Result : Theorem 0.13s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : MSC017+1 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n008.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jul 1 16:08:38 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 % SZS status Theorem % 0.13/0.36 % SZS output begin IncompleteProof % 0.13/0.36 cnf(c0, axiom, % 0.13/0.36 outcome(sK2,sK3)). % 0.13/0.36 cnf(c1, plain, % 0.13/0.36 outcome(sK2,sK3), % 0.13/0.36 inference(start, [], [c0])). % 0.13/0.36 % 0.13/0.36 cnf(c2, axiom, % 0.13/0.36 dci = X0 | ~bad(X0) | ~outcome(X1,X0) | ~dive(X1)). % 0.13/0.36 cnf(a0, assumption, % 0.13/0.36 sK2 = X1). % 0.13/0.36 cnf(a1, assumption, % 0.13/0.36 sK3 = X0). % 0.13/0.36 cnf(c3, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.36 cnf(c4, plain, % 0.13/0.36 dci = X0 | ~bad(X0) | ~dive(X1), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.36 % 0.13/0.36 cnf(c5, plain, % 0.13/0.36 outcome(sK2,sK3)). % 0.13/0.36 cnf(a2, assumption, % 0.13/0.36 sK3 = X0). % 0.13/0.36 cnf(a3, assumption, % 0.13/0.36 dci = X2). % 0.13/0.36 cnf(c6, plain, % 0.13/0.36 ~bad(X0) | ~dive(X1), % 0.13/0.36 inference(subterm_reduction, [assumptions([a2, a3])], [c4, c5])). % 0.13/0.36 cnf(c7, plain, % 0.13/0.36 outcome(sK2,X2), % 0.13/0.36 inference(subterm_reduction, [assumptions([a2, a3])], [c4, c5])). % 0.13/0.36 % 0.13/0.36 cnf(c8, axiom, % 0.13/0.36 greater(nitrogen(X3),nitrogen_limit) | ~outcome(X3,dci) | ~dive(X3)). % 0.13/0.36 cnf(a4, assumption, % 0.13/0.36 sK2 = X3). % 0.13/0.36 cnf(a5, assumption, % 0.13/0.36 X2 = dci). % 0.13/0.36 cnf(c9, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.13/0.36 cnf(c10, plain, % 0.13/0.36 greater(nitrogen(X3),nitrogen_limit) | ~dive(X3), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.13/0.36 % 0.13/0.36 cnf(c11, axiom, % 0.13/0.36 sP0(X4) | ~greater(nitrogen(X4),nitrogen_limit) | ~sP1(X4)). % 0.13/0.36 cnf(a6, assumption, % 0.13/0.36 nitrogen(X3) = nitrogen(X4)). % 0.13/0.36 cnf(a7, assumption, % 0.13/0.36 nitrogen_limit = nitrogen_limit). % 0.13/0.36 cnf(c12, plain, % 0.13/0.36 ~dive(X3), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.13/0.36 cnf(c13, plain, % 0.13/0.36 sP0(X4) | ~sP1(X4), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.13/0.36 % 0.13/0.36 cnf(c14, axiom, % 0.13/0.36 greater(time(X5),time_limit) | greater(depth(X5),depth_limit) | ~sP0(X5)). % 0.13/0.36 cnf(a8, assumption, % 0.13/0.36 X4 = X5). % 0.13/0.36 cnf(c15, plain, % 0.13/0.36 ~sP1(X4), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])). % 0.13/0.36 cnf(c16, plain, % 0.13/0.36 greater(time(X5),time_limit) | greater(depth(X5),depth_limit), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])). % 0.13/0.36 % 0.13/0.36 cnf(c17, axiom, % 0.13/0.36 ~greater(time(X6),time_limit) | ~dive(X6)). % 0.13/0.36 cnf(a9, assumption, % 0.13/0.36 time(X5) = time(X6)). % 0.13/0.36 cnf(a10, assumption, % 0.13/0.36 time_limit = time_limit). % 0.13/0.36 cnf(c18, plain, % 0.13/0.36 greater(depth(X5),depth_limit), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])). % 0.13/0.36 cnf(c19, plain, % 0.13/0.36 ~dive(X6), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])). % 0.13/0.36 % 0.13/0.36 cnf(c20, axiom, % 0.13/0.36 dive(sK2)). % 0.13/0.36 cnf(a11, assumption, % 0.13/0.36 X6 = sK2). % 0.13/0.36 cnf(c21, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a11])], [c19, c20])). % 0.13/0.36 cnf(c22, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a11])], [c19, c20])). % 0.13/0.36 % 0.13/0.36 cnf(c23, axiom, % 0.13/0.36 ~greater(depth(X7),depth_limit) | ~dive(X7)). % 0.13/0.36 cnf(a12, assumption, % 0.13/0.36 depth(X5) = depth(X7)). % 0.13/0.36 cnf(a13, assumption, % 0.13/0.36 depth_limit = depth_limit). % 0.13/0.36 cnf(c24, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c23])). % 0.13/0.36 cnf(c25, plain, % 0.13/0.36 ~dive(X7), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c23])). % 0.13/0.36 % 0.13/0.36 cnf(c26, plain, % 0.13/0.36 dive(X6)). % 0.13/0.36 cnf(a14, assumption, % 0.13/0.36 X7 = X6). % 0.13/0.36 cnf(c27, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(predicate_reduction, [assumptions([a14])], [c25, c26])). % 0.13/0.36 % 0.13/0.36 cnf(c28, axiom, % 0.13/0.36 sP1(X8) | ~dive(X8)). % 0.13/0.36 cnf(a15, assumption, % 0.13/0.36 X4 = X8). % 0.13/0.36 cnf(c29, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a15])], [c15, c28])). % 0.13/0.36 cnf(c30, plain, % 0.13/0.36 ~dive(X8), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a15])], [c15, c28])). % 0.13/0.36 % 0.13/0.36 cnf(c31, plain, % 0.13/0.36 dive(X6)). % 0.13/0.36 cnf(a16, assumption, % 0.13/0.36 X8 = X6). % 0.13/0.36 cnf(c32, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(predicate_reduction, [assumptions([a16])], [c30, c31])). % 0.13/0.36 % 0.13/0.36 cnf(c33, plain, % 0.13/0.36 dive(X6)). % 0.13/0.36 cnf(a17, assumption, % 0.13/0.36 X3 = X6). % 0.13/0.36 cnf(c34, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(predicate_reduction, [assumptions([a17])], [c12, c33])). % 0.13/0.36 % 0.13/0.36 cnf(c35, axiom, % 0.13/0.36 bad(sK3)). % 0.13/0.36 cnf(a18, assumption, % 0.13/0.36 X0 = sK3). % 0.13/0.36 cnf(c36, plain, % 0.13/0.36 ~dive(X1), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a18])], [c6, c35])). % 0.13/0.36 cnf(c37, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a18])], [c6, c35])). % 0.13/0.36 % 0.13/0.36 cnf(c38, plain, % 0.13/0.36 dive(X6)). % 0.13/0.36 cnf(a19, assumption, % 0.13/0.36 X1 = X6). % 0.13/0.36 cnf(c39, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(predicate_reduction, [assumptions([a19])], [c36, c38])). % 0.13/0.36 % 0.13/0.36 cnf(c40, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(constraint_solving, [ % 0.13/0.36 bind(X0, sK3), % 0.13/0.36 bind(X1, sK2), % 0.13/0.36 bind(X2, dci), % 0.13/0.36 bind(X3, sK2), % 0.13/0.36 bind(X4, sK2), % 0.13/0.36 bind(X5, sK2), % 0.13/0.36 bind(X6, sK2), % 0.13/0.36 bind(X7, sK2), % 0.13/0.36 bind(X8, sK2) % 0.13/0.36 ], % 0.13/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])). % 0.13/0.36 % 0.13/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------