TSTP Solution File: NUM458+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM458+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n011.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:26:24 EDT 2022
% Result : Theorem 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 5 unt; 0 nHn; 8 RR)
% Number of literals : 11 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
aNaturalNumber0(sz00),
file('NUM458+2.p',unknown),
[] ).
cnf(3,axiom,
aNaturalNumber0(xm),
file('NUM458+2.p',unknown),
[] ).
cnf(7,axiom,
( ~ aNaturalNumber0(u)
| equal(sdtpldt0(u,sz00),u) ),
file('NUM458+2.p',unknown),
[] ).
cnf(13,axiom,
( ~ aNaturalNumber0(u)
| ~ equal(sdtpldt0(xm,u),xm) ),
file('NUM458+2.p',unknown),
[] ).
cnf(38,plain,
~ equal(sdtpldt0(xm,sz00),xm),
inference(res,[status(thm),theory(equality)],[1,13]),
[iquote('0:Res:1.0,13.0')] ).
cnf(52,plain,
( ~ aNaturalNumber0(xm)
| ~ equal(xm,xm) ),
inference(spl,[status(thm),theory(equality)],[7,38]),
[iquote('0:SpL:7.1,38.0')] ).
cnf(53,plain,
~ aNaturalNumber0(xm),
inference(obv,[status(thm),theory(equality)],[52]),
[iquote('0:Obv:52.1')] ).
cnf(54,plain,
$false,
inference(ssi,[status(thm)],[53,3]),
[iquote('0:SSi:53.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM458+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 5 13:19:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45
% 0.20/0.45 SPASS V 3.9
% 0.20/0.45 SPASS beiseite: Proof found.
% 0.20/0.45 % SZS status Theorem
% 0.20/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 SPASS derived 16 clauses, backtracked 0 clauses, performed 0 splits and kept 37 clauses.
% 0.20/0.45 SPASS allocated 97762 KBytes.
% 0.20/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.45 0:00:00.03 for the input.
% 0.20/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.45 0:00:00.00 for inferences.
% 0.20/0.45 0:00:00.00 for the backtracking.
% 0.20/0.45 0:00:00.00 for the reduction.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Here is a proof with depth 2, length 8 :
% 0.20/0.45 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : mSortsC m__718 m_AddZero m__
% 0.20/0.45
%------------------------------------------------------------------------------