TSTP Solution File: NUM839+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM839+1 : TPTP v8.1.0. Released v4.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 : n015.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:37:00 EDT 2022
% Result : Theorem 0.13s 0.38s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM839+1 : TPTP v8.1.0. Released v4.1.0.
% 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jul 6 09:05:48 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 % SZS status Theorem
% 0.13/0.38 % SZS output begin IncompleteProof
% 0.13/0.38 cnf(c0, axiom,
% 0.13/0.38 ~greater(vd328,vd329)).
% 0.13/0.38 cnf(c1, plain,
% 0.13/0.38 ~greater(vd328,vd329),
% 0.13/0.38 inference(start, [], [c0])).
% 0.13/0.38
% 0.13/0.38 cnf(c2, axiom,
% 0.13/0.38 less(X0,X1) | greater(X0,X1) | X0 = X1).
% 0.13/0.38 cnf(a0, assumption,
% 0.13/0.38 vd328 = X0).
% 0.13/0.38 cnf(a1, assumption,
% 0.13/0.38 vd329 = X1).
% 0.13/0.38 cnf(c3, plain,
% 0.13/0.38 $false,
% 0.13/0.38 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.38 cnf(c4, plain,
% 0.13/0.38 less(X0,X1) | X0 = X1,
% 0.13/0.38 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.38
% 0.13/0.38 cnf(c5, axiom,
% 0.13/0.38 less(vplus(X2,X3),vplus(X4,X3)) | ~less(X2,X4)).
% 0.13/0.38 cnf(a2, assumption,
% 0.13/0.38 X0 = X2).
% 0.13/0.38 cnf(a3, assumption,
% 0.13/0.38 X1 = X4).
% 0.13/0.38 cnf(c6, plain,
% 0.13/0.38 X0 = X1,
% 0.13/0.38 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.38 cnf(c7, plain,
% 0.13/0.38 less(vplus(X2,X3),vplus(X4,X3)),
% 0.13/0.38 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.38
% 0.13/0.38 cnf(c8, axiom,
% 0.13/0.38 ~less(X5,X6) | ~greater(X5,X6)).
% 0.13/0.38 cnf(a4, assumption,
% 0.13/0.38 vplus(X2,X3) = X5).
% 0.13/0.38 cnf(a5, assumption,
% 0.13/0.38 vplus(X4,X3) = X6).
% 0.13/0.38 cnf(c9, plain,
% 0.13/0.38 $false,
% 0.13/0.38 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.13/0.38 cnf(c10, plain,
% 0.13/0.38 ~greater(X5,X6),
% 0.13/0.38 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.13/0.38
% 0.13/0.38 cnf(c11, axiom,
% 0.13/0.38 greater(vplus(vd328,vd330),vplus(vd329,vd330))).
% 0.13/0.38 cnf(a6, assumption,
% 0.13/0.38 X5 = vplus(vd328,vd330)).
% 0.13/0.38 cnf(a7, assumption,
% 0.13/0.38 X6 = vplus(vd329,vd330)).
% 0.13/0.38 cnf(c12, plain,
% 0.13/0.38 $false,
% 0.13/0.38 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.13/0.38 cnf(c13, plain,
% 0.13/0.38 $false,
% 0.13/0.38 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.13/0.38
% 0.13/0.38 cnf(c14, axiom,
% 0.13/0.38 greater(vplus(vd328,vd330),vplus(vd329,vd330))).
% 0.13/0.38 cnf(a8, assumption,
% 0.13/0.38 vd329 = X1).
% 0.13/0.38 cnf(c15, plain,
% 0.13/0.38 $false,
% 0.13/0.38 inference(strict_subterm_extension, [assumptions([a8])], [c6, c14])).
% 0.13/0.38 cnf(c16, plain,
% 0.13/0.38 $false,
% 0.13/0.38 inference(strict_subterm_extension, [assumptions([a8])], [c6, c14])).
% 0.13/0.38 cnf(c17, plain,
% 0.13/0.38 greater(vplus(vd328,vd330),vplus(X0,vd330)),
% 0.13/0.38 inference(strict_subterm_extension, [assumptions([a8])], [c6, c14])).
% 0.13/0.38
% 0.13/0.38 cnf(c18, axiom,
% 0.13/0.38 ~greater(X7,X7)).
% 0.13/0.38 cnf(a9, assumption,
% 0.13/0.38 vplus(vd328,vd330) = X7).
% 0.13/0.38 cnf(a10, assumption,
% 0.13/0.38 vplus(X0,vd330) = X7).
% 0.13/0.38 cnf(c19, plain,
% 0.13/0.38 $false,
% 0.13/0.38 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])).
% 0.13/0.38 cnf(c20, plain,
% 0.13/0.38 $false,
% 0.13/0.38 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])).
% 0.13/0.38
% 0.13/0.38 cnf(c21, plain,
% 0.13/0.38 $false,
% 0.13/0.38 inference(constraint_solving, [
% 0.13/0.38 bind(X0, vd328),
% 0.13/0.38 bind(X1, vd329),
% 0.13/0.38 bind(X2, vd328),
% 0.13/0.38 bind(X3, vd330),
% 0.13/0.38 bind(X4, vd329),
% 0.13/0.38 bind(X5, vplus(X2,X3)),
% 0.13/0.38 bind(X6, vplus(X4,X3)),
% 0.13/0.38 bind(X7, vplus(vd328,vd330))
% 0.13/0.38 ],
% 0.13/0.38 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.13/0.38
% 0.13/0.38 % SZS output end IncompleteProof
%------------------------------------------------------------------------------