%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : ALG019+1 : TPTP v8.1.0. Released v2.7.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n021.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 14 17:20:24 EDT 2022 % Result : Theorem 34.03s 4.65s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : ALG019+1 : TPTP v8.1.0. Released v2.7.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n021.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Wed Jun 8 20:21:07 EDT 2022 % 0.12/0.33 % CPUTime : % 34.03/4.65 % SZS status Theorem % 34.03/4.65 % SZS output begin IncompleteProof % 34.03/4.65 cnf(c0, axiom, % 34.03/4.65 h(op1(X0,X1)) = op2(h(X0),h(X1)) | ~sorti1(X1) | ~sorti1(X0)). % 34.03/4.65 cnf(c1, plain, % 34.03/4.65 h(op1(X0,X1)) = op2(h(X0),h(X1)) | ~sorti1(X1) | ~sorti1(X0), % 34.03/4.65 inference(start, [], [c0])). % 34.03/4.65 % 34.03/4.65 cnf(c2, axiom, % 34.03/4.65 op2(X2,X2) = sK1 | ~sorti2(X2)). % 34.03/4.65 cnf(a0, assumption, % 34.03/4.65 op2(X2,X2) = op2(h(X0),h(X1))). % 34.03/4.65 cnf(a1, assumption, % 34.03/4.65 h(op1(X0,X1)) = X3). % 34.03/4.65 cnf(c3, plain, % 34.03/4.65 ~sorti1(X1) | ~sorti1(X0), % 34.03/4.65 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 34.03/4.65 cnf(c4, plain, % 34.03/4.65 ~sorti2(X2), % 34.03/4.65 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 34.03/4.65 cnf(c5, plain, % 34.03/4.65 X3 = sK1, % 34.03/4.65 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 34.03/4.65 % 34.03/4.65 cnf(c6, axiom, % 34.03/4.65 j(h(X4)) = X4 | ~sorti1(X4)). % 34.03/4.65 cnf(a2, assumption, % 34.03/4.65 h(X4) = X3). % 34.03/4.65 cnf(a3, assumption, % 34.03/4.65 sK1 = X5). % 34.03/4.65 cnf(c7, plain, % 34.03/4.65 $false, % 34.03/4.65 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])). % 34.03/4.65 cnf(c8, plain, % 34.03/4.65 ~sorti1(X4), % 34.03/4.65 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])). % 34.03/4.65 cnf(c9, plain, % 34.03/4.65 j(X5) = X4, % 34.03/4.65 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])). % 34.03/4.65 % 34.03/4.65 cnf(c10, axiom, % 34.03/4.65 op1(sK0(X6),sK0(X6)) != X6 | ~sorti1(X6)). % 34.03/4.65 cnf(a4, assumption, % 34.03/4.65 op1(sK0(X6),sK0(X6)) = X4). % 34.03/4.65 cnf(a5, assumption, % 34.03/4.65 j(X5) = X7). % 34.03/4.65 cnf(c11, plain, % 34.03/4.65 $false, % 34.03/4.65 inference(strict_subterm_extension, [assumptions([a4, a5])], [c9, c10])). % 34.03/4.65 cnf(c12, plain, % 34.03/4.65 ~sorti1(X6), % 34.03/4.65 inference(strict_subterm_extension, [assumptions([a4, a5])], [c9, c10])). % 34.03/4.65 cnf(c13, plain, % 34.03/4.65 X7 != X6, % 34.03/4.65 inference(strict_subterm_extension, [assumptions([a4, a5])], [c9, c10])). % 34.03/4.65 % 34.03/4.65 cnf(a6, assumption, % 34.03/4.65 X7 = X6). % 34.03/4.65 cnf(c14, plain, % 34.03/4.65 $false, % 34.03/4.65 inference(reflexivity, [assumptions([a6])], [c13])). % 34.03/4.65 % 34.03/4.65 cnf(c15, axiom, % 34.03/4.65 sorti1(j(X8)) | ~sorti2(X8)). % 34.03/4.65 cnf(a7, assumption, % 34.03/4.65 X6 = j(X8)). % 34.03/4.65 cnf(c16, plain, % 34.03/4.65 $false, % 34.03/4.65 inference(strict_predicate_extension, [assumptions([a7])], [c12, c15])). % 34.03/4.65 cnf(c17, plain, % 34.03/4.65 ~sorti2(X8), % 34.03/4.65 inference(strict_predicate_extension, [assumptions([a7])], [c12, c15])). % 34.03/4.65 % 34.03/4.65 cnf(c18, axiom, % 34.03/4.65 sorti2(sK1)). % 34.03/4.65 cnf(a8, assumption, % 34.03/4.65 X8 = sK1). % 34.03/4.65 cnf(c19, plain, % 34.03/4.65 $false, % 34.03/4.65 inference(strict_predicate_extension, [assumptions([a8])], [c17, c18])). % 34.03/4.65 cnf(c20, plain, % 34.03/4.65 $false, % 34.03/4.65 inference(strict_predicate_extension, [assumptions([a8])], [c17, c18])). % 34.03/4.65 % 34.03/4.65 cnf(c21, axiom, % 34.03/4.65 sorti1(op1(X9,X10)) | ~sorti1(X10) | ~sorti1(X9)). % 34.03/4.65 cnf(a9, assumption, % 34.03/4.65 X4 = op1(X9,X10)). % 34.03/4.65 cnf(c22, plain, % 34.03/4.65 $false, % 34.03/4.65 inference(strict_predicate_extension, [assumptions([a9])], [c8, c21])). % 34.03/4.65 cnf(c23, plain, % 34.03/4.65 ~sorti1(X10) | ~sorti1(X9), % 34.03/4.65 inference(strict_predicate_extension, [assumptions([a9])], [c8, c21])). % 34.03/4.65 % 34.03/4.65 cnf(c24, axiom, % 34.03/4.65 sorti1(sK0(X11)) | ~sorti1(X11)). % 34.03/4.65 cnf(a10, assumption, % 34.03/4.65 X10 = sK0(X11)). % 34.03/4.65 cnf(c25, plain, % 34.03/4.65 ~sorti1(X9), % 34.03/4.65 inference(strict_predicate_extension, [assumptions([a10])], [c23, c24])). % 34.03/4.65 cnf(c26, plain, % 34.03/4.65 ~sorti1(X11), % 34.03/4.65 inference(strict_predicate_extension, [assumptions([a10])], [c23, c24])). % 34.03/4.65 % 34.03/4.65 cnf(c27, plain, % 34.03/4.65 sorti1(X6)). % 34.03/4.65 cnf(a11, assumption, % 34.03/4.65 X11 = X6). % 34.03/4.65 cnf(c28, plain, % 34.03/4.65 $false, % 34.03/4.65 inference(predicate_reduction, [assumptions([a11])], [c26, c27])). % 34.03/4.65 % 34.03/4.65 cnf(c29, plain, % 34.03/4.65 sorti1(X10)). % 34.03/4.65 cnf(a12, assumption, % 34.03/4.65 X9 = X10). % 34.03/4.65 cnf(c30, plain, % 34.03/4.65 $false, % 34.03/4.65 inference(predicate_reduction, [assumptions([a12])], [c25, c29])). % 34.03/4.65 % 34.03/4.65 cnf(c31, axiom, % 34.03/4.65 sorti2(h(X12)) | ~sorti1(X12)). % 34.03/4.65 cnf(a13, assumption, % 34.03/4.65 X2 = h(X12)). % 34.03/4.65 cnf(c32, plain, % 34.03/4.65 $false, % 34.03/4.65 inference(strict_predicate_extension, [assumptions([a13])], [c4, c31])). % 34.03/4.65 cnf(c33, plain, % 34.03/4.65 ~sorti1(X12), % 34.03/4.65 inference(strict_predicate_extension, [assumptions([a13])], [c4, c31])). % 34.03/4.65 % 34.03/4.65 cnf(c34, plain, % 34.03/4.65 sorti1(X10)). % 34.03/4.65 cnf(a14, assumption, % 34.03/4.65 X12 = X10). % 34.03/4.65 cnf(c35, plain, % 34.03/4.65 $false, % 34.03/4.65 inference(predicate_reduction, [assumptions([a14])], [c33, c34])). % 34.03/4.65 % 34.03/4.65 cnf(c36, plain, % 34.03/4.65 sorti1(X10)). % 34.03/4.65 cnf(a15, assumption, % 34.03/4.65 X1 = X10). % 34.03/4.65 cnf(c37, plain, % 34.03/4.65 ~sorti1(X0), % 34.03/4.65 inference(predicate_reduction, [assumptions([a15])], [c3, c36])). % 34.03/4.65 % 34.03/4.65 cnf(c38, plain, % 34.03/4.65 sorti1(X10)). % 34.03/4.65 cnf(a16, assumption, % 34.03/4.65 X0 = X10). % 34.03/4.65 cnf(c39, plain, % 34.03/4.65 $false, % 34.03/4.65 inference(predicate_reduction, [assumptions([a16])], [c37, c38])). % 34.03/4.65 % 34.03/4.65 cnf(c40, plain, % 34.03/4.65 $false, % 34.03/4.65 inference(constraint_solving, [ % 34.03/4.65 bind(X0, sK0(X6)), % 34.03/4.65 bind(X1, sK0(X6)), % 34.03/4.65 bind(X2, h(X0)), % 34.03/4.65 bind(X3, h(op1(X0,X1))), % 34.03/4.65 bind(X4, op1(X0,X1)), % 34.03/4.65 bind(X5, sK1), % 34.03/4.65 bind(X6, j(X5)), % 34.03/4.65 bind(X7, j(X5)), % 34.03/4.65 bind(X8, sK1), % 34.03/4.65 bind(X9, sK0(X6)), % 34.03/4.65 bind(X10, sK0(X6)), % 34.03/4.65 bind(X11, j(X5)), % 34.03/4.65 bind(X12, sK0(X6)) % 34.03/4.65 ], % 34.03/4.65 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])). % 34.03/4.65 % 34.03/4.65 % SZS output end IncompleteProof %------------------------------------------------------------------------------