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