TSTP Solution File: NUM592+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM592+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:52 EDT 2022
% Result : Theorem 2.74s 2.95s
% Output : Refutation 2.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 21 ( 10 unt; 0 nHn; 21 RR)
% Number of literals : 43 ( 0 equ; 28 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 11 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(14,axiom,
aSet0(xX),
file('NUM592+3.p',unknown),
[] ).
cnf(15,axiom,
isCountable0(xX),
file('NUM592+3.p',unknown),
[] ).
cnf(23,axiom,
aElementOf0(xu,xT),
file('NUM592+3.p',unknown),
[] ).
cnf(24,axiom,
aSubsetOf0(xX,xY),
file('NUM592+3.p',unknown),
[] ).
cnf(25,axiom,
aSet0(skf43(u,v)),
file('NUM592+3.p',unknown),
[] ).
cnf(39,axiom,
equal(sdtlpdtrp0(xC,xi),xd),
file('NUM592+3.p',unknown),
[] ).
cnf(90,axiom,
equal(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xY),
file('NUM592+3.p',unknown),
[] ).
cnf(116,axiom,
( ~ aSubsetOf0(u,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| skP11(u) ),
file('NUM592+3.p',unknown),
[] ).
cnf(146,axiom,
( ~ aSet0(u)
| ~ aElementOf0(u,slbdtsldtrb0(xX,xk))
| equal(sdtlpdtrp0(xd,u),xu) ),
file('NUM592+3.p',unknown),
[] ).
cnf(178,axiom,
( ~ isCountable0(u)
| ~ skP11(u)
| ~ aElementOf0(v,xT)
| aElementOf0(skf43(v,u),slbdtsldtrb0(u,xk)) ),
file('NUM592+3.p',unknown),
[] ).
cnf(255,axiom,
( ~ skP11(u)
| ~ isCountable0(u)
| ~ equal(sdtlpdtrp0(sdtlpdtrp0(xC,xi),skf43(v,u)),v)
| ~ aElementOf0(v,xT) ),
file('NUM592+3.p',unknown),
[] ).
cnf(360,plain,
( ~ aSubsetOf0(u,xY)
| skP11(u) ),
inference(rew,[status(thm),theory(equality)],[90,116]),
[iquote('0:Rew:90.0,116.0')] ).
cnf(370,plain,
( ~ isCountable0(u)
| ~ skP11(u)
| ~ aElementOf0(v,xT)
| ~ equal(sdtlpdtrp0(xd,skf43(v,u)),v) ),
inference(rew,[status(thm),theory(equality)],[39,255]),
[iquote('0:Rew:39.0,255.2')] ).
cnf(492,plain,
skP11(xX),
inference(res,[status(thm),theory(equality)],[24,360]),
[iquote('0:Res:24.0,360.0')] ).
cnf(529,plain,
( ~ skP11(xX)
| ~ equal(sdtlpdtrp0(xd,skf43(u,xX)),u)
| ~ aElementOf0(u,xT) ),
inference(res,[status(thm),theory(equality)],[15,370]),
[iquote('0:Res:15.0,370.1')] ).
cnf(548,plain,
( ~ aElementOf0(u,xT)
| ~ equal(sdtlpdtrp0(xd,skf43(u,xX)),u) ),
inference(mrr,[status(thm)],[529,492]),
[iquote('0:MRR:529.0,492.0')] ).
cnf(7301,plain,
( ~ isCountable0(xX)
| ~ skP11(xX)
| ~ aSet0(skf43(u,xX))
| ~ aElementOf0(u,xT)
| equal(sdtlpdtrp0(xd,skf43(u,xX)),xu) ),
inference(res,[status(thm),theory(equality)],[178,146]),
[iquote('0:Res:178.3,146.1')] ).
cnf(7479,plain,
( ~ aElementOf0(u,xT)
| equal(sdtlpdtrp0(xd,skf43(u,xX)),xu) ),
inference(ssi,[status(thm)],[7301,25,14,492,15]),
[iquote('0:SSi:7301.2,7301.1,7301.0,25.0,14.0,492.0,15.0,14.0,492.0,15.0,14.0,492.0,15.0')] ).
cnf(7480,plain,
( ~ aElementOf0(u,xT)
| ~ equal(xu,u) ),
inference(rew,[status(thm),theory(equality)],[7479,548]),
[iquote('0:Rew:7479.1,548.1')] ).
cnf(9234,plain,
~ equal(xu,xu),
inference(res,[status(thm),theory(equality)],[23,7480]),
[iquote('0:Res:23.0,7480.0')] ).
cnf(9245,plain,
$false,
inference(obv,[status(thm),theory(equality)],[9234]),
[iquote('0:Obv:9234.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM592+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 5 15:34:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.74/2.95
% 2.74/2.95 SPASS V 3.9
% 2.74/2.95 SPASS beiseite: Proof found.
% 2.74/2.95 % SZS status Theorem
% 2.74/2.95 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.74/2.95 SPASS derived 6836 clauses, backtracked 2149 clauses, performed 33 splits and kept 5191 clauses.
% 2.74/2.95 SPASS allocated 105124 KBytes.
% 2.74/2.95 SPASS spent 0:00:02.56 on the problem.
% 2.74/2.95 0:00:00.04 for the input.
% 2.74/2.95 0:00:00.84 for the FLOTTER CNF translation.
% 2.74/2.95 0:00:00.08 for inferences.
% 2.74/2.95 0:00:00.05 for the backtracking.
% 2.74/2.95 0:00:01.45 for the reduction.
% 2.74/2.95
% 2.74/2.95
% 2.74/2.95 Here is a proof with depth 2, length 21 :
% 2.74/2.95 % SZS output start Refutation
% See solution above
% 2.74/2.95 Formulae used in the proof : m__4545 m__ m__4448_02
% 2.74/2.95
%------------------------------------------------------------------------------