TSTP Solution File: NUM427+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM427+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 : n027.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:48 EDT 2022
% Result : Theorem 0.11s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM427+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jul 7 12:32:14 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.34 % SZS status Theorem
% 0.11/0.34 % SZS output begin IncompleteProof
% 0.11/0.34 cnf(c0, axiom,
% 0.11/0.34 sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xa)) | ~aInteger0(X0)).
% 0.11/0.34 cnf(c1, plain,
% 0.11/0.34 sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xa)) | ~aInteger0(X0),
% 0.11/0.34 inference(start, [], [c0])).
% 0.11/0.34
% 0.11/0.34 cnf(c2, axiom,
% 0.11/0.34 sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa))).
% 0.11/0.34 cnf(a0, assumption,
% 0.11/0.34 sdtasdt0(xq,X0) = sdtasdt0(xq,smndt0(xn))).
% 0.11/0.34 cnf(c3, plain,
% 0.11/0.34 ~aInteger0(X0),
% 0.11/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.11/0.34 cnf(c4, plain,
% 0.11/0.34 $false,
% 0.11/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.11/0.34 cnf(c5, plain,
% 0.11/0.34 X1 != sdtpldt0(xb,smndt0(xa)) | X1 != sdtpldt0(xb,smndt0(xa)),
% 0.11/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.11/0.34
% 0.11/0.34 cnf(a1, assumption,
% 0.11/0.34 X1 = sdtpldt0(xb,smndt0(xa))).
% 0.11/0.34 cnf(c6, plain,
% 0.11/0.34 X1 != sdtpldt0(xb,smndt0(xa)),
% 0.11/0.34 inference(reflexivity, [assumptions([a1])], [c5])).
% 0.11/0.34
% 0.11/0.34 cnf(a2, assumption,
% 0.11/0.34 X1 = sdtpldt0(xb,smndt0(xa))).
% 0.11/0.34 cnf(c7, plain,
% 0.11/0.34 $false,
% 0.11/0.34 inference(reflexivity, [assumptions([a2])], [c6])).
% 0.11/0.34
% 0.11/0.34 cnf(c8, axiom,
% 0.11/0.34 aInteger0(smndt0(X2)) | ~aInteger0(X2)).
% 0.11/0.34 cnf(a3, assumption,
% 0.11/0.34 X0 = smndt0(X2)).
% 0.11/0.34 cnf(c9, plain,
% 0.11/0.34 $false,
% 0.11/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c3, c8])).
% 0.11/0.34 cnf(c10, plain,
% 0.11/0.34 ~aInteger0(X2),
% 0.11/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c3, c8])).
% 0.11/0.34
% 0.11/0.34 cnf(c11, axiom,
% 0.11/0.34 aInteger0(xn)).
% 0.11/0.34 cnf(a4, assumption,
% 0.11/0.34 X2 = xn).
% 0.11/0.34 cnf(c12, plain,
% 0.11/0.34 $false,
% 0.11/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])).
% 0.11/0.34 cnf(c13, plain,
% 0.11/0.34 $false,
% 0.11/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])).
% 0.11/0.34
% 0.11/0.34 cnf(c14, plain,
% 0.11/0.34 $false,
% 0.11/0.34 inference(constraint_solving, [
% 0.11/0.34 bind(X0, smndt0(xn)),
% 0.11/0.34 bind(X1, sdtpldt0(xb,smndt0(xa))),
% 0.11/0.34 bind(X2, xn)
% 0.11/0.34 ],
% 0.11/0.34 [a0, a1, a2, a3, a4])).
% 0.11/0.34
% 0.11/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------