TSTP Solution File: NUM315+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM315+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 : n026.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:06 EDT 2022
% Result : Theorem 0.20s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM315+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n026.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 : Wed Jul 6 10:30:23 EDT 2022
% 0.13/0.34 % 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 ~sum(nn2,nn5,nn7)).
% 0.20/0.37 cnf(c1, plain,
% 0.20/0.37 ~sum(nn2,nn5,nn7),
% 0.20/0.37 inference(start, [], [c0])).
% 0.20/0.37
% 0.20/0.37 cnf(c2, axiom,
% 0.20/0.37 sum(X0,X1,X2) | ~rdn_translate(X2,rdn_neg(X3)) | ~rdn_add_with_carry(rdnn(n0),X4,X5,X3) | ~rdn_translate(X1,rdn_neg(X5)) | ~rdn_translate(X0,rdn_neg(X4))).
% 0.20/0.37 cnf(a0, assumption,
% 0.20/0.37 nn2 = X0).
% 0.20/0.37 cnf(a1, assumption,
% 0.20/0.37 nn5 = X1).
% 0.20/0.37 cnf(a2, assumption,
% 0.20/0.37 nn7 = X2).
% 0.20/0.37 cnf(c3, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.20/0.37 cnf(c4, plain,
% 0.20/0.37 ~rdn_translate(X2,rdn_neg(X3)) | ~rdn_add_with_carry(rdnn(n0),X4,X5,X3) | ~rdn_translate(X1,rdn_neg(X5)) | ~rdn_translate(X0,rdn_neg(X4)),
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.20/0.37
% 0.20/0.37 cnf(c5, axiom,
% 0.20/0.37 rdn_translate(nn7,rdn_neg(rdnn(n7)))).
% 0.20/0.37 cnf(a3, assumption,
% 0.20/0.37 X2 = nn7).
% 0.20/0.37 cnf(a4, assumption,
% 0.20/0.37 rdn_neg(X3) = rdn_neg(rdnn(n7))).
% 0.20/0.37 cnf(c6, plain,
% 0.20/0.37 ~rdn_add_with_carry(rdnn(n0),X4,X5,X3) | ~rdn_translate(X1,rdn_neg(X5)) | ~rdn_translate(X0,rdn_neg(X4)),
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 0.20/0.37 cnf(c7, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 0.20/0.37
% 0.20/0.37 cnf(c8, axiom,
% 0.20/0.37 rdn_add_with_carry(rdnn(X6),rdnn(X7),rdnn(X8),rdnn(X9)) | ~rdn_digit_add(rdnn(X10),rdnn(X6),rdnn(X9),rdnn(n0)) | ~rdn_digit_add(rdnn(X7),rdnn(X8),rdnn(X10),rdnn(n0))).
% 0.20/0.37 cnf(a5, assumption,
% 0.20/0.37 rdnn(n0) = rdnn(X6)).
% 0.20/0.37 cnf(a6, assumption,
% 0.20/0.37 X4 = rdnn(X7)).
% 0.20/0.37 cnf(a7, assumption,
% 0.20/0.37 X5 = rdnn(X8)).
% 0.20/0.37 cnf(a8, assumption,
% 0.20/0.37 X3 = rdnn(X9)).
% 0.20/0.37 cnf(c9, plain,
% 0.20/0.37 ~rdn_translate(X1,rdn_neg(X5)) | ~rdn_translate(X0,rdn_neg(X4)),
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a5, a6, a7, a8])], [c6, c8])).
% 0.20/0.37 cnf(c10, plain,
% 0.20/0.37 ~rdn_digit_add(rdnn(X10),rdnn(X6),rdnn(X9),rdnn(n0)) | ~rdn_digit_add(rdnn(X7),rdnn(X8),rdnn(X10),rdnn(n0)),
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a5, a6, a7, a8])], [c6, c8])).
% 0.20/0.37
% 0.20/0.37 cnf(c11, axiom,
% 0.20/0.37 rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0))).
% 0.20/0.37 cnf(a9, assumption,
% 0.20/0.37 rdnn(X10) = rdnn(n7)).
% 0.20/0.37 cnf(a10, assumption,
% 0.20/0.37 rdnn(X6) = rdnn(n0)).
% 0.20/0.37 cnf(a11, assumption,
% 0.20/0.37 rdnn(X9) = rdnn(n7)).
% 0.20/0.37 cnf(a12, assumption,
% 0.20/0.37 rdnn(n0) = rdnn(n0)).
% 0.20/0.37 cnf(c12, plain,
% 0.20/0.37 ~rdn_digit_add(rdnn(X7),rdnn(X8),rdnn(X10),rdnn(n0)),
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a9, a10, a11, a12])], [c10, c11])).
% 0.20/0.37 cnf(c13, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a9, a10, a11, a12])], [c10, c11])).
% 0.20/0.37
% 0.20/0.37 cnf(c14, axiom,
% 0.20/0.37 rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0))).
% 0.20/0.37 cnf(a13, assumption,
% 0.20/0.37 rdnn(X7) = rdnn(n2)).
% 0.20/0.37 cnf(a14, assumption,
% 0.20/0.37 rdnn(X8) = rdnn(n5)).
% 0.20/0.37 cnf(a15, assumption,
% 0.20/0.37 rdnn(X10) = rdnn(n7)).
% 0.20/0.37 cnf(a16, assumption,
% 0.20/0.37 rdnn(n0) = rdnn(n0)).
% 0.20/0.37 cnf(c15, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a13, a14, a15, a16])], [c12, c14])).
% 0.20/0.37 cnf(c16, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a13, a14, a15, a16])], [c12, c14])).
% 0.20/0.37
% 0.20/0.37 cnf(c17, axiom,
% 0.20/0.37 rdn_translate(nn5,rdn_neg(rdnn(n5)))).
% 0.20/0.37 cnf(a17, assumption,
% 0.20/0.37 X1 = nn5).
% 0.20/0.37 cnf(a18, assumption,
% 0.20/0.37 rdn_neg(X5) = rdn_neg(rdnn(n5))).
% 0.20/0.37 cnf(c18, plain,
% 0.20/0.37 ~rdn_translate(X0,rdn_neg(X4)),
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a17, a18])], [c9, c17])).
% 0.20/0.37 cnf(c19, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a17, a18])], [c9, c17])).
% 0.20/0.37
% 0.20/0.37 cnf(c20, axiom,
% 0.20/0.37 rdn_translate(nn2,rdn_neg(rdnn(n2)))).
% 0.20/0.37 cnf(a19, assumption,
% 0.20/0.37 X0 = nn2).
% 0.20/0.37 cnf(a20, assumption,
% 0.20/0.37 rdn_neg(X4) = rdn_neg(rdnn(n2))).
% 0.20/0.37 cnf(c21, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a19, a20])], [c18, c20])).
% 0.20/0.37 cnf(c22, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a19, a20])], [c18, c20])).
% 0.20/0.37
% 0.20/0.37 cnf(c23, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(constraint_solving, [
% 0.20/0.37 bind(X0, nn2),
% 0.20/0.37 bind(X1, nn5),
% 0.20/0.37 bind(X2, nn7),
% 0.20/0.37 bind(X3, rdnn(n7)),
% 0.20/0.37 bind(X4, rdnn(X7)),
% 0.20/0.37 bind(X5, rdnn(X8)),
% 0.20/0.37 bind(X6, n0),
% 0.20/0.37 bind(X7, n2),
% 0.20/0.37 bind(X8, n5),
% 0.20/0.37 bind(X9, n7),
% 0.20/0.37 bind(X10, n7)
% 0.20/0.37 ],
% 0.20/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])).
% 0.20/0.37
% 0.20/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------