TSTP Solution File: NUM299+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM299+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 : n013.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:02 EDT 2022
% Result : Theorem 1.28s 0.52s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM299+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 5 18:13:14 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.28/0.52 % SZS status Theorem
% 1.28/0.52 % SZS output begin IncompleteProof
% 1.28/0.52 cnf(c0, axiom,
% 1.28/0.52 less(nn2,nn4)).
% 1.28/0.52 cnf(c1, plain,
% 1.28/0.52 less(nn2,nn4),
% 1.28/0.52 inference(start, [], [c0])).
% 1.28/0.52
% 1.28/0.52 cnf(c2, axiom,
% 1.28/0.52 ~less(X0,X1) | ~less(X1,X0)).
% 1.28/0.52 cnf(a0, assumption,
% 1.28/0.52 nn2 = X1).
% 1.28/0.52 cnf(a1, assumption,
% 1.28/0.52 nn4 = X0).
% 1.28/0.52 cnf(c3, plain,
% 1.28/0.52 $false,
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.28/0.52 cnf(c4, plain,
% 1.28/0.52 ~less(X0,X1),
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.28/0.52
% 1.28/0.52 cnf(c5, axiom,
% 1.28/0.52 less(X2,X3) | ~rdn_positive_less(X4,X5) | ~rdn_translate(X3,rdn_neg(X4)) | ~rdn_translate(X2,rdn_neg(X5))).
% 1.28/0.52 cnf(a2, assumption,
% 1.28/0.52 X0 = X2).
% 1.28/0.52 cnf(a3, assumption,
% 1.28/0.52 X1 = X3).
% 1.28/0.52 cnf(c6, plain,
% 1.28/0.52 $false,
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 1.28/0.52 cnf(c7, plain,
% 1.28/0.52 ~rdn_positive_less(X4,X5) | ~rdn_translate(X3,rdn_neg(X4)) | ~rdn_translate(X2,rdn_neg(X5)),
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 1.28/0.52
% 1.28/0.52 cnf(c8, axiom,
% 1.28/0.52 rdn_positive_less(rdnn(X6),rdnn(X7)) | ~rdn_positive_less(rdnn(X8),rdnn(X7)) | ~rdn_positive_less(rdnn(X6),rdnn(X8))).
% 1.28/0.52 cnf(a4, assumption,
% 1.28/0.52 X4 = rdnn(X6)).
% 1.28/0.52 cnf(a5, assumption,
% 1.28/0.52 X5 = rdnn(X7)).
% 1.28/0.52 cnf(c9, plain,
% 1.28/0.52 ~rdn_translate(X3,rdn_neg(X4)) | ~rdn_translate(X2,rdn_neg(X5)),
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 1.28/0.52 cnf(c10, plain,
% 1.28/0.52 ~rdn_positive_less(rdnn(X8),rdnn(X7)) | ~rdn_positive_less(rdnn(X6),rdnn(X8)),
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 1.28/0.52
% 1.28/0.52 cnf(c11, axiom,
% 1.28/0.52 rdn_positive_less(rdnn(n3),rdnn(n4))).
% 1.28/0.52 cnf(a6, assumption,
% 1.28/0.52 rdnn(X8) = rdnn(n3)).
% 1.28/0.52 cnf(a7, assumption,
% 1.28/0.52 rdnn(X7) = rdnn(n4)).
% 1.28/0.52 cnf(c12, plain,
% 1.28/0.52 ~rdn_positive_less(rdnn(X6),rdnn(X8)),
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 1.28/0.52 cnf(c13, plain,
% 1.28/0.52 $false,
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 1.28/0.52
% 1.28/0.52 cnf(c14, axiom,
% 1.28/0.52 rdn_positive_less(rdnn(n2),rdnn(n3))).
% 1.28/0.52 cnf(a8, assumption,
% 1.28/0.52 rdnn(X6) = rdnn(n2)).
% 1.28/0.52 cnf(a9, assumption,
% 1.28/0.52 rdnn(X8) = rdnn(n3)).
% 1.28/0.52 cnf(c15, plain,
% 1.28/0.52 $false,
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 1.28/0.52 cnf(c16, plain,
% 1.28/0.52 $false,
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 1.28/0.52
% 1.28/0.52 cnf(c17, axiom,
% 1.28/0.52 rdn_translate(nn2,rdn_neg(rdnn(n2)))).
% 1.28/0.52 cnf(a10, assumption,
% 1.28/0.52 X3 = nn2).
% 1.28/0.52 cnf(a11, assumption,
% 1.28/0.52 rdn_neg(X4) = rdn_neg(rdnn(n2))).
% 1.28/0.52 cnf(c18, plain,
% 1.28/0.52 ~rdn_translate(X2,rdn_neg(X5)),
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a10, a11])], [c9, c17])).
% 1.28/0.52 cnf(c19, plain,
% 1.28/0.52 $false,
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a10, a11])], [c9, c17])).
% 1.28/0.52
% 1.28/0.52 cnf(c20, axiom,
% 1.28/0.52 rdn_translate(nn4,rdn_neg(rdnn(n4)))).
% 1.28/0.52 cnf(a12, assumption,
% 1.28/0.52 X2 = nn4).
% 1.28/0.52 cnf(a13, assumption,
% 1.28/0.52 rdn_neg(X5) = rdn_neg(rdnn(n4))).
% 1.28/0.52 cnf(c21, plain,
% 1.28/0.52 $false,
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c20])).
% 1.28/0.52 cnf(c22, plain,
% 1.28/0.52 $false,
% 1.28/0.52 inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c20])).
% 1.28/0.52
% 1.28/0.52 cnf(c23, plain,
% 1.28/0.52 $false,
% 1.28/0.52 inference(constraint_solving, [
% 1.28/0.52 bind(X0, nn4),
% 1.28/0.52 bind(X1, nn2),
% 1.28/0.52 bind(X2, nn4),
% 1.28/0.52 bind(X3, nn2),
% 1.28/0.52 bind(X4, rdnn(X6)),
% 1.28/0.52 bind(X5, rdnn(X7)),
% 1.28/0.52 bind(X6, n2),
% 1.28/0.52 bind(X7, n4),
% 1.28/0.52 bind(X8, n3)
% 1.28/0.52 ],
% 1.28/0.52 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 1.28/0.52
% 1.28/0.52 % SZS output end IncompleteProof
%------------------------------------------------------------------------------