%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LAT385+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 : n015.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 05:40:32 EDT 2022 % Result : Theorem 0.20s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : LAT385+4 : 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 : n015.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 : Wed Jun 29 17:44:56 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.41 % SZS status Theorem % 0.20/0.41 % SZS output begin IncompleteProof % 0.20/0.41 cnf(c0, axiom, % 0.20/0.41 ~aInfimumOfIn0(X0,xP,xU)). % 0.20/0.41 cnf(c1, plain, % 0.20/0.41 ~aInfimumOfIn0(X0,xP,xU), % 0.20/0.41 inference(start, [], [c0])). % 0.20/0.41 % 0.20/0.41 cnf(c2, axiom, % 0.20/0.41 aInfimumOfIn0(sK40(X1),X1,xU) | ~sP23(X1)). % 0.20/0.41 cnf(a0, assumption, % 0.20/0.41 X0 = sK40(X1)). % 0.20/0.41 cnf(a1, assumption, % 0.20/0.41 xP = X1). % 0.20/0.41 cnf(a2, assumption, % 0.20/0.41 xU = xU). % 0.20/0.41 cnf(c3, plain, % 0.20/0.41 $false, % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.20/0.41 cnf(c4, plain, % 0.20/0.41 ~sP23(X1), % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.20/0.41 % 0.20/0.41 cnf(c5, axiom, % 0.20/0.41 sP23(X2) | sP17(X2)). % 0.20/0.41 cnf(a3, assumption, % 0.20/0.41 X1 = X2). % 0.20/0.41 cnf(c6, plain, % 0.20/0.41 $false, % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a3])], [c4, c5])). % 0.20/0.41 cnf(c7, plain, % 0.20/0.41 sP17(X2), % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a3])], [c4, c5])). % 0.20/0.41 % 0.20/0.41 cnf(c8, axiom, % 0.20/0.41 ~aElementOf0(sK44(X3),xU) | ~aSet0(X3) | ~sP17(X3)). % 0.20/0.41 cnf(a4, assumption, % 0.20/0.41 X2 = X3). % 0.20/0.41 cnf(c9, plain, % 0.20/0.41 $false, % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])). % 0.20/0.41 cnf(c10, plain, % 0.20/0.41 ~aElementOf0(sK44(X3),xU) | ~aSet0(X3), % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])). % 0.20/0.41 % 0.20/0.41 cnf(c11, axiom, % 0.20/0.41 aElementOf0(X4,xU) | ~sP25(X4)). % 0.20/0.41 cnf(a5, assumption, % 0.20/0.41 sK44(X3) = X4). % 0.20/0.41 cnf(a6, assumption, % 0.20/0.41 xU = xU). % 0.20/0.41 cnf(c12, plain, % 0.20/0.41 ~aSet0(X3), % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.20/0.41 cnf(c13, plain, % 0.20/0.41 ~sP25(X4), % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.20/0.41 % 0.20/0.41 cnf(c14, axiom, % 0.20/0.41 sP25(X5) | ~aElementOf0(X5,xP)). % 0.20/0.41 cnf(a7, assumption, % 0.20/0.41 X4 = X5). % 0.20/0.41 cnf(c15, plain, % 0.20/0.41 $false, % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a7])], [c13, c14])). % 0.20/0.41 cnf(c16, plain, % 0.20/0.41 ~aElementOf0(X5,xP), % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a7])], [c13, c14])). % 0.20/0.41 % 0.20/0.41 cnf(c17, axiom, % 0.20/0.41 aElementOf0(sK44(X6),X6) | ~aSet0(X6) | ~sP17(X6)). % 0.20/0.41 cnf(a8, assumption, % 0.20/0.41 X5 = sK44(X6)). % 0.20/0.41 cnf(a9, assumption, % 0.20/0.41 xP = X6). % 0.20/0.41 cnf(c18, plain, % 0.20/0.41 $false, % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])). % 0.20/0.41 cnf(c19, plain, % 0.20/0.41 ~aSet0(X6) | ~sP17(X6), % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])). % 0.20/0.41 % 0.20/0.41 cnf(c20, axiom, % 0.20/0.41 aSet0(xP)). % 0.20/0.41 cnf(a10, assumption, % 0.20/0.41 X6 = xP). % 0.20/0.41 cnf(c21, plain, % 0.20/0.41 ~sP17(X6), % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a10])], [c19, c20])). % 0.20/0.41 cnf(c22, plain, % 0.20/0.41 $false, % 0.20/0.41 inference(strict_predicate_extension, [assumptions([a10])], [c19, c20])). % 0.20/0.41 % 0.20/0.41 cnf(c23, plain, % 0.20/0.41 sP17(X2)). % 0.20/0.41 cnf(a11, assumption, % 0.20/0.41 X6 = X2). % 0.20/0.41 cnf(c24, plain, % 0.20/0.41 $false, % 0.20/0.41 inference(predicate_reduction, [assumptions([a11])], [c21, c23])). % 0.20/0.41 % 0.20/0.41 cnf(c25, plain, % 0.20/0.41 aSet0(X6)). % 0.20/0.41 cnf(a12, assumption, % 0.20/0.41 X3 = X6). % 0.20/0.41 cnf(c26, plain, % 0.20/0.41 $false, % 0.20/0.41 inference(predicate_reduction, [assumptions([a12])], [c12, c25])). % 0.20/0.41 % 0.20/0.41 cnf(c27, plain, % 0.20/0.41 $false, % 0.20/0.41 inference(constraint_solving, [ % 0.20/0.41 bind(X0, sK40(X1)), % 0.20/0.41 bind(X1, xP), % 0.20/0.41 bind(X2, xP), % 0.20/0.41 bind(X3, xP), % 0.20/0.41 bind(X4, sK44(X3)), % 0.20/0.41 bind(X5, sK44(X3)), % 0.20/0.41 bind(X6, xP) % 0.20/0.41 ], % 0.20/0.41 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 0.20/0.41 % 0.20/0.41 % SZS output end IncompleteProof %------------------------------------------------------------------------------