TSTP Solution File: NUM514+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM514+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% 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 14:27:00 EDT 2022
% Result : Theorem 0.20s 0.47s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 6 ( 4 unt; 0 nHn; 6 RR)
% Number of literals : 8 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(51,axiom,
aNaturalNumber0(sdtsldt0(xk,xr)),
file('NUM514+3.p',unknown),
[] ).
cnf(97,axiom,
equal(sdtasdt0(sdtsldt0(xn,xr),xm),sdtasdt0(xp,sdtsldt0(xk,xr))),
file('NUM514+3.p',unknown),
[] ).
cnf(102,axiom,
( ~ aNaturalNumber0(u)
| ~ equal(sdtasdt0(sdtsldt0(xn,xr),xm),sdtasdt0(xp,u)) ),
file('NUM514+3.p',unknown),
[] ).
cnf(165,plain,
( ~ aNaturalNumber0(u)
| ~ equal(sdtasdt0(xp,sdtsldt0(xk,xr)),sdtasdt0(xp,u)) ),
inference(rew,[status(thm),theory(equality)],[97,102]),
[iquote('0:Rew:97.0,102.1')] ).
cnf(196,plain,
~ equal(sdtasdt0(xp,sdtsldt0(xk,xr)),sdtasdt0(xp,sdtsldt0(xk,xr))),
inference(res,[status(thm),theory(equality)],[51,165]),
[iquote('0:Res:51.0,165.0')] ).
cnf(203,plain,
$false,
inference(obv,[status(thm),theory(equality)],[196]),
[iquote('0:Obv:196.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM514+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jul 7 13:11:24 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.47
% 0.20/0.47 SPASS V 3.9
% 0.20/0.47 SPASS beiseite: Proof found.
% 0.20/0.47 % SZS status Theorem
% 0.20/0.47 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 SPASS derived 32 clauses, backtracked 0 clauses, performed 0 splits and kept 172 clauses.
% 0.20/0.47 SPASS allocated 98031 KBytes.
% 0.20/0.47 SPASS spent 0:00:00.13 on the problem.
% 0.20/0.47 0:00:00.04 for the input.
% 0.20/0.47 0:00:00.05 for the FLOTTER CNF translation.
% 0.20/0.47 0:00:00.00 for inferences.
% 0.20/0.47 0:00:00.00 for the backtracking.
% 0.20/0.47 0:00:00.02 for the reduction.
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 Here is a proof with depth 1, length 6 :
% 0.20/0.47 % SZS output start Refutation
% See solution above
% 0.20/0.47 Formulae used in the proof : m__2613 m__
% 0.20/0.47
%------------------------------------------------------------------------------