TSTP Solution File: NUM843+2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM843+2 : 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 : n005.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:03 EDT 2022
% Result : Theorem 0.20s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM843+2 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n005.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 07:39:37 EDT 2022
% 0.12/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 ~greater(vd390,vd391)).
% 0.20/0.37 cnf(c1, plain,
% 0.20/0.37 ~greater(vd390,vd391),
% 0.20/0.37 inference(start, [], [c0])).
% 0.20/0.37
% 0.20/0.37 cnf(c2, axiom,
% 0.20/0.37 less(X0,X1) | greater(X0,X1) | X0 = X1).
% 0.20/0.37 cnf(a0, assumption,
% 0.20/0.37 vd390 = X0).
% 0.20/0.37 cnf(a1, assumption,
% 0.20/0.37 vd391 = X1).
% 0.20/0.37 cnf(c3, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.37 cnf(c4, plain,
% 0.20/0.37 less(X0,X1) | X0 = X1,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.37
% 0.20/0.37 cnf(c5, axiom,
% 0.20/0.37 leq(X2,X3) | ~less(X2,X3)).
% 0.20/0.37 cnf(a2, assumption,
% 0.20/0.37 X0 = X2).
% 0.20/0.37 cnf(a3, assumption,
% 0.20/0.37 X1 = X3).
% 0.20/0.37 cnf(c6, plain,
% 0.20/0.37 X0 = X1,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.37 cnf(c7, plain,
% 0.20/0.37 leq(X2,X3),
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.37
% 0.20/0.37 cnf(c8, axiom,
% 0.20/0.37 ~leq(vd390,vd391)).
% 0.20/0.37 cnf(a4, assumption,
% 0.20/0.37 X2 = vd390).
% 0.20/0.37 cnf(a5, assumption,
% 0.20/0.37 X3 = vd391).
% 0.20/0.37 cnf(c9, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.20/0.37 cnf(c10, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.20/0.37
% 0.20/0.37 cnf(c11, axiom,
% 0.20/0.37 ~leq(vd390,vd391)).
% 0.20/0.37 cnf(a6, assumption,
% 0.20/0.37 vd391 = X1).
% 0.20/0.37 cnf(c12, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_subterm_extension, [assumptions([a6])], [c6, c11])).
% 0.20/0.37 cnf(c13, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_subterm_extension, [assumptions([a6])], [c6, c11])).
% 0.20/0.37 cnf(c14, plain,
% 0.20/0.37 ~leq(vd390,X0),
% 0.20/0.37 inference(strict_subterm_extension, [assumptions([a6])], [c6, c11])).
% 0.20/0.37
% 0.20/0.37 cnf(c15, axiom,
% 0.20/0.37 leq(X4,X4)).
% 0.20/0.37 cnf(a7, assumption,
% 0.20/0.37 vd390 = X4).
% 0.20/0.37 cnf(a8, assumption,
% 0.20/0.37 X0 = X4).
% 0.20/0.37 cnf(c16, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c14, c15])).
% 0.20/0.37 cnf(c17, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c14, c15])).
% 0.20/0.37
% 0.20/0.37 cnf(c18, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(constraint_solving, [
% 0.20/0.37 bind(X0, vd390),
% 0.20/0.37 bind(X1, vd391),
% 0.20/0.37 bind(X2, vd390),
% 0.20/0.37 bind(X3, vd391),
% 0.20/0.37 bind(X4, vd390)
% 0.20/0.37 ],
% 0.20/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.20/0.37
% 0.20/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------