TSTP Solution File: NUM294+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM294+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 : n011.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.22s 0.58s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM294+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 23:59:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/0.58 % SZS status Theorem
% 0.22/0.58 % SZS output begin IncompleteProof
% 0.22/0.58 cnf(c0, axiom,
% 0.22/0.58 ~less(n12,X0)).
% 0.22/0.58 cnf(c1, plain,
% 0.22/0.58 ~less(n12,X0),
% 0.22/0.58 inference(start, [], [c0])).
% 0.22/0.58
% 0.22/0.58 cnf(c2, axiom,
% 0.22/0.58 less(X1,X2) | ~rdn_positive_less(X3,X4) | ~rdn_translate(X2,rdn_pos(X4)) | ~rdn_translate(X1,rdn_pos(X3))).
% 0.22/0.58 cnf(a0, assumption,
% 0.22/0.58 n12 = X1).
% 0.22/0.58 cnf(a1, assumption,
% 0.22/0.58 X0 = X2).
% 0.22/0.58 cnf(c3, plain,
% 0.22/0.58 $false,
% 0.22/0.58 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.22/0.58 cnf(c4, plain,
% 0.22/0.58 ~rdn_positive_less(X3,X4) | ~rdn_translate(X2,rdn_pos(X4)) | ~rdn_translate(X1,rdn_pos(X3)),
% 0.22/0.58 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.22/0.58
% 0.22/0.58 cnf(c5, axiom,
% 0.22/0.58 rdn_positive_less(rdn(rdnn(X5),X6),rdn(rdnn(X7),X8)) | ~rdn_positive_less(X6,X8)).
% 0.22/0.58 cnf(a2, assumption,
% 0.22/0.58 X3 = rdn(rdnn(X5),X6)).
% 0.22/0.58 cnf(a3, assumption,
% 0.22/0.58 X4 = rdn(rdnn(X7),X8)).
% 0.22/0.58 cnf(c6, plain,
% 0.22/0.58 ~rdn_translate(X2,rdn_pos(X4)) | ~rdn_translate(X1,rdn_pos(X3)),
% 0.22/0.58 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.22/0.58 cnf(c7, plain,
% 0.22/0.58 ~rdn_positive_less(X6,X8),
% 0.22/0.58 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.22/0.58
% 0.22/0.58 cnf(c8, axiom,
% 0.22/0.58 rdn_positive_less(rdnn(n1),rdnn(n2))).
% 0.22/0.58 cnf(a4, assumption,
% 0.22/0.58 X6 = rdnn(n1)).
% 0.22/0.58 cnf(a5, assumption,
% 0.22/0.58 X8 = rdnn(n2)).
% 0.22/0.58 cnf(c9, plain,
% 0.22/0.58 $false,
% 0.22/0.58 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.22/0.58 cnf(c10, plain,
% 0.22/0.58 $false,
% 0.22/0.58 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.22/0.58
% 0.22/0.58 cnf(c11, axiom,
% 0.22/0.58 rdn_translate(n26,rdn_pos(rdn(rdnn(n6),rdnn(n2))))).
% 0.22/0.58 cnf(a6, assumption,
% 0.22/0.58 X2 = n26).
% 0.22/0.58 cnf(a7, assumption,
% 0.22/0.58 rdn_pos(X4) = rdn_pos(rdn(rdnn(n6),rdnn(n2)))).
% 0.22/0.58 cnf(c12, plain,
% 0.22/0.58 ~rdn_translate(X1,rdn_pos(X3)),
% 0.22/0.58 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])).
% 0.22/0.58 cnf(c13, plain,
% 0.22/0.58 $false,
% 0.22/0.58 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])).
% 0.22/0.58
% 0.22/0.58 cnf(c14, axiom,
% 0.22/0.58 rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1))))).
% 0.22/0.58 cnf(a8, assumption,
% 0.22/0.58 X1 = n12).
% 0.22/0.58 cnf(a9, assumption,
% 0.22/0.58 rdn_pos(X3) = rdn_pos(rdn(rdnn(n2),rdnn(n1)))).
% 0.22/0.58 cnf(c15, plain,
% 0.22/0.58 $false,
% 0.22/0.58 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 0.22/0.58 cnf(c16, plain,
% 0.22/0.58 $false,
% 0.22/0.58 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 0.22/0.58
% 0.22/0.58 cnf(c17, plain,
% 0.22/0.58 $false,
% 0.22/0.58 inference(constraint_solving, [
% 0.22/0.58 bind(X0, n26),
% 0.22/0.58 bind(X1, n12),
% 0.22/0.58 bind(X2, n26),
% 0.22/0.58 bind(X3, rdn(rdnn(X5),X6)),
% 0.22/0.58 bind(X4, rdn(rdnn(X7),X8)),
% 0.22/0.58 bind(X5, n2),
% 0.22/0.58 bind(X6, rdnn(n1)),
% 0.22/0.58 bind(X7, n6),
% 0.22/0.58 bind(X8, rdnn(n2))
% 0.22/0.58 ],
% 0.22/0.58 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 0.22/0.58
% 0.22/0.58 % SZS output end IncompleteProof
%------------------------------------------------------------------------------