TSTP Solution File: NUM854+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM854+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 : n020.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:10 EDT 2022
% Result : Theorem 0.14s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : NUM854+1 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jul 7 04:58:14 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.37 % SZS status Theorem
% 0.14/0.37 % SZS output begin IncompleteProof
% 0.14/0.37 cnf(c0, axiom,
% 0.14/0.37 ~greater(vmul(vd508,vd511),vmul(vd509,vd511))).
% 0.14/0.37 cnf(c1, plain,
% 0.14/0.37 ~greater(vmul(vd508,vd511),vmul(vd509,vd511)),
% 0.14/0.37 inference(start, [], [c0])).
% 0.14/0.37
% 0.14/0.37 cnf(c2, axiom,
% 0.14/0.37 greater(vmul(X0,X1),vmul(X2,X1)) | ~greater(X0,X2)).
% 0.14/0.37 cnf(a0, assumption,
% 0.14/0.37 vmul(vd508,vd511) = vmul(X0,X1)).
% 0.14/0.37 cnf(a1, assumption,
% 0.14/0.37 vmul(vd509,vd511) = vmul(X2,X1)).
% 0.14/0.37 cnf(c3, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.37 cnf(c4, plain,
% 0.14/0.37 ~greater(X0,X2),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.37
% 0.14/0.37 cnf(c5, axiom,
% 0.14/0.37 greater(vd508,vd509)).
% 0.14/0.37 cnf(a2, assumption,
% 0.14/0.37 X0 = vd508).
% 0.14/0.37 cnf(a3, assumption,
% 0.14/0.37 X2 = vd509).
% 0.14/0.37 cnf(c6, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.37 cnf(c7, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.37
% 0.14/0.37 cnf(c8, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(constraint_solving, [
% 0.14/0.37 bind(X0, vd508),
% 0.14/0.37 bind(X1, vd511),
% 0.14/0.37 bind(X2, vd509)
% 0.14/0.37 ],
% 0.14/0.37 [a0, a1, a2, a3])).
% 0.14/0.37
% 0.14/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------