TSTP Solution File: NUM629+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM629+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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:18 EDT 2022
% Result : Theorem 1.43s 1.60s
% Output : Refutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 28 ( 10 unt; 0 nHn; 28 RR)
% Number of literals : 58 ( 0 equ; 34 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(18,axiom,
aSet0(xD),
file('NUM629+3.p',unknown),
[] ).
cnf(34,axiom,
aElementOf0(xn,szNzAzT0),
file('NUM629+3.p',unknown),
[] ).
cnf(36,axiom,
~ aSubsetOf0(xP,xD),
file('NUM629+3.p',unknown),
[] ).
cnf(70,axiom,
equal(sdtlpdtrp0(xe,xn),xp),
file('NUM629+3.p',unknown),
[] ).
cnf(88,axiom,
aSubsetOf0(xP,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
file('NUM629+3.p',unknown),
[] ).
cnf(115,axiom,
( ~ aElementOf0(u,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,u)) ),
file('NUM629+3.p',unknown),
[] ).
cnf(121,axiom,
( ~ aSet0(u)
| ~ aSubsetOf0(v,u)
| aSet0(v) ),
file('NUM629+3.p',unknown),
[] ).
cnf(130,axiom,
( ~ aElementOf0(u,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,u),szNzAzT0) ),
file('NUM629+3.p',unknown),
[] ).
cnf(143,axiom,
equal(sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),xD),
file('NUM629+3.p',unknown),
[] ).
cnf(167,axiom,
( ~ aElementOf0(u,szNzAzT0)
| equal(szmzizndt0(sdtlpdtrp0(xN,u)),sdtlpdtrp0(xe,u)) ),
file('NUM629+3.p',unknown),
[] ).
cnf(176,axiom,
( ~ isCountable0(sdtlpdtrp0(xN,u))
| ~ aSubsetOf0(sdtlpdtrp0(xN,u),szNzAzT0)
| skP6(u) ),
file('NUM629+3.p',unknown),
[] ).
cnf(290,axiom,
( ~ skP6(u)
| ~ aElementOf0(u,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(u)),sdtmndt0(sdtlpdtrp0(xN,u),szmzizndt0(sdtlpdtrp0(xN,u)))) ),
file('NUM629+3.p',unknown),
[] ).
cnf(304,axiom,
( ~ aSet0(u)
| ~ aSet0(v)
| ~ aSet0(w)
| ~ aSubsetOf0(u,v)
| ~ aSubsetOf0(v,w)
| aSubsetOf0(u,w) ),
file('NUM629+3.p',unknown),
[] ).
cnf(465,plain,
( ~ skP6(u)
| ~ aElementOf0(u,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(u)),sdtmndt0(sdtlpdtrp0(xN,u),sdtlpdtrp0(xe,u))) ),
inference(rew,[status(thm),theory(equality)],[167,290]),
[iquote('0:Rew:167.1,290.2')] ).
cnf(468,plain,
( ~ aSet0(u)
| ~ aSubsetOf0(v,u)
| ~ aSubsetOf0(w,v)
| aSubsetOf0(w,u) ),
inference(mrr,[status(thm)],[304,121]),
[iquote('0:MRR:304.0,304.1,121.2,121.2')] ).
cnf(547,plain,
( ~ aSet0(xD)
| ~ aSubsetOf0(xP,u)
| ~ aSubsetOf0(u,xD) ),
inference(res,[status(thm),theory(equality)],[468,36]),
[iquote('0:Res:468.3,36.0')] ).
cnf(588,plain,
( ~ aSubsetOf0(u,xD)
| ~ aSubsetOf0(xP,u) ),
inference(mrr,[status(thm)],[547,18]),
[iquote('0:MRR:547.0,18.0')] ).
cnf(1315,plain,
( ~ aElementOf0(xn,szNzAzT0)
| equal(sdtmndt0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xe,xn)),xD) ),
inference(spr,[status(thm),theory(equality)],[167,143]),
[iquote('0:SpR:167.1,143.0')] ).
cnf(1330,plain,
( ~ aElementOf0(xn,szNzAzT0)
| equal(sdtmndt0(sdtlpdtrp0(xN,xn),xp),xD) ),
inference(rew,[status(thm),theory(equality)],[70,1315]),
[iquote('0:Rew:70.0,1315.1')] ).
cnf(1331,plain,
equal(sdtmndt0(sdtlpdtrp0(xN,xn),xp),xD),
inference(mrr,[status(thm)],[1330,34]),
[iquote('0:MRR:1330.0,34.0')] ).
cnf(1589,plain,
( ~ aElementOf0(u,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,u))
| skP6(u) ),
inference(res,[status(thm),theory(equality)],[130,176]),
[iquote('0:Res:130.1,176.1')] ).
cnf(1592,plain,
( ~ aElementOf0(u,szNzAzT0)
| skP6(u) ),
inference(mrr,[status(thm)],[1589,115]),
[iquote('0:MRR:1589.1,115.1')] ).
cnf(1595,plain,
( ~ aElementOf0(u,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(u)),sdtmndt0(sdtlpdtrp0(xN,u),sdtlpdtrp0(xe,u))) ),
inference(mrr,[status(thm)],[465,1592]),
[iquote('0:MRR:465.0,1592.1')] ).
cnf(2970,plain,
( ~ aElementOf0(xn,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(xn)),sdtmndt0(sdtlpdtrp0(xN,xn),xp)) ),
inference(spr,[status(thm),theory(equality)],[70,1595]),
[iquote('0:SpR:70.0,1595.1')] ).
cnf(2983,plain,
( ~ aElementOf0(xn,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(xn)),xD) ),
inference(rew,[status(thm),theory(equality)],[1331,2970]),
[iquote('0:Rew:1331.0,2970.1')] ).
cnf(2984,plain,
aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(xn)),xD),
inference(mrr,[status(thm)],[2983,34]),
[iquote('0:MRR:2983.0,34.0')] ).
cnf(2997,plain,
~ aSubsetOf0(xP,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(res,[status(thm),theory(equality)],[2984,588]),
[iquote('0:Res:2984.0,588.0')] ).
cnf(3003,plain,
$false,
inference(mrr,[status(thm)],[2997,88]),
[iquote('0:MRR:2997.0,88.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM629+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n007.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 : Tue Jul 5 13:27:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.43/1.60
% 1.43/1.60 SPASS V 3.9
% 1.43/1.60 SPASS beiseite: Proof found.
% 1.43/1.60 % SZS status Theorem
% 1.43/1.60 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.43/1.60 SPASS derived 1910 clauses, backtracked 59 clauses, performed 5 splits and kept 1421 clauses.
% 1.43/1.60 SPASS allocated 105005 KBytes.
% 1.43/1.60 SPASS spent 0:00:01.24 on the problem.
% 1.43/1.60 0:00:00.04 for the input.
% 1.43/1.60 0:00:00.84 for the FLOTTER CNF translation.
% 1.43/1.60 0:00:00.03 for inferences.
% 1.43/1.60 0:00:00.00 for the backtracking.
% 1.43/1.60 0:00:00.27 for the reduction.
% 1.43/1.60
% 1.43/1.60
% 1.43/1.60 Here is a proof with depth 2, length 28 :
% 1.43/1.60 % SZS output start Refutation
% See solution above
% 1.43/1.60 Formulae used in the proof : m__5585 m__5309 m__ m__5334 m__3671 mDefSub m__4660 m__3623 mSubTrans
% 1.43/1.60
%------------------------------------------------------------------------------