TSTP Solution File: NUM464+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM464+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:28 EDT 2022
% Result : Theorem 0.18s 0.44s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 8 unt; 2 nHn; 11 RR)
% Number of literals : 17 ( 0 equ; 7 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
aNaturalNumber0(sz10),
file('NUM464+2.p',unknown),
[] ).
cnf(3,axiom,
aNaturalNumber0(xm),
file('NUM464+2.p',unknown),
[] ).
cnf(5,axiom,
~ equal(xm,sz00),
file('NUM464+2.p',unknown),
[] ).
cnf(6,axiom,
~ sdtlseqdt0(sz10,xm),
file('NUM464+2.p',unknown),
[] ).
cnf(9,axiom,
( ~ aNaturalNumber0(u)
| sdtlseqdt0(u,u) ),
file('NUM464+2.p',unknown),
[] ).
cnf(20,axiom,
( ~ aNaturalNumber0(u)
| equal(u,sz10)
| equal(u,sz00)
| sdtlseqdt0(sz10,u) ),
file('NUM464+2.p',unknown),
[] ).
cnf(52,plain,
( ~ aNaturalNumber0(xm)
| equal(xm,sz00)
| equal(xm,sz10) ),
inference(res,[status(thm),theory(equality)],[20,6]),
[iquote('0:Res:20.1,6.0')] ).
cnf(91,plain,
equal(xm,sz10),
inference(mrr,[status(thm)],[52,3,5]),
[iquote('0:MRR:52.0,52.1,3.0,5.0')] ).
cnf(93,plain,
~ sdtlseqdt0(sz10,sz10),
inference(rew,[status(thm),theory(equality)],[91,6]),
[iquote('0:Rew:91.0,6.0')] ).
cnf(106,plain,
~ aNaturalNumber0(sz10),
inference(res,[status(thm),theory(equality)],[9,93]),
[iquote('0:Res:9.1,93.0')] ).
cnf(107,plain,
$false,
inference(ssi,[status(thm)],[106,2]),
[iquote('0:SSi:106.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM464+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n029.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 10:51:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44
% 0.18/0.44 SPASS V 3.9
% 0.18/0.44 SPASS beiseite: Proof found.
% 0.18/0.44 % SZS status Theorem
% 0.18/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 SPASS derived 48 clauses, backtracked 0 clauses, performed 0 splits and kept 58 clauses.
% 0.18/0.44 SPASS allocated 97789 KBytes.
% 0.18/0.44 SPASS spent 0:00:00.10 on the problem.
% 0.18/0.44 0:00:00.04 for the input.
% 0.18/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.44 0:00:00.00 for inferences.
% 0.18/0.44 0:00:00.00 for the backtracking.
% 0.18/0.44 0:00:00.01 for the reduction.
% 0.18/0.44
% 0.18/0.44
% 0.18/0.44 Here is a proof with depth 1, length 11 :
% 0.18/0.44 % SZS output start Refutation
% See solution above
% 0.18/0.44 Formulae used in the proof : mSortsC_01 m__987 m__ mLERefl mLENTr
% 0.18/0.44
%------------------------------------------------------------------------------