%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM295+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 : n029.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:00 EDT 2022 % Result : Theorem 0.19s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM295+1 : TPTP v8.1.0. Released v3.1.0. % 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.34 % Computer : n029.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 : Thu Jul 7 06:16:28 EDT 2022 % 0.14/0.34 % CPUTime : % 0.19/0.38 % SZS status Theorem % 0.19/0.38 % SZS output begin IncompleteProof % 0.19/0.38 cnf(c0, axiom, % 0.19/0.38 ~less(X0,X1)). % 0.19/0.38 cnf(c1, plain, % 0.19/0.38 ~less(X0,X1), % 0.19/0.38 inference(start, [], [c0])). % 0.19/0.38 % 0.19/0.38 cnf(c2, axiom, % 0.19/0.38 less(X2,X3) | ~rdn_translate(X3,rdn_pos(X4)) | ~rdn_translate(X2,rdn_neg(X5))). % 0.19/0.38 cnf(a0, assumption, % 0.19/0.38 X0 = X2). % 0.19/0.38 cnf(a1, assumption, % 0.19/0.38 X1 = X3). % 0.19/0.38 cnf(c3, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.38 cnf(c4, plain, % 0.19/0.38 ~rdn_translate(X3,rdn_pos(X4)) | ~rdn_translate(X2,rdn_neg(X5)), % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.38 % 0.19/0.38 cnf(c5, axiom, % 0.19/0.38 rdn_translate(n5,rdn_pos(rdnn(n5)))). % 0.19/0.38 cnf(a2, assumption, % 0.19/0.38 X3 = n5). % 0.19/0.38 cnf(a3, assumption, % 0.19/0.38 rdn_pos(X4) = rdn_pos(rdnn(n5))). % 0.19/0.38 cnf(c6, plain, % 0.19/0.38 ~rdn_translate(X2,rdn_neg(X5)), % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.19/0.38 cnf(c7, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.19/0.38 % 0.19/0.38 cnf(c8, axiom, % 0.19/0.38 rdn_translate(nn1,rdn_neg(rdnn(n1)))). % 0.19/0.38 cnf(a4, assumption, % 0.19/0.38 X2 = nn1). % 0.19/0.38 cnf(a5, assumption, % 0.19/0.38 rdn_neg(X5) = rdn_neg(rdnn(n1))). % 0.19/0.38 cnf(c9, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.19/0.38 cnf(c10, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.19/0.38 % 0.19/0.38 cnf(c11, plain, % 0.19/0.38 $false, % 0.19/0.38 inference(constraint_solving, [ % 0.19/0.38 bind(X0, nn1), % 0.19/0.38 bind(X1, n5), % 0.19/0.38 bind(X2, nn1), % 0.19/0.38 bind(X3, n5), % 0.19/0.38 bind(X4, rdnn(n5)), % 0.19/0.38 bind(X5, rdnn(n1)) % 0.19/0.38 ], % 0.19/0.38 [a0, a1, a2, a3, a4, a5])). % 0.19/0.38 % 0.19/0.38 % SZS output end IncompleteProof %------------------------------------------------------------------------------