%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : COM016+4 : 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 : Fri Jul 15 01:27:03 EDT 2022 % Result : Theorem 0.13s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : COM016+4 : TPTP v8.1.0. Released v4.0.0. % 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n008.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Thu Jun 16 17:33:37 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.40 % SZS status Theorem % 0.13/0.40 % SZS output begin IncompleteProof % 0.13/0.40 cnf(c0, axiom, % 0.13/0.40 sP30(X0) | ~aReductOfIn0(X0,xa,xR) | ~aElement0(X0)). % 0.13/0.40 cnf(c1, plain, % 0.13/0.40 sP30(X0) | ~aReductOfIn0(X0,xa,xR) | ~aElement0(X0), % 0.13/0.40 inference(start, [], [c0])). % 0.13/0.40 % 0.13/0.40 cnf(c2, axiom, % 0.13/0.40 ~sP30(xb)). % 0.13/0.40 cnf(a0, assumption, % 0.13/0.40 X0 = xb). % 0.13/0.40 cnf(c3, plain, % 0.13/0.40 ~aReductOfIn0(X0,xa,xR) | ~aElement0(X0), % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.40 cnf(c4, plain, % 0.13/0.40 $false, % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.40 % 0.13/0.40 cnf(c5, axiom, % 0.13/0.40 sP28 | aReductOfIn0(xb,xa,xR)). % 0.13/0.40 cnf(a1, assumption, % 0.13/0.40 X0 = xb). % 0.13/0.40 cnf(a2, assumption, % 0.13/0.40 xa = xa). % 0.13/0.40 cnf(a3, assumption, % 0.13/0.40 xR = xR). % 0.13/0.40 cnf(c6, plain, % 0.13/0.40 ~aElement0(X0), % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a1, a2, a3])], [c3, c5])). % 0.13/0.40 cnf(c7, plain, % 0.13/0.40 sP28, % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a1, a2, a3])], [c3, c5])). % 0.13/0.40 % 0.13/0.40 cnf(c8, axiom, % 0.13/0.40 sdtmndtplgtdt0(sK51,xR,xb) | ~sP28). % 0.13/0.40 cnf(c9, plain, % 0.13/0.40 $false, % 0.13/0.40 inference(strict_predicate_extension, [], [c7, c8])). % 0.13/0.40 cnf(c10, plain, % 0.13/0.40 sdtmndtplgtdt0(sK51,xR,xb), % 0.13/0.40 inference(strict_predicate_extension, [], [c7, c8])). % 0.13/0.40 % 0.13/0.40 cnf(c11, axiom, % 0.13/0.40 ~sdtmndtplgtdt0(X1,xR,xb) | ~sP30(X1)). % 0.13/0.40 cnf(a4, assumption, % 0.13/0.40 sK51 = X1). % 0.13/0.40 cnf(a5, assumption, % 0.13/0.40 xR = xR). % 0.13/0.40 cnf(a6, assumption, % 0.13/0.40 xb = xb). % 0.13/0.40 cnf(c12, plain, % 0.13/0.40 $false, % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c10, c11])). % 0.13/0.40 cnf(c13, plain, % 0.13/0.40 ~sP30(X1), % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c10, c11])). % 0.13/0.40 % 0.13/0.40 cnf(c14, axiom, % 0.13/0.40 sP30(X2) | ~aReductOfIn0(X2,xa,xR) | ~aElement0(X2)). % 0.13/0.40 cnf(a7, assumption, % 0.13/0.40 X1 = X2). % 0.13/0.40 cnf(c15, plain, % 0.13/0.40 $false, % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a7])], [c13, c14])). % 0.13/0.40 cnf(c16, plain, % 0.13/0.40 ~aReductOfIn0(X2,xa,xR) | ~aElement0(X2), % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a7])], [c13, c14])). % 0.13/0.40 % 0.13/0.40 cnf(c17, axiom, % 0.13/0.40 aReductOfIn0(sK51,xa,xR) | ~sP28). % 0.13/0.40 cnf(a8, assumption, % 0.13/0.40 X2 = sK51). % 0.13/0.40 cnf(a9, assumption, % 0.13/0.40 xa = xa). % 0.13/0.40 cnf(a10, assumption, % 0.13/0.40 xR = xR). % 0.13/0.40 cnf(c18, plain, % 0.13/0.40 ~aElement0(X2), % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c16, c17])). % 0.13/0.40 cnf(c19, plain, % 0.13/0.40 ~sP28, % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c16, c17])). % 0.13/0.40 % 0.13/0.40 cnf(c20, plain, % 0.13/0.40 sP28). % 0.13/0.40 cnf(c21, plain, % 0.13/0.40 $false, % 0.13/0.40 inference(predicate_reduction, [], [c19, c20])). % 0.13/0.40 % 0.13/0.40 cnf(c22, axiom, % 0.13/0.40 aElement0(sK51) | ~sP28). % 0.13/0.40 cnf(a11, assumption, % 0.13/0.40 X2 = sK51). % 0.13/0.40 cnf(c23, plain, % 0.13/0.40 $false, % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a11])], [c18, c22])). % 0.13/0.40 cnf(c24, plain, % 0.13/0.40 ~sP28, % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a11])], [c18, c22])). % 0.13/0.40 % 0.13/0.40 cnf(c25, plain, % 0.13/0.40 sP28). % 0.13/0.40 cnf(c26, plain, % 0.13/0.40 $false, % 0.13/0.40 inference(predicate_reduction, [], [c24, c25])). % 0.13/0.40 % 0.13/0.40 cnf(c27, axiom, % 0.13/0.40 aElement0(xb)). % 0.13/0.40 cnf(a12, assumption, % 0.13/0.40 X0 = xb). % 0.13/0.40 cnf(c28, plain, % 0.13/0.40 $false, % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a12])], [c6, c27])). % 0.13/0.40 cnf(c29, plain, % 0.13/0.40 $false, % 0.13/0.40 inference(strict_predicate_extension, [assumptions([a12])], [c6, c27])). % 0.13/0.40 % 0.13/0.40 cnf(c30, plain, % 0.13/0.40 $false, % 0.13/0.40 inference(constraint_solving, [ % 0.13/0.40 bind(X0, xb), % 0.13/0.40 bind(X1, sK51), % 0.13/0.40 bind(X2, sK51) % 0.13/0.40 ], % 0.13/0.40 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 0.13/0.40 % 0.13/0.40 % SZS output end IncompleteProof %------------------------------------------------------------------------------