TSTP Solution File: NUM436+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM436+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 : n019.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:53 EDT 2022
% Result : Theorem 8.58s 1.50s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM436+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.11 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.32 % Computer : n019.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jul 5 09:08:23 EDT 2022
% 0.12/0.32 % CPUTime :
% 8.58/1.50 % SZS status Theorem
% 8.58/1.50 % SZS output begin IncompleteProof
% 8.58/1.50 cnf(c0, axiom,
% 8.58/1.50 sP3 | sP2).
% 8.58/1.50 cnf(c1, plain,
% 8.58/1.50 sP3 | sP2,
% 8.58/1.50 inference(start, [], [c0])).
% 8.58/1.50
% 8.58/1.50 cnf(c2, axiom,
% 8.58/1.50 sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0) | ~aInteger0(X0) | ~sP3).
% 8.58/1.50 cnf(c3, plain,
% 8.58/1.50 sP2,
% 8.58/1.50 inference(strict_predicate_extension, [], [c1, c2])).
% 8.58/1.50 cnf(c4, plain,
% 8.58/1.50 sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0) | ~aInteger0(X0),
% 8.58/1.50 inference(strict_predicate_extension, [], [c1, c2])).
% 8.58/1.50
% 8.58/1.50 cnf(c5, axiom,
% 8.58/1.50 sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm))).
% 8.58/1.50 cnf(a0, assumption,
% 8.58/1.50 sdtasdt0(xq,X0) = sdtasdt0(xq,sdtasdt0(xp,xm))).
% 8.58/1.50 cnf(c6, plain,
% 8.58/1.50 ~aInteger0(X0),
% 8.58/1.50 inference(strict_function_extension, [assumptions([a0])], [c4, c5])).
% 8.58/1.50 cnf(c7, plain,
% 8.58/1.50 $false,
% 8.58/1.50 inference(strict_function_extension, [assumptions([a0])], [c4, c5])).
% 8.58/1.50 cnf(c8, plain,
% 8.58/1.50 X1 != sdtpldt0(xa,smndt0(xb)) | sdtpldt0(xa,smndt0(xb)) != X1,
% 8.58/1.50 inference(strict_function_extension, [assumptions([a0])], [c4, c5])).
% 8.58/1.50
% 8.58/1.50 cnf(a1, assumption,
% 8.58/1.50 X1 = sdtpldt0(xa,smndt0(xb))).
% 8.58/1.50 cnf(c9, plain,
% 8.58/1.50 sdtpldt0(xa,smndt0(xb)) != X1,
% 8.58/1.50 inference(reflexivity, [assumptions([a1])], [c8])).
% 8.58/1.50
% 8.58/1.50 cnf(a2, assumption,
% 8.58/1.50 sdtpldt0(xa,smndt0(xb)) = X1).
% 8.58/1.50 cnf(c10, plain,
% 8.58/1.50 $false,
% 8.58/1.50 inference(reflexivity, [assumptions([a2])], [c9])).
% 8.58/1.50
% 8.58/1.50 cnf(c11, axiom,
% 8.58/1.50 aInteger0(sdtasdt0(X2,X3)) | ~aInteger0(X3) | ~aInteger0(X2)).
% 8.58/1.50 cnf(a3, assumption,
% 8.58/1.50 X0 = sdtasdt0(X2,X3)).
% 8.58/1.50 cnf(c12, plain,
% 8.58/1.50 $false,
% 8.58/1.50 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])).
% 8.58/1.50 cnf(c13, plain,
% 8.58/1.50 ~aInteger0(X3) | ~aInteger0(X2),
% 8.58/1.50 inference(strict_predicate_extension, [assumptions([a3])], [c6, c11])).
% 8.58/1.50
% 8.58/1.50 cnf(c14, axiom,
% 8.58/1.50 aInteger0(xm)).
% 8.58/1.50 cnf(a4, assumption,
% 8.58/1.50 X3 = xm).
% 8.58/1.50 cnf(c15, plain,
% 8.58/1.50 ~aInteger0(X2),
% 8.58/1.50 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 8.58/1.50 cnf(c16, plain,
% 8.58/1.50 $false,
% 8.58/1.50 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 8.58/1.50
% 8.58/1.50 cnf(c17, axiom,
% 8.58/1.50 aInteger0(xp)).
% 8.58/1.50 cnf(a5, assumption,
% 8.58/1.50 X2 = xp).
% 8.58/1.50 cnf(c18, plain,
% 8.58/1.50 $false,
% 8.58/1.50 inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])).
% 8.58/1.50 cnf(c19, plain,
% 8.58/1.50 $false,
% 8.58/1.50 inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])).
% 8.58/1.50
% 8.58/1.50 cnf(c20, axiom,
% 8.58/1.50 sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X4) | ~aInteger0(X4) | ~sP2).
% 8.58/1.50 cnf(c21, plain,
% 8.58/1.50 $false,
% 8.58/1.50 inference(strict_predicate_extension, [], [c3, c20])).
% 8.58/1.50 cnf(c22, plain,
% 8.58/1.50 sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X4) | ~aInteger0(X4),
% 8.58/1.50 inference(strict_predicate_extension, [], [c3, c20])).
% 8.58/1.50
% 8.58/1.50 cnf(c23, axiom,
% 8.58/1.50 sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,xm))).
% 8.58/1.50 cnf(a6, assumption,
% 8.58/1.50 sdtasdt0(xp,X4) = sdtasdt0(xp,sdtasdt0(xq,xm))).
% 8.58/1.50 cnf(c24, plain,
% 8.58/1.50 ~aInteger0(X4),
% 8.58/1.50 inference(strict_function_extension, [assumptions([a6])], [c22, c23])).
% 8.58/1.50 cnf(c25, plain,
% 8.58/1.50 $false,
% 8.58/1.50 inference(strict_function_extension, [assumptions([a6])], [c22, c23])).
% 8.58/1.50 cnf(c26, plain,
% 8.58/1.50 X5 != sdtpldt0(xa,smndt0(xb)) | sdtpldt0(xa,smndt0(xb)) != X5,
% 8.58/1.50 inference(strict_function_extension, [assumptions([a6])], [c22, c23])).
% 8.58/1.50
% 8.58/1.50 cnf(a7, assumption,
% 8.58/1.50 X5 = sdtpldt0(xa,smndt0(xb))).
% 8.58/1.50 cnf(c27, plain,
% 8.58/1.50 sdtpldt0(xa,smndt0(xb)) != X5,
% 8.58/1.50 inference(reflexivity, [assumptions([a7])], [c26])).
% 8.58/1.50
% 8.58/1.50 cnf(a8, assumption,
% 8.58/1.50 sdtpldt0(xa,smndt0(xb)) = X5).
% 8.58/1.50 cnf(c28, plain,
% 8.58/1.50 $false,
% 8.58/1.50 inference(reflexivity, [assumptions([a8])], [c27])).
% 8.58/1.50
% 8.58/1.50 cnf(c29, axiom,
% 8.58/1.50 aInteger0(sdtasdt0(X6,X7)) | ~aInteger0(X7) | ~aInteger0(X6)).
% 8.58/1.50 cnf(a9, assumption,
% 8.58/1.50 X4 = sdtasdt0(X6,X7)).
% 8.58/1.50 cnf(c30, plain,
% 8.58/1.50 $false,
% 8.58/1.50 inference(strict_predicate_extension, [assumptions([a9])], [c24, c29])).
% 8.58/1.50 cnf(c31, plain,
% 8.58/1.50 ~aInteger0(X7) | ~aInteger0(X6),
% 8.58/1.50 inference(strict_predicate_extension, [assumptions([a9])], [c24, c29])).
% 8.58/1.50
% 8.58/1.50 cnf(c32, plain,
% 8.58/1.50 aInteger0(X3)).
% 8.58/1.50 cnf(a10, assumption,
% 8.58/1.50 X7 = X3).
% 8.58/1.50 cnf(c33, plain,
% 8.58/1.50 ~aInteger0(X6),
% 8.58/1.50 inference(predicate_reduction, [assumptions([a10])], [c31, c32])).
% 8.58/1.50
% 8.58/1.50 cnf(c34, axiom,
% 8.58/1.50 aInteger0(xq)).
% 8.58/1.50 cnf(a11, assumption,
% 8.58/1.50 X6 = xq).
% 8.58/1.50 cnf(c35, plain,
% 8.58/1.50 $false,
% 8.58/1.50 inference(strict_predicate_extension, [assumptions([a11])], [c33, c34])).
% 8.58/1.50 cnf(c36, plain,
% 8.58/1.50 $false,
% 8.58/1.50 inference(strict_predicate_extension, [assumptions([a11])], [c33, c34])).
% 8.58/1.50
% 8.58/1.50 cnf(c37, plain,
% 8.58/1.50 $false,
% 8.58/1.50 inference(constraint_solving, [
% 8.58/1.50 bind(X0, sdtasdt0(xp,xm)),
% 8.58/1.50 bind(X1, sdtpldt0(xa,smndt0(xb))),
% 8.58/1.50 bind(X2, xp),
% 8.58/1.50 bind(X3, xm),
% 8.58/1.50 bind(X4, sdtasdt0(xq,xm)),
% 8.58/1.50 bind(X5, sdtpldt0(xa,smndt0(xb))),
% 8.58/1.50 bind(X6, xq),
% 8.58/1.50 bind(X7, xm)
% 8.58/1.50 ],
% 8.58/1.50 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 8.58/1.50
% 8.58/1.50 % SZS output end IncompleteProof
%------------------------------------------------------------------------------