TSTP Solution File: NUM613+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM613+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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:28:07 EDT 2022
% Result : Theorem 1.69s 1.90s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 36 ( 20 unt; 6 nHn; 36 RR)
% Number of literals : 69 ( 0 equ; 38 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(17,axiom,
aElementOf0(xK,szNzAzT0),
file('NUM613+1.p',unknown),
[] ).
cnf(19,axiom,
aElementOf0(xk,szNzAzT0),
file('NUM613+1.p',unknown),
[] ).
cnf(33,axiom,
equal(szszuzczcdt0(xk),xK),
file('NUM613+1.p',unknown),
[] ).
cnf(45,axiom,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
file('NUM613+1.p',unknown),
[] ).
cnf(46,axiom,
~ equal(sbrdtbr0(xP),xk),
file('NUM613+1.p',unknown),
[] ).
cnf(52,axiom,
equal(sbrdtbr0(xQ),szszuzczcdt0(xk)),
file('NUM613+1.p',unknown),
[] ).
cnf(63,axiom,
equal(szszuzczcdt0(sbrdtbr0(xP)),sbrdtbr0(xQ)),
file('NUM613+1.p',unknown),
[] ).
cnf(72,axiom,
( ~ aElementOf0(u,szNzAzT0)
| sdtlseqdt0(u,szszuzczcdt0(u)) ),
file('NUM613+1.p',unknown),
[] ).
cnf(82,axiom,
( ~ aElementOf0(u,szNzAzT0)
| ~ equal(szszuzczcdt0(u),u) ),
file('NUM613+1.p',unknown),
[] ).
cnf(117,axiom,
( ~ aElementOf0(u,szNzAzT0)
| ~ aElementOf0(v,szNzAzT0)
| sdtlseqdt0(v,u)
| sdtlseqdt0(szszuzczcdt0(u),v) ),
file('NUM613+1.p',unknown),
[] ).
cnf(143,axiom,
( ~ sdtlseqdt0(u,v)
| ~ sdtlseqdt0(v,u)
| ~ aElementOf0(u,szNzAzT0)
| ~ aElementOf0(v,szNzAzT0)
| equal(v,u) ),
file('NUM613+1.p',unknown),
[] ).
cnf(210,plain,
equal(sbrdtbr0(xQ),xK),
inference(rew,[status(thm),theory(equality)],[33,52]),
[iquote('0:Rew:33.0,52.0')] ).
cnf(211,plain,
equal(szszuzczcdt0(sbrdtbr0(xP)),xK),
inference(rew,[status(thm),theory(equality)],[210,63]),
[iquote('0:Rew:210.0,63.0')] ).
cnf(237,plain,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| ~ sdtlseqdt0(sbrdtbr0(xP),xk)
| ~ sdtlseqdt0(xk,sbrdtbr0(xP))
| ~ aElementOf0(xk,szNzAzT0) ),
inference(res,[status(thm),theory(equality)],[143,46]),
[iquote('0:Res:143.4,46.0')] ).
cnf(250,plain,
( ~ sdtlseqdt0(xk,sbrdtbr0(xP))
| ~ sdtlseqdt0(sbrdtbr0(xP),xk) ),
inference(mrr,[status(thm)],[237,45,19]),
[iquote('0:MRR:237.0,237.3,45.0,19.0')] ).
cnf(293,plain,
( ~ aElementOf0(xk,szNzAzT0)
| sdtlseqdt0(xk,xK) ),
inference(spr,[status(thm),theory(equality)],[33,72]),
[iquote('0:SpR:33.0,72.1')] ).
cnf(294,plain,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| sdtlseqdt0(sbrdtbr0(xP),xK) ),
inference(spr,[status(thm),theory(equality)],[211,72]),
[iquote('0:SpR:211.0,72.1')] ).
cnf(296,plain,
sdtlseqdt0(xk,xK),
inference(mrr,[status(thm)],[293,19]),
[iquote('0:MRR:293.0,19.0')] ).
cnf(297,plain,
sdtlseqdt0(sbrdtbr0(xP),xK),
inference(mrr,[status(thm)],[294,45]),
[iquote('0:MRR:294.0,45.0')] ).
cnf(345,plain,
~ equal(szszuzczcdt0(xk),xk),
inference(res,[status(thm),theory(equality)],[19,82]),
[iquote('0:Res:19.0,82.0')] ).
cnf(348,plain,
~ equal(szszuzczcdt0(sbrdtbr0(xP)),sbrdtbr0(xP)),
inference(res,[status(thm),theory(equality)],[45,82]),
[iquote('0:Res:45.0,82.0')] ).
cnf(353,plain,
~ equal(xk,xK),
inference(rew,[status(thm),theory(equality)],[33,345]),
[iquote('0:Rew:33.0,345.0')] ).
cnf(354,plain,
~ equal(sbrdtbr0(xP),xK),
inference(rew,[status(thm),theory(equality)],[211,348]),
[iquote('0:Rew:211.0,348.0')] ).
cnf(1098,plain,
( ~ aElementOf0(xk,szNzAzT0)
| ~ aElementOf0(u,szNzAzT0)
| sdtlseqdt0(u,xk)
| sdtlseqdt0(xK,u) ),
inference(spr,[status(thm),theory(equality)],[33,117]),
[iquote('0:SpR:33.0,117.3')] ).
cnf(1099,plain,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| ~ aElementOf0(u,szNzAzT0)
| sdtlseqdt0(u,sbrdtbr0(xP))
| sdtlseqdt0(xK,u) ),
inference(spr,[status(thm),theory(equality)],[211,117]),
[iquote('0:SpR:211.0,117.3')] ).
cnf(1104,plain,
( ~ aElementOf0(u,szNzAzT0)
| sdtlseqdt0(u,xk)
| sdtlseqdt0(xK,u) ),
inference(mrr,[status(thm)],[1098,19]),
[iquote('0:MRR:1098.0,19.0')] ).
cnf(1106,plain,
( ~ aElementOf0(u,szNzAzT0)
| sdtlseqdt0(u,sbrdtbr0(xP))
| sdtlseqdt0(xK,u) ),
inference(mrr,[status(thm)],[1099,45]),
[iquote('0:MRR:1099.0,45.0')] ).
cnf(2829,plain,
( ~ sdtlseqdt0(xK,xk)
| ~ aElementOf0(xk,szNzAzT0)
| ~ aElementOf0(xK,szNzAzT0)
| equal(xk,xK) ),
inference(res,[status(thm),theory(equality)],[296,143]),
[iquote('0:Res:296.0,143.0')] ).
cnf(2830,plain,
( ~ sdtlseqdt0(xK,sbrdtbr0(xP))
| ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| ~ aElementOf0(xK,szNzAzT0)
| equal(sbrdtbr0(xP),xK) ),
inference(res,[status(thm),theory(equality)],[297,143]),
[iquote('0:Res:297.0,143.0')] ).
cnf(2833,plain,
~ sdtlseqdt0(xK,xk),
inference(mrr,[status(thm)],[2829,19,17,353]),
[iquote('0:MRR:2829.1,2829.2,2829.3,19.0,17.0,353.0')] ).
cnf(2834,plain,
~ sdtlseqdt0(xK,sbrdtbr0(xP)),
inference(mrr,[status(thm)],[2830,45,17,354]),
[iquote('0:MRR:2830.1,2830.2,2830.3,45.0,17.0,354.0')] ).
cnf(3070,plain,
( sdtlseqdt0(sbrdtbr0(xP),xk)
| sdtlseqdt0(xK,sbrdtbr0(xP)) ),
inference(res,[status(thm),theory(equality)],[45,1104]),
[iquote('0:Res:45.0,1104.0')] ).
cnf(3085,plain,
sdtlseqdt0(sbrdtbr0(xP),xk),
inference(mrr,[status(thm)],[3070,2834]),
[iquote('0:MRR:3070.1,2834.0')] ).
cnf(3086,plain,
~ sdtlseqdt0(xk,sbrdtbr0(xP)),
inference(mrr,[status(thm)],[250,3085]),
[iquote('0:MRR:250.1,3085.0')] ).
cnf(6688,plain,
( ~ aElementOf0(xk,szNzAzT0)
| sdtlseqdt0(xK,xk) ),
inference(res,[status(thm),theory(equality)],[1106,3086]),
[iquote('0:Res:1106.1,3086.0')] ).
cnf(6694,plain,
$false,
inference(mrr,[status(thm)],[6688,19,2833]),
[iquote('0:MRR:6688.0,6688.1,19.0,2833.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM613+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.32 % Computer : n003.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Wed Jul 6 19:55:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.69/1.90
% 1.69/1.90 SPASS V 3.9
% 1.69/1.90 SPASS beiseite: Proof found.
% 1.69/1.90 % SZS status Theorem
% 1.69/1.90 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.69/1.90 SPASS derived 4853 clauses, backtracked 937 clauses, performed 7 splits and kept 2742 clauses.
% 1.69/1.90 SPASS allocated 103013 KBytes.
% 1.69/1.90 SPASS spent 0:00:01.53 on the problem.
% 1.69/1.90 0:00:00.04 for the input.
% 1.69/1.90 0:00:00.31 for the FLOTTER CNF translation.
% 1.69/1.90 0:00:00.07 for inferences.
% 1.69/1.90 0:00:00.01 for the backtracking.
% 1.69/1.90 0:00:01.04 for the reduction.
% 1.69/1.90
% 1.69/1.90
% 1.69/1.90 Here is a proof with depth 2, length 36 :
% 1.69/1.90 % SZS output start Refutation
% See solution above
% 1.69/1.90 Formulae used in the proof : m__3418 m__3533 m__5255 m__ mLessSucc mNatNSucc mLessTotal mLessASymm
% 1.69/1.90
%------------------------------------------------------------------------------