TSTP Solution File: NUM423+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM423+3 : 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 : n010.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:46 EDT 2022
% Result : Theorem 0.20s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM423+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 18:28:47 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 sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xa)) | ~aInteger0(X0)).
% 0.20/0.37 cnf(c1, plain,
% 0.20/0.37 sdtasdt0(xq,X0) != sdtpldt0(xa,smndt0(xa)) | ~aInteger0(X0),
% 0.20/0.37 inference(start, [], [c0])).
% 0.20/0.37
% 0.20/0.37 cnf(c2, axiom,
% 0.20/0.37 sz00 = sdtasdt0(X1,sz00) | ~aInteger0(X1)).
% 0.20/0.37 cnf(a0, assumption,
% 0.20/0.37 sdtasdt0(xq,X0) = sdtasdt0(X1,sz00)).
% 0.20/0.37 cnf(c3, plain,
% 0.20/0.37 ~aInteger0(X0),
% 0.20/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.37 cnf(c4, plain,
% 0.20/0.37 ~aInteger0(X1),
% 0.20/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.37 cnf(c5, plain,
% 0.20/0.37 X2 != sz00 | X2 != sdtpldt0(xa,smndt0(xa)),
% 0.20/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.37
% 0.20/0.37 cnf(a1, assumption,
% 0.20/0.37 X2 = sz00).
% 0.20/0.37 cnf(c6, plain,
% 0.20/0.37 X2 != sdtpldt0(xa,smndt0(xa)),
% 0.20/0.37 inference(reflexivity, [assumptions([a1])], [c5])).
% 0.20/0.37
% 0.20/0.37 cnf(c7, axiom,
% 0.20/0.37 sz00 = sdtpldt0(X3,smndt0(X3)) | ~aInteger0(X3)).
% 0.20/0.37 cnf(a2, assumption,
% 0.20/0.37 sdtpldt0(xa,smndt0(xa)) = sdtpldt0(X3,smndt0(X3))).
% 0.20/0.37 cnf(c8, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 0.20/0.37 cnf(c9, plain,
% 0.20/0.37 ~aInteger0(X3),
% 0.20/0.37 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 0.20/0.37 cnf(c10, plain,
% 0.20/0.37 X4 != sz00 | X2 != X4,
% 0.20/0.37 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 0.20/0.37
% 0.20/0.37 cnf(a3, assumption,
% 0.20/0.37 X4 = sz00).
% 0.20/0.37 cnf(c11, plain,
% 0.20/0.37 X2 != X4,
% 0.20/0.37 inference(reflexivity, [assumptions([a3])], [c10])).
% 0.20/0.37
% 0.20/0.37 cnf(a4, assumption,
% 0.20/0.37 X2 = X4).
% 0.20/0.37 cnf(c12, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(reflexivity, [assumptions([a4])], [c11])).
% 0.20/0.37
% 0.20/0.37 cnf(c13, axiom,
% 0.20/0.37 aInteger0(xa)).
% 0.20/0.37 cnf(a5, assumption,
% 0.20/0.37 X3 = xa).
% 0.20/0.37 cnf(c14, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c9, c13])).
% 0.20/0.37 cnf(c15, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c9, c13])).
% 0.20/0.37
% 0.20/0.37 cnf(c16, axiom,
% 0.20/0.37 aInteger0(xq)).
% 0.20/0.37 cnf(a6, assumption,
% 0.20/0.37 X1 = xq).
% 0.20/0.37 cnf(c17, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a6])], [c4, c16])).
% 0.20/0.37 cnf(c18, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a6])], [c4, c16])).
% 0.20/0.37
% 0.20/0.37 cnf(c19, axiom,
% 0.20/0.37 aInteger0(sz00)).
% 0.20/0.37 cnf(a7, assumption,
% 0.20/0.37 X0 = sz00).
% 0.20/0.37 cnf(c20, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a7])], [c3, c19])).
% 0.20/0.37 cnf(c21, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(strict_predicate_extension, [assumptions([a7])], [c3, c19])).
% 0.20/0.37
% 0.20/0.37 cnf(c22, plain,
% 0.20/0.37 $false,
% 0.20/0.37 inference(constraint_solving, [
% 0.20/0.37 bind(X0, sz00),
% 0.20/0.37 bind(X1, xq),
% 0.20/0.37 bind(X2, sz00),
% 0.20/0.37 bind(X3, xa),
% 0.20/0.37 bind(X4, sz00)
% 0.20/0.37 ],
% 0.20/0.37 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.20/0.37
% 0.20/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------