TSTP Solution File: NUM464+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM464+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n026.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:33:08 EDT 2022
% Result : Theorem 0.14s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM464+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.33 % Computer : n026.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Tue Jul 5 11:46:22 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.14/0.36 % SZS status Theorem
% 0.14/0.36 % SZS output begin IncompleteProof
% 0.14/0.36 cnf(c0, axiom,
% 0.14/0.36 ~sdtlseqdt0(sz10,xm)).
% 0.14/0.36 cnf(c1, plain,
% 0.14/0.36 ~sdtlseqdt0(sz10,xm),
% 0.14/0.36 inference(start, [], [c0])).
% 0.14/0.36
% 0.14/0.36 cnf(c2, axiom,
% 0.14/0.36 sdtlseqdt0(sz10,X0) | sz10 = X0 | sz00 = X0 | ~aNaturalNumber0(X0)).
% 0.14/0.36 cnf(a0, assumption,
% 0.14/0.36 sz10 = sz10).
% 0.14/0.36 cnf(a1, assumption,
% 0.14/0.36 xm = X0).
% 0.14/0.36 cnf(c3, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.36 cnf(c4, plain,
% 0.14/0.36 sz10 = X0 | sz00 = X0 | ~aNaturalNumber0(X0),
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.36
% 0.14/0.36 cnf(c5, plain,
% 0.14/0.36 ~sdtlseqdt0(sz10,xm)).
% 0.14/0.36 cnf(a2, assumption,
% 0.14/0.36 xm = X0).
% 0.14/0.36 cnf(a3, assumption,
% 0.14/0.36 sz10 = X1).
% 0.14/0.36 cnf(c6, plain,
% 0.14/0.36 sz00 = X0 | ~aNaturalNumber0(X0),
% 0.14/0.36 inference(subterm_reduction, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.36 cnf(c7, plain,
% 0.14/0.36 ~sdtlseqdt0(sz10,X1),
% 0.14/0.36 inference(subterm_reduction, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.36
% 0.14/0.36 cnf(c8, axiom,
% 0.14/0.36 sdtlseqdt0(X2,X2) | ~aNaturalNumber0(X2)).
% 0.14/0.36 cnf(a4, assumption,
% 0.14/0.36 sz10 = X2).
% 0.14/0.36 cnf(a5, assumption,
% 0.14/0.36 X1 = X2).
% 0.14/0.36 cnf(c9, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.14/0.36 cnf(c10, plain,
% 0.14/0.36 ~aNaturalNumber0(X2),
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.14/0.36
% 0.14/0.36 cnf(c11, axiom,
% 0.14/0.36 aNaturalNumber0(sz10)).
% 0.14/0.36 cnf(a6, assumption,
% 0.14/0.36 X2 = sz10).
% 0.14/0.36 cnf(c12, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])).
% 0.14/0.36 cnf(c13, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])).
% 0.14/0.36
% 0.14/0.36 cnf(c14, axiom,
% 0.14/0.36 sz00 != xm).
% 0.14/0.36 cnf(a7, assumption,
% 0.14/0.36 xm = X0).
% 0.14/0.36 cnf(a8, assumption,
% 0.14/0.36 sz00 = X3).
% 0.14/0.36 cnf(c15, plain,
% 0.14/0.36 ~aNaturalNumber0(X0),
% 0.14/0.36 inference(strict_subterm_extension, [assumptions([a7, a8])], [c6, c14])).
% 0.14/0.36 cnf(c16, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_subterm_extension, [assumptions([a7, a8])], [c6, c14])).
% 0.14/0.36 cnf(c17, plain,
% 0.14/0.36 sz00 != X3,
% 0.14/0.36 inference(strict_subterm_extension, [assumptions([a7, a8])], [c6, c14])).
% 0.14/0.36
% 0.14/0.36 cnf(a9, assumption,
% 0.14/0.36 sz00 = X3).
% 0.14/0.36 cnf(c18, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(reflexivity, [assumptions([a9])], [c17])).
% 0.14/0.36
% 0.14/0.36 cnf(c19, axiom,
% 0.14/0.36 aNaturalNumber0(xm)).
% 0.14/0.36 cnf(a10, assumption,
% 0.14/0.36 X0 = xm).
% 0.14/0.36 cnf(c20, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a10])], [c15, c19])).
% 0.14/0.36 cnf(c21, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(strict_predicate_extension, [assumptions([a10])], [c15, c19])).
% 0.14/0.36
% 0.14/0.36 cnf(c22, plain,
% 0.14/0.36 $false,
% 0.14/0.36 inference(constraint_solving, [
% 0.14/0.36 bind(X0, xm),
% 0.14/0.36 bind(X1, sz10),
% 0.14/0.36 bind(X2, sz10),
% 0.14/0.36 bind(X3, sz00)
% 0.14/0.36 ],
% 0.14/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.14/0.36
% 0.14/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------