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