TSTP Solution File: NUM514+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM514+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 : n006.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:35 EDT 2022
% Result : Theorem 0.19s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM514+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n006.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 : Thu Jul 7 12:57:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.37 % SZS status Theorem
% 0.19/0.37 % SZS output begin IncompleteProof
% 0.19/0.37 cnf(c0, axiom,
% 0.19/0.37 sdtasdt0(xp,X0) != sdtasdt0(sdtsldt0(xn,xr),xm) | ~aNaturalNumber0(X0)).
% 0.19/0.37 cnf(c1, plain,
% 0.19/0.37 sdtasdt0(xp,X0) != sdtasdt0(sdtsldt0(xn,xr),xm) | ~aNaturalNumber0(X0),
% 0.19/0.37 inference(start, [], [c0])).
% 0.19/0.37
% 0.19/0.37 cnf(c2, axiom,
% 0.19/0.37 sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr))).
% 0.19/0.37 cnf(a0, assumption,
% 0.19/0.37 sdtasdt0(xp,X0) = sdtasdt0(xp,sdtsldt0(xk,xr))).
% 0.19/0.37 cnf(c3, plain,
% 0.19/0.37 ~aNaturalNumber0(X0),
% 0.19/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.37 cnf(c4, plain,
% 0.19/0.37 $false,
% 0.19/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.37 cnf(c5, plain,
% 0.19/0.37 X1 != sdtasdt0(sdtsldt0(xn,xr),xm) | X1 != sdtasdt0(sdtsldt0(xn,xr),xm),
% 0.19/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.37
% 0.19/0.37 cnf(a1, assumption,
% 0.19/0.37 X1 = sdtasdt0(sdtsldt0(xn,xr),xm)).
% 0.19/0.37 cnf(c6, plain,
% 0.19/0.37 X1 != sdtasdt0(sdtsldt0(xn,xr),xm),
% 0.19/0.37 inference(reflexivity, [assumptions([a1])], [c5])).
% 0.19/0.37
% 0.19/0.37 cnf(a2, assumption,
% 0.19/0.37 X1 = sdtasdt0(sdtsldt0(xn,xr),xm)).
% 0.19/0.37 cnf(c7, plain,
% 0.19/0.37 $false,
% 0.19/0.37 inference(reflexivity, [assumptions([a2])], [c6])).
% 0.19/0.37
% 0.19/0.37 cnf(c8, axiom,
% 0.19/0.37 aNaturalNumber0(sdtsldt0(xk,xr))).
% 0.19/0.37 cnf(a3, assumption,
% 0.19/0.37 X0 = sdtsldt0(xk,xr)).
% 0.19/0.37 cnf(c9, plain,
% 0.19/0.37 $false,
% 0.19/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c3, c8])).
% 0.19/0.37 cnf(c10, plain,
% 0.19/0.37 $false,
% 0.19/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c3, c8])).
% 0.19/0.37
% 0.19/0.37 cnf(c11, plain,
% 0.19/0.37 $false,
% 0.19/0.37 inference(constraint_solving, [
% 0.19/0.37 bind(X0, sdtsldt0(xk,xr)),
% 0.19/0.37 bind(X1, sdtasdt0(sdtsldt0(xn,xr),xm))
% 0.19/0.37 ],
% 0.19/0.37 [a0, a1, a2, a3])).
% 0.19/0.37
% 0.19/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------