%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM303+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n017.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 : Mon Jul 18 11:32:03 EDT 2022 % Result : Theorem 0.21s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : NUM303+1 : TPTP v8.1.0. Released v3.1.0. % 0.10/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n017.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 : Thu Jul 7 01:08:29 EDT 2022 % 0.13/0.34 % CPUTime : % 0.21/0.41 % SZS status Theorem % 0.21/0.41 % SZS output begin IncompleteProof % 0.21/0.41 cnf(c0, axiom, % 0.21/0.41 n21 = n31). % 0.21/0.41 cnf(c1, plain, % 0.21/0.41 n21 = n31, % 0.21/0.41 inference(start, [], [c0])). % 0.21/0.41 % 0.21/0.41 cnf(c2, axiom, % 0.21/0.41 rdn_translate(n31,rdn_pos(rdn(rdnn(n1),rdnn(n3))))). % 0.21/0.41 cnf(a0, assumption, % 0.21/0.41 n31 = n31). % 0.21/0.41 cnf(a1, assumption, % 0.21/0.41 n21 = X0). % 0.21/0.41 cnf(c3, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.41 cnf(c4, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.41 cnf(c5, plain, % 0.21/0.41 rdn_translate(X0,rdn_pos(rdn(rdnn(n1),rdnn(n3)))), % 0.21/0.41 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.41 % 0.21/0.41 cnf(c6, axiom, % 0.21/0.41 less(X1,X2) | ~rdn_positive_less(X3,X4) | ~rdn_translate(X2,rdn_pos(X4)) | ~rdn_translate(X1,rdn_pos(X3))). % 0.21/0.41 cnf(a2, assumption, % 0.21/0.41 X0 = X2). % 0.21/0.41 cnf(a3, assumption, % 0.21/0.41 rdn_pos(rdn(rdnn(n1),rdnn(n3))) = rdn_pos(X4)). % 0.21/0.41 cnf(c7, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 0.21/0.41 cnf(c8, plain, % 0.21/0.41 less(X1,X2) | ~rdn_positive_less(X3,X4) | ~rdn_translate(X1,rdn_pos(X3)), % 0.21/0.41 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 0.21/0.41 % 0.21/0.41 cnf(c9, axiom, % 0.21/0.41 ~less(X5,X5)). % 0.21/0.41 cnf(a4, assumption, % 0.21/0.41 X1 = X5). % 0.21/0.41 cnf(a5, assumption, % 0.21/0.41 X2 = X5). % 0.21/0.41 cnf(c10, plain, % 0.21/0.41 ~rdn_positive_less(X3,X4) | ~rdn_translate(X1,rdn_pos(X3)), % 0.21/0.41 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])). % 0.21/0.41 cnf(c11, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])). % 0.21/0.41 % 0.21/0.41 cnf(c12, axiom, % 0.21/0.41 rdn_positive_less(rdn(rdnn(X6),X7),rdn(rdnn(X8),X9)) | ~rdn_positive_less(X7,X9)). % 0.21/0.41 cnf(a6, assumption, % 0.21/0.41 X3 = rdn(rdnn(X6),X7)). % 0.21/0.41 cnf(a7, assumption, % 0.21/0.41 X4 = rdn(rdnn(X8),X9)). % 0.21/0.41 cnf(c13, plain, % 0.21/0.41 ~rdn_translate(X1,rdn_pos(X3)), % 0.21/0.41 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c12])). % 0.21/0.41 cnf(c14, plain, % 0.21/0.41 ~rdn_positive_less(X7,X9), % 0.21/0.41 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c12])). % 0.21/0.41 % 0.21/0.41 cnf(c15, axiom, % 0.21/0.41 rdn_positive_less(rdnn(n2),rdnn(n3))). % 0.21/0.41 cnf(a8, assumption, % 0.21/0.41 X7 = rdnn(n2)). % 0.21/0.41 cnf(a9, assumption, % 0.21/0.41 X9 = rdnn(n3)). % 0.21/0.41 cnf(c16, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_predicate_extension, [assumptions([a8, a9])], [c14, c15])). % 0.21/0.41 cnf(c17, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_predicate_extension, [assumptions([a8, a9])], [c14, c15])). % 0.21/0.41 % 0.21/0.41 cnf(c18, axiom, % 0.21/0.41 rdn_translate(n21,rdn_pos(rdn(rdnn(n1),rdnn(n2))))). % 0.21/0.41 cnf(a10, assumption, % 0.21/0.41 X1 = n21). % 0.21/0.41 cnf(a11, assumption, % 0.21/0.41 rdn_pos(X3) = rdn_pos(rdn(rdnn(n1),rdnn(n2)))). % 0.21/0.41 cnf(c19, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_predicate_extension, [assumptions([a10, a11])], [c13, c18])). % 0.21/0.41 cnf(c20, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_predicate_extension, [assumptions([a10, a11])], [c13, c18])). % 0.21/0.41 % 0.21/0.41 cnf(c21, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(constraint_solving, [ % 0.21/0.41 bind(X0, n21), % 0.21/0.41 bind(X1, n21), % 0.21/0.41 bind(X2, n21), % 0.21/0.41 bind(X3, rdn(rdnn(X6),X7)), % 0.21/0.41 bind(X4, rdn(rdnn(n1),rdnn(n3))), % 0.21/0.41 bind(X5, n21), % 0.21/0.41 bind(X6, n1), % 0.21/0.41 bind(X7, rdnn(n2)), % 0.21/0.41 bind(X8, n1), % 0.21/0.41 bind(X9, rdnn(n3)) % 0.21/0.41 ], % 0.21/0.41 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.21/0.41 % 0.21/0.41 % SZS output end IncompleteProof %------------------------------------------------------------------------------