%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM302+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 : n025.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.20s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM302+1 : TPTP v8.1.0. Released v3.1.0. % 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n025.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 Jul 6 01:53:42 EDT 2022 % 0.12/0.33 % CPUTime : % 0.20/0.37 % SZS status Theorem % 0.20/0.37 % SZS output begin IncompleteProof % 0.20/0.37 cnf(c0, axiom, % 0.20/0.37 ~less(nn2,X0)). % 0.20/0.37 cnf(c1, plain, % 0.20/0.37 ~less(nn2,X0), % 0.20/0.37 inference(start, [], [c0])). % 0.20/0.37 % 0.20/0.37 cnf(c2, axiom, % 0.20/0.37 less(X1,X2) | ~rdn_translate(X2,rdn_pos(X3)) | ~rdn_translate(X1,rdn_neg(X4))). % 0.20/0.37 cnf(a0, assumption, % 0.20/0.37 nn2 = X1). % 0.20/0.37 cnf(a1, assumption, % 0.20/0.37 X0 = X2). % 0.20/0.37 cnf(c3, plain, % 0.20/0.37 $false, % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.37 cnf(c4, plain, % 0.20/0.37 ~rdn_translate(X2,rdn_pos(X3)) | ~rdn_translate(X1,rdn_neg(X4)), % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.37 % 0.20/0.37 cnf(c5, axiom, % 0.20/0.37 rdn_translate(n9,rdn_pos(rdnn(n9)))). % 0.20/0.37 cnf(a2, assumption, % 0.20/0.37 X2 = n9). % 0.20/0.37 cnf(a3, assumption, % 0.20/0.37 rdn_pos(X3) = rdn_pos(rdnn(n9))). % 0.20/0.37 cnf(c6, plain, % 0.20/0.37 ~rdn_translate(X1,rdn_neg(X4)), % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.37 cnf(c7, plain, % 0.20/0.37 $false, % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.37 % 0.20/0.37 cnf(c8, axiom, % 0.20/0.37 rdn_translate(nn2,rdn_neg(rdnn(n2)))). % 0.20/0.37 cnf(a4, assumption, % 0.20/0.37 X1 = nn2). % 0.20/0.37 cnf(a5, assumption, % 0.20/0.37 rdn_neg(X4) = rdn_neg(rdnn(n2))). % 0.20/0.37 cnf(c9, plain, % 0.20/0.37 $false, % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.20/0.37 cnf(c10, plain, % 0.20/0.37 $false, % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.20/0.37 % 0.20/0.37 cnf(c11, plain, % 0.20/0.37 $false, % 0.20/0.37 inference(constraint_solving, [ % 0.20/0.37 bind(X0, n9), % 0.20/0.37 bind(X1, nn2), % 0.20/0.37 bind(X2, n9), % 0.20/0.37 bind(X3, rdnn(n9)), % 0.20/0.37 bind(X4, rdnn(n2)) % 0.20/0.37 ], % 0.20/0.37 [a0, a1, a2, a3, a4, a5])). % 0.20/0.37 % 0.20/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------