TSTP Solution File: NUM521+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM521+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:04 EDT 2022
% Result : Theorem 0.22s 0.50s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 31 ( 19 unt; 2 nHn; 31 RR)
% Number of literals : 51 ( 0 equ; 29 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
aNaturalNumber0(sz10),
file('NUM521+3.p',unknown),
[] ).
cnf(3,axiom,
aNaturalNumber0(xn),
file('NUM521+3.p',unknown),
[] ).
cnf(4,axiom,
aNaturalNumber0(xm),
file('NUM521+3.p',unknown),
[] ).
cnf(5,axiom,
aNaturalNumber0(xp),
file('NUM521+3.p',unknown),
[] ).
cnf(7,axiom,
isPrime0(xp),
file('NUM521+3.p',unknown),
[] ).
cnf(20,axiom,
~ sdtlseqdt0(xp,xn),
file('NUM521+3.p',unknown),
[] ).
cnf(21,axiom,
~ sdtlseqdt0(xp,xm),
file('NUM521+3.p',unknown),
[] ).
cnf(24,axiom,
( ~ sdtlseqdt0(xn,xp)
| skC0 ),
file('NUM521+3.p',unknown),
[] ).
cnf(25,axiom,
( ~ aNaturalNumber0(u)
| sdtlseqdt0(u,u) ),
file('NUM521+3.p',unknown),
[] ).
cnf(30,axiom,
( ~ aNaturalNumber0(u)
| equal(sdtasdt0(u,sz10),u) ),
file('NUM521+3.p',unknown),
[] ).
cnf(34,axiom,
( ~ aNaturalNumber0(u)
| ~ equal(sdtasdt0(xp,u),xn) ),
file('NUM521+3.p',unknown),
[] ).
cnf(44,axiom,
( ~ aNaturalNumber0(u)
| ~ aNaturalNumber0(v)
| sdtlseqdt0(v,u)
| sdtlseqdt0(u,v) ),
file('NUM521+3.p',unknown),
[] ).
cnf(48,axiom,
( ~ skC0
| ~ sdtlseqdt0(xm,xp)
| equal(xp,xm)
| equal(xp,xn) ),
file('NUM521+3.p',unknown),
[] ).
cnf(133,plain,
~ equal(sdtasdt0(xp,sz10),xn),
inference(res,[status(thm),theory(equality)],[2,34]),
[iquote('0:Res:2.0,34.0')] ).
cnf(148,plain,
equal(xp,xm),
inference(spt,[spt(split,[position(s1)])],[48]),
[iquote('1:Spt:48.2')] ).
cnf(167,plain,
isPrime0(xm),
inference(rew,[status(thm),theory(equality)],[148,7]),
[iquote('1:Rew:148.0,7.0')] ).
cnf(171,plain,
~ sdtlseqdt0(xm,xm),
inference(rew,[status(thm),theory(equality)],[148,21]),
[iquote('1:Rew:148.0,21.0')] ).
cnf(189,plain,
~ aNaturalNumber0(xm),
inference(res,[status(thm),theory(equality)],[25,171]),
[iquote('1:Res:25.1,171.0')] ).
cnf(190,plain,
$false,
inference(ssi,[status(thm)],[189,4,167]),
[iquote('1:SSi:189.0,4.0,167.0')] ).
cnf(191,plain,
~ equal(xp,xm),
inference(spt,[spt(split,[position(sa)])],[190,148]),
[iquote('1:Spt:190.0,48.2,148.0')] ).
cnf(192,plain,
( ~ skC0
| ~ sdtlseqdt0(xm,xp)
| equal(xp,xn) ),
inference(spt,[spt(split,[position(s2)])],[48]),
[iquote('1:Spt:190.0,48.0,48.1,48.3')] ).
cnf(194,plain,
( ~ sdtlseqdt0(xn,xp)
| ~ sdtlseqdt0(xm,xp)
| equal(xp,xn) ),
inference(res,[status(thm),theory(equality)],[24,192]),
[iquote('1:Res:24.1,192.0')] ).
cnf(210,plain,
( ~ aNaturalNumber0(xp)
| ~ equal(xp,xn) ),
inference(spl,[status(thm),theory(equality)],[30,133]),
[iquote('0:SpL:30.1,133.0')] ).
cnf(211,plain,
~ equal(xp,xn),
inference(ssi,[status(thm)],[210,5,7]),
[iquote('0:SSi:210.0,5.0,7.0')] ).
cnf(214,plain,
( ~ sdtlseqdt0(xn,xp)
| ~ sdtlseqdt0(xm,xp) ),
inference(mrr,[status(thm)],[194,211]),
[iquote('1:MRR:194.2,211.0')] ).
cnf(364,plain,
( ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xp)
| sdtlseqdt0(xn,xp) ),
inference(res,[status(thm),theory(equality)],[44,20]),
[iquote('0:Res:44.2,20.0')] ).
cnf(367,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xm)
| sdtlseqdt0(xm,xp) ),
inference(res,[status(thm),theory(equality)],[44,21]),
[iquote('0:Res:44.3,21.0')] ).
cnf(369,plain,
sdtlseqdt0(xn,xp),
inference(ssi,[status(thm)],[364,5,7,3]),
[iquote('0:SSi:364.1,364.0,5.0,7.0,3.0')] ).
cnf(371,plain,
~ sdtlseqdt0(xm,xp),
inference(mrr,[status(thm)],[214,369]),
[iquote('1:MRR:214.0,369.0')] ).
cnf(375,plain,
sdtlseqdt0(xm,xp),
inference(ssi,[status(thm)],[367,4,5,7]),
[iquote('0:SSi:367.1,367.0,4.0,5.0,7.0')] ).
cnf(376,plain,
$false,
inference(mrr,[status(thm)],[375,371]),
[iquote('1:MRR:375.0,371.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM521+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jul 7 20:02:54 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.22/0.50
% 0.22/0.50 SPASS V 3.9
% 0.22/0.50 SPASS beiseite: Proof found.
% 0.22/0.50 % SZS status Theorem
% 0.22/0.50 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.50 SPASS derived 212 clauses, backtracked 94 clauses, performed 4 splits and kept 318 clauses.
% 0.22/0.50 SPASS allocated 97955 KBytes.
% 0.22/0.50 SPASS spent 0:00:00.14 on the problem.
% 0.22/0.50 0:00:00.04 for the input.
% 0.22/0.50 0:00:00.04 for the FLOTTER CNF translation.
% 0.22/0.50 0:00:00.00 for inferences.
% 0.22/0.50 0:00:00.00 for the backtracking.
% 0.22/0.50 0:00:00.03 for the reduction.
% 0.22/0.50
% 0.22/0.50
% 0.22/0.50 Here is a proof with depth 2, length 31 :
% 0.22/0.50 % SZS output start Refutation
% See solution above
% 0.22/0.50 Formulae used in the proof : mSortsC_01 m__1837 m__1860 m__1870 m__2075 m__2287 mLERefl m_MulUnit m__ mLETotal
% 0.22/0.50
%------------------------------------------------------------------------------