TSTP Solution File: NUM583+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM583+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:46 EDT 2022
% Result : Theorem 1.18s 1.34s
% Output : Refutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 21 ( 14 unt; 2 nHn; 21 RR)
% Number of literals : 32 ( 0 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(16,axiom,
~ aElementOf0(skc1,xS),
file('NUM583+3.p',unknown),
[] ).
cnf(48,axiom,
aElementOf0(skc1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),
file('NUM583+3.p',unknown),
[] ).
cnf(59,axiom,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)),
file('NUM583+3.p',unknown),
[] ).
cnf(73,axiom,
aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))),
file('NUM583+3.p',unknown),
[] ).
cnf(75,axiom,
( ~ aElementOf0(u,sdtlpdtrp0(xN,xi))
| aElementOf0(u,xS) ),
file('NUM583+3.p',unknown),
[] ).
cnf(80,axiom,
aSubsetOf0(xQ,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))),
file('NUM583+3.p',unknown),
[] ).
cnf(114,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,w)
| ~ aSubsetOf0(w,u)
| aElementOf0(v,u) ),
file('NUM583+3.p',unknown),
[] ).
cnf(141,axiom,
( ~ aElementOf0(u,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElementOf0(u,sdtlpdtrp0(xN,xi)) ),
file('NUM583+3.p',unknown),
[] ).
cnf(165,axiom,
( ~ aElementOf0(u,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElementOf0(u,xQ)
| equal(u,szmzizndt0(sdtlpdtrp0(xN,xi))) ),
file('NUM583+3.p',unknown),
[] ).
cnf(265,plain,
~ aElementOf0(skc1,sdtlpdtrp0(xN,xi)),
inference(res,[status(thm),theory(equality)],[75,16]),
[iquote('0:Res:75.1,16.0')] ).
cnf(281,plain,
( aElementOf0(skc1,xQ)
| equal(szmzizndt0(sdtlpdtrp0(xN,xi)),skc1) ),
inference(res,[status(thm),theory(equality)],[48,165]),
[iquote('0:Res:48.0,165.0')] ).
cnf(329,plain,
equal(szmzizndt0(sdtlpdtrp0(xN,xi)),skc1),
inference(spt,[spt(split,[position(s1)])],[281]),
[iquote('1:Spt:281.1')] ).
cnf(363,plain,
aElementOf0(skc1,sdtlpdtrp0(xN,xi)),
inference(rew,[status(thm),theory(equality)],[329,59]),
[iquote('1:Rew:329.0,59.0')] ).
cnf(365,plain,
$false,
inference(mrr,[status(thm)],[363,265]),
[iquote('1:MRR:363.0,265.0')] ).
cnf(370,plain,
~ equal(szmzizndt0(sdtlpdtrp0(xN,xi)),skc1),
inference(spt,[spt(split,[position(sa)])],[365,329]),
[iquote('1:Spt:365.0,281.1,329.0')] ).
cnf(371,plain,
aElementOf0(skc1,xQ),
inference(spt,[spt(split,[position(s2)])],[281]),
[iquote('1:Spt:365.0,281.0')] ).
cnf(2489,plain,
( ~ aSet0(u)
| ~ aSubsetOf0(xQ,u)
| aElementOf0(skc1,u) ),
inference(res,[status(thm),theory(equality)],[371,114]),
[iquote('1:Res:371.0,114.1')] ).
cnf(2581,plain,
( ~ aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElementOf0(skc1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
inference(res,[status(thm),theory(equality)],[80,2489]),
[iquote('1:Res:80.0,2489.1')] ).
cnf(2588,plain,
aElementOf0(skc1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))),
inference(ssi,[status(thm)],[2581,73]),
[iquote('1:SSi:2581.0,73.0')] ).
cnf(4631,plain,
aElementOf0(skc1,sdtlpdtrp0(xN,xi)),
inference(res,[status(thm),theory(equality)],[2588,141]),
[iquote('1:Res:2588.0,141.0')] ).
cnf(4636,plain,
$false,
inference(mrr,[status(thm)],[4631,265]),
[iquote('1:MRR:4631.0,265.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM583+3 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jul 5 10:51:37 EDT 2022
% 0.20/0.34 % CPUTime :
% 1.18/1.34
% 1.18/1.34 SPASS V 3.9
% 1.18/1.34 SPASS beiseite: Proof found.
% 1.18/1.34 % SZS status Theorem
% 1.18/1.34 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.18/1.34 SPASS derived 3668 clauses, backtracked 875 clauses, performed 12 splits and kept 2290 clauses.
% 1.18/1.34 SPASS allocated 102634 KBytes.
% 1.18/1.34 SPASS spent 0:00:00.97 on the problem.
% 1.18/1.34 0:00:00.04 for the input.
% 1.18/1.34 0:00:00.45 for the FLOTTER CNF translation.
% 1.18/1.34 0:00:00.05 for inferences.
% 1.18/1.34 0:00:00.01 for the backtracking.
% 1.18/1.34 0:00:00.38 for the reduction.
% 1.18/1.34
% 1.18/1.34
% 1.18/1.34 Here is a proof with depth 5, length 21 :
% 1.18/1.34 % SZS output start Refutation
% See solution above
% 1.18/1.34 Formulae used in the proof : m__ m__4007 m__3989_02 m__4037 mDefSub
% 1.18/1.34
%------------------------------------------------------------------------------