TSTP Solution File: NUM624+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM624+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.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:14 EDT 2022
% Result : Theorem 2.58s 2.80s
% Output : Refutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of clauses : 40 ( 19 unt; 1 nHn; 40 RR)
% Number of literals : 88 ( 0 equ; 55 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 12 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
aSet0(szNzAzT0),
file('NUM624+1.p',unknown),
[] ).
cnf(3,axiom,
isCountable0(szNzAzT0),
file('NUM624+1.p',unknown),
[] ).
cnf(18,axiom,
aSubsetOf0(xS,szNzAzT0),
file('NUM624+1.p',unknown),
[] ).
cnf(21,axiom,
aSubsetOf0(xO,xS),
file('NUM624+1.p',unknown),
[] ).
cnf(25,axiom,
aElementOf0(xp,xO),
file('NUM624+1.p',unknown),
[] ).
cnf(30,axiom,
aElementOf0(xx,szNzAzT0),
file('NUM624+1.p',unknown),
[] ).
cnf(33,axiom,
aElementOf0(xx,xQ),
file('NUM624+1.p',unknown),
[] ).
cnf(34,axiom,
aSubsetOf0(xQ,szNzAzT0),
file('NUM624+1.p',unknown),
[] ).
cnf(35,axiom,
~ equal(xx,xp),
file('NUM624+1.p',unknown),
[] ).
cnf(52,axiom,
equal(szmzizndt0(xQ),xp),
file('NUM624+1.p',unknown),
[] ).
cnf(63,axiom,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
file('NUM624+1.p',unknown),
[] ).
cnf(64,axiom,
aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0),
file('NUM624+1.p',unknown),
[] ).
cnf(77,axiom,
equal(szmzizndt0(sdtlpdtrp0(xN,xm)),xx),
file('NUM624+1.p',unknown),
[] ).
cnf(85,axiom,
( ~ aElementOf0(u,v)
| ~ equal(v,slcrc0) ),
file('NUM624+1.p',unknown),
[] ).
cnf(95,axiom,
( ~ aSet0(u)
| ~ aSubsetOf0(v,u)
| aSet0(v) ),
file('NUM624+1.p',unknown),
[] ).
cnf(124,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,w)
| ~ aSubsetOf0(w,u)
| aElementOf0(v,u) ),
file('NUM624+1.p',unknown),
[] ).
cnf(160,axiom,
( ~ sdtlseqdt0(u,v)
| ~ sdtlseqdt0(v,u)
| ~ aElementOf0(u,szNzAzT0)
| ~ aElementOf0(v,szNzAzT0)
| equal(v,u) ),
file('NUM624+1.p',unknown),
[] ).
cnf(161,axiom,
( ~ aElementOf0(u,v)
| ~ equal(w,szmzizndt0(v))
| ~ aSubsetOf0(v,szNzAzT0)
| sdtlseqdt0(w,u)
| equal(v,slcrc0) ),
file('NUM624+1.p',unknown),
[] ).
cnf(176,axiom,
( ~ aSet0(u)
| ~ aSet0(v)
| ~ aSet0(w)
| ~ aSubsetOf0(u,v)
| ~ aSubsetOf0(v,w)
| aSubsetOf0(u,w) ),
file('NUM624+1.p',unknown),
[] ).
cnf(233,plain,
( ~ aElementOf0(u,v)
| ~ aSubsetOf0(v,szNzAzT0)
| ~ equal(w,szmzizndt0(v))
| sdtlseqdt0(w,u) ),
inference(mrr,[status(thm)],[161,85]),
[iquote('0:MRR:161.4,85.1')] ).
cnf(236,plain,
( ~ aSet0(u)
| ~ aSubsetOf0(v,u)
| ~ aSubsetOf0(w,v)
| aSubsetOf0(w,u) ),
inference(mrr,[status(thm)],[176,95]),
[iquote('0:MRR:176.0,176.1,95.2,95.2')] ).
cnf(251,plain,
( ~ aElementOf0(xx,szNzAzT0)
| ~ sdtlseqdt0(xx,xp)
| ~ sdtlseqdt0(xp,xx)
| ~ aElementOf0(xp,szNzAzT0) ),
inference(res,[status(thm),theory(equality)],[160,35]),
[iquote('0:Res:160.4,35.0')] ).
cnf(265,plain,
( ~ aElementOf0(xp,szNzAzT0)
| ~ sdtlseqdt0(xp,xx)
| ~ sdtlseqdt0(xx,xp) ),
inference(mrr,[status(thm)],[251,30]),
[iquote('0:MRR:251.0,30.0')] ).
cnf(1178,plain,
( ~ aSet0(szNzAzT0)
| ~ aSubsetOf0(u,xS)
| aSubsetOf0(u,szNzAzT0) ),
inference(res,[status(thm),theory(equality)],[18,236]),
[iquote('0:Res:18.0,236.1')] ).
cnf(1196,plain,
( ~ aSubsetOf0(u,xS)
| aSubsetOf0(u,szNzAzT0) ),
inference(ssi,[status(thm)],[1178,3,2]),
[iquote('0:SSi:1178.0,3.0,2.0')] ).
cnf(1227,plain,
aSubsetOf0(xO,szNzAzT0),
inference(res,[status(thm),theory(equality)],[21,1196]),
[iquote('0:Res:21.0,1196.0')] ).
cnf(1244,plain,
( ~ aSet0(u)
| ~ aSubsetOf0(xO,u)
| aElementOf0(xp,u) ),
inference(res,[status(thm),theory(equality)],[25,124]),
[iquote('0:Res:25.0,124.1')] ).
cnf(1593,plain,
( ~ aElementOf0(u,v)
| ~ aSubsetOf0(v,szNzAzT0)
| sdtlseqdt0(szmzizndt0(v),u) ),
inference(eqr,[status(thm),theory(equality)],[233]),
[iquote('0:EqR:233.2')] ).
cnf(1596,plain,
( ~ aElementOf0(u,xQ)
| ~ aSubsetOf0(xQ,szNzAzT0)
| ~ equal(v,xp)
| sdtlseqdt0(v,u) ),
inference(spl,[status(thm),theory(equality)],[52,233]),
[iquote('0:SpL:52.0,233.2')] ).
cnf(1597,plain,
( ~ aElementOf0(u,xQ)
| ~ equal(v,xp)
| sdtlseqdt0(v,u) ),
inference(mrr,[status(thm)],[1596,34]),
[iquote('0:MRR:1596.1,34.0')] ).
cnf(2169,plain,
( ~ aSet0(szNzAzT0)
| aElementOf0(xp,szNzAzT0) ),
inference(res,[status(thm),theory(equality)],[1227,1244]),
[iquote('0:Res:1227.0,1244.1')] ).
cnf(2174,plain,
aElementOf0(xp,szNzAzT0),
inference(ssi,[status(thm)],[2169,3,2]),
[iquote('0:SSi:2169.0,3.0,2.0')] ).
cnf(2177,plain,
( ~ sdtlseqdt0(xp,xx)
| ~ sdtlseqdt0(xx,xp) ),
inference(mrr,[status(thm)],[265,2174]),
[iquote('0:MRR:265.0,2174.0')] ).
cnf(7889,plain,
( ~ aElementOf0(u,sdtlpdtrp0(xN,xm))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0)
| sdtlseqdt0(xx,u) ),
inference(spr,[status(thm),theory(equality)],[77,1593]),
[iquote('0:SpR:77.0,1593.2')] ).
cnf(7893,plain,
( ~ aElementOf0(u,sdtlpdtrp0(xN,xm))
| sdtlseqdt0(xx,u) ),
inference(mrr,[status(thm)],[7889,64]),
[iquote('0:MRR:7889.1,64.0')] ).
cnf(8944,plain,
sdtlseqdt0(xx,xp),
inference(res,[status(thm),theory(equality)],[63,7893]),
[iquote('0:Res:63.0,7893.0')] ).
cnf(8965,plain,
~ sdtlseqdt0(xp,xx),
inference(mrr,[status(thm)],[2177,8944]),
[iquote('0:MRR:2177.1,8944.0')] ).
cnf(8985,plain,
( ~ aElementOf0(xx,xQ)
| ~ equal(xp,xp) ),
inference(res,[status(thm),theory(equality)],[1597,8965]),
[iquote('0:Res:1597.2,8965.0')] ).
cnf(8988,plain,
~ aElementOf0(xx,xQ),
inference(obv,[status(thm),theory(equality)],[8985]),
[iquote('0:Obv:8985.1')] ).
cnf(8989,plain,
$false,
inference(mrr,[status(thm)],[8988,33]),
[iquote('0:MRR:8988.0,33.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM624+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n004.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 01:12:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.58/2.80
% 2.58/2.80 SPASS V 3.9
% 2.58/2.80 SPASS beiseite: Proof found.
% 2.58/2.80 % SZS status Theorem
% 2.58/2.80 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.58/2.80 SPASS derived 6323 clauses, backtracked 1009 clauses, performed 33 splits and kept 3922 clauses.
% 2.58/2.80 SPASS allocated 104920 KBytes.
% 2.58/2.80 SPASS spent 0:00:02.39 on the problem.
% 2.58/2.80 0:00:00.04 for the input.
% 2.58/2.80 0:00:00.24 for the FLOTTER CNF translation.
% 2.58/2.80 0:00:00.12 for inferences.
% 2.58/2.80 0:00:00.04 for the backtracking.
% 2.58/2.80 0:00:01.87 for the reduction.
% 2.58/2.80
% 2.58/2.80
% 2.58/2.80 Here is a proof with depth 3, length 40 :
% 2.58/2.80 % SZS output start Refutation
% See solution above
% 2.58/2.80 Formulae used in the proof : mNATSet m__3435 m__4998 m__5182 m__5365 m__5481 m__5518 m__ m__5147 m__5401 mDefEmp mDefSub mLessASymm mDefMin mSubTrans
% 2.58/2.80
%------------------------------------------------------------------------------