%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN918+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n014.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 : Thu Jul 21 08:14:10 EDT 2022 % Result : Theorem 0.12s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN918+1 : TPTP v8.1.0. Released v3.1.0. % 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n014.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jul 11 19:19:19 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.35 % SZS status Theorem % 0.12/0.35 % SZS output begin IncompleteProof % 0.12/0.35 cnf(c0, axiom, % 0.12/0.35 f(sK1) | sP0(X0)). % 0.12/0.35 cnf(c1, plain, % 0.12/0.35 f(sK1) | sP0(X0), % 0.12/0.35 inference(start, [], [c0])). % 0.12/0.35 % 0.12/0.35 cnf(c2, axiom, % 0.12/0.35 g(X1) | ~h(X1) | ~f(X1)). % 0.12/0.35 cnf(a0, assumption, % 0.12/0.35 sK1 = X1). % 0.12/0.35 cnf(c3, plain, % 0.12/0.35 sP0(X0), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.35 cnf(c4, plain, % 0.12/0.35 g(X1) | ~h(X1), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.35 % 0.12/0.35 cnf(c5, axiom, % 0.12/0.35 ~g(sK1) | sP0(X2)). % 0.12/0.35 cnf(a1, assumption, % 0.12/0.35 X1 = sK1). % 0.12/0.35 cnf(c6, plain, % 0.12/0.35 ~h(X1), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.12/0.35 cnf(c7, plain, % 0.12/0.35 sP0(X2), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.12/0.35 % 0.12/0.35 cnf(c8, axiom, % 0.12/0.35 ~h(X3) | ~sP0(X3)). % 0.12/0.35 cnf(a2, assumption, % 0.12/0.35 X2 = X3). % 0.12/0.35 cnf(c9, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.12/0.35 cnf(c10, plain, % 0.12/0.35 ~h(X3), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.12/0.35 % 0.12/0.35 cnf(c11, axiom, % 0.12/0.35 h(X4) | ~g(X4) | ~f(X4)). % 0.12/0.35 cnf(a3, assumption, % 0.12/0.35 X3 = X4). % 0.12/0.35 cnf(c12, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.12/0.35 cnf(c13, plain, % 0.12/0.35 ~g(X4) | ~f(X4), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.12/0.35 % 0.12/0.35 cnf(c14, plain, % 0.12/0.35 g(X1)). % 0.12/0.35 cnf(a4, assumption, % 0.12/0.35 X4 = X1). % 0.12/0.35 cnf(c15, plain, % 0.12/0.35 ~f(X4), % 0.12/0.35 inference(predicate_reduction, [assumptions([a4])], [c13, c14])). % 0.12/0.35 % 0.12/0.35 cnf(c16, plain, % 0.12/0.35 f(sK1)). % 0.12/0.35 cnf(a5, assumption, % 0.12/0.35 X4 = sK1). % 0.12/0.35 cnf(c17, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(predicate_reduction, [assumptions([a5])], [c15, c16])). % 0.12/0.35 % 0.12/0.35 cnf(c18, axiom, % 0.12/0.35 h(X5) | ~f(X5) | g(X6) | ~f(X6)). % 0.12/0.35 cnf(a6, assumption, % 0.12/0.35 X1 = X5). % 0.12/0.35 cnf(c19, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c6, c18])). % 0.12/0.35 cnf(c20, plain, % 0.12/0.35 ~f(X5) | g(X6) | ~f(X6), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c6, c18])). % 0.12/0.35 % 0.12/0.35 cnf(c21, plain, % 0.12/0.35 f(sK1)). % 0.12/0.35 cnf(a7, assumption, % 0.12/0.35 X5 = sK1). % 0.12/0.35 cnf(c22, plain, % 0.12/0.35 g(X6) | ~f(X6), % 0.12/0.35 inference(predicate_reduction, [assumptions([a7])], [c20, c21])). % 0.12/0.35 % 0.12/0.35 cnf(c23, plain, % 0.12/0.35 ~g(X1)). % 0.12/0.35 cnf(a8, assumption, % 0.12/0.35 X6 = X1). % 0.12/0.35 cnf(c24, plain, % 0.12/0.35 ~f(X6), % 0.12/0.35 inference(predicate_reduction, [assumptions([a8])], [c22, c23])). % 0.12/0.35 % 0.12/0.35 cnf(c25, plain, % 0.12/0.35 f(sK1)). % 0.12/0.35 cnf(a9, assumption, % 0.12/0.35 X6 = sK1). % 0.12/0.35 cnf(c26, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(predicate_reduction, [assumptions([a9])], [c24, c25])). % 0.12/0.35 % 0.12/0.35 cnf(c27, axiom, % 0.12/0.35 f(X7) | ~sP0(X7)). % 0.12/0.35 cnf(a10, assumption, % 0.12/0.35 X0 = X7). % 0.12/0.35 cnf(c28, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a10])], [c3, c27])). % 0.12/0.35 cnf(c29, plain, % 0.12/0.35 f(X7), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a10])], [c3, c27])). % 0.12/0.35 % 0.12/0.35 cnf(c30, plain, % 0.12/0.35 ~f(sK1)). % 0.12/0.35 cnf(a11, assumption, % 0.12/0.35 X7 = sK1). % 0.12/0.35 cnf(c31, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(predicate_reduction, [assumptions([a11])], [c29, c30])). % 0.12/0.35 % 0.12/0.35 cnf(c32, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(constraint_solving, [ % 0.12/0.35 bind(X0, sK1), % 0.12/0.35 bind(X1, sK1), % 0.12/0.35 bind(X2, sK1), % 0.12/0.35 bind(X3, sK1), % 0.12/0.35 bind(X4, sK1), % 0.12/0.35 bind(X5, sK1), % 0.12/0.35 bind(X6, sK1), % 0.12/0.35 bind(X7, sK1) % 0.12/0.35 ], % 0.12/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.12/0.35 % 0.12/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------