TSTP Solution File: NUM298+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM298+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:01 EDT 2022
% Result : Theorem 0.22s 0.41s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.14 % Problem : NUM298+1 : TPTP v8.1.0. Released v3.1.0.
% 0.05/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.37 % Computer : n013.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Fri Jul 8 01:38:44 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.22/0.41 % SZS status Theorem
% 0.22/0.41 % SZS output begin IncompleteProof
% 0.22/0.41 cnf(c0, axiom,
% 0.22/0.41 less(n2,nn2)).
% 0.22/0.41 cnf(c1, plain,
% 0.22/0.41 less(n2,nn2),
% 0.22/0.41 inference(start, [], [c0])).
% 0.22/0.41
% 0.22/0.41 cnf(c2, axiom,
% 0.22/0.41 ~less(X0,X1) | ~less(X1,X0)).
% 0.22/0.41 cnf(a0, assumption,
% 0.22/0.41 n2 = X1).
% 0.22/0.41 cnf(a1, assumption,
% 0.22/0.41 nn2 = X0).
% 0.22/0.41 cnf(c3, plain,
% 0.22/0.41 $false,
% 0.22/0.41 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.22/0.41 cnf(c4, plain,
% 0.22/0.41 ~less(X0,X1),
% 0.22/0.41 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.22/0.41
% 0.22/0.41 cnf(c5, axiom,
% 0.22/0.41 less(X2,X3) | ~rdn_translate(X3,rdn_pos(X4)) | ~rdn_translate(X2,rdn_neg(X5))).
% 0.22/0.41 cnf(a2, assumption,
% 0.22/0.41 X0 = X2).
% 0.22/0.41 cnf(a3, assumption,
% 0.22/0.41 X1 = X3).
% 0.22/0.41 cnf(c6, plain,
% 0.22/0.41 $false,
% 0.22/0.41 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.22/0.41 cnf(c7, plain,
% 0.22/0.41 ~rdn_translate(X3,rdn_pos(X4)) | ~rdn_translate(X2,rdn_neg(X5)),
% 0.22/0.41 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.22/0.41
% 0.22/0.41 cnf(c8, axiom,
% 0.22/0.41 rdn_translate(n2,rdn_pos(rdnn(n2)))).
% 0.22/0.41 cnf(a4, assumption,
% 0.22/0.41 X3 = n2).
% 0.22/0.41 cnf(a5, assumption,
% 0.22/0.41 rdn_pos(X4) = rdn_pos(rdnn(n2))).
% 0.22/0.41 cnf(c9, plain,
% 0.22/0.41 ~rdn_translate(X2,rdn_neg(X5)),
% 0.22/0.41 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.22/0.41 cnf(c10, plain,
% 0.22/0.41 $false,
% 0.22/0.41 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.22/0.41
% 0.22/0.41 cnf(c11, axiom,
% 0.22/0.41 rdn_translate(nn2,rdn_neg(rdnn(n2)))).
% 0.22/0.41 cnf(a6, assumption,
% 0.22/0.41 X2 = nn2).
% 0.22/0.41 cnf(a7, assumption,
% 0.22/0.41 rdn_neg(X5) = rdn_neg(rdnn(n2))).
% 0.22/0.41 cnf(c12, plain,
% 0.22/0.41 $false,
% 0.22/0.41 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.22/0.41 cnf(c13, plain,
% 0.22/0.41 $false,
% 0.22/0.41 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.22/0.41
% 0.22/0.41 cnf(c14, plain,
% 0.22/0.41 $false,
% 0.22/0.41 inference(constraint_solving, [
% 0.22/0.41 bind(X0, nn2),
% 0.22/0.41 bind(X1, n2),
% 0.22/0.41 bind(X2, nn2),
% 0.22/0.41 bind(X3, n2),
% 0.22/0.41 bind(X4, rdnn(n2)),
% 0.22/0.41 bind(X5, rdnn(n2))
% 0.22/0.41 ],
% 0.22/0.41 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.22/0.41
% 0.22/0.41 % SZS output end IncompleteProof
%------------------------------------------------------------------------------