TSTP Solution File: NUM633+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM633+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n008.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:22 EDT 2022
% Result : Theorem 31.85s 32.05s
% Output : Refutation 31.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 6 unt; 0 nHn; 18 RR)
% Number of literals : 37 ( 0 equ; 25 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 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(15,axiom,
isCountable0(xO),
file('NUM633+3.p',unknown),
[] ).
cnf(21,axiom,
aSubsetOf0(xO,xS),
file('NUM633+3.p',unknown),
[] ).
cnf(35,axiom,
aElementOf0(szDzizrdt0(xd),xT),
file('NUM633+3.p',unknown),
[] ).
cnf(47,axiom,
( ~ aSubsetOf0(u,xS)
| skP13(u) ),
file('NUM633+3.p',unknown),
[] ).
cnf(70,axiom,
( ~ aElementOf0(u,slbdtsldtrb0(xO,xK))
| skP12(u) ),
file('NUM633+3.p',unknown),
[] ).
cnf(81,axiom,
( ~ skP12(u)
| equal(sdtlpdtrp0(xc,u),szDzizrdt0(xd)) ),
file('NUM633+3.p',unknown),
[] ).
cnf(200,axiom,
( ~ isCountable0(u)
| ~ skP13(u)
| ~ aElementOf0(v,xT)
| aElementOf0(skf52(v,u),slbdtsldtrb0(u,xK)) ),
file('NUM633+3.p',unknown),
[] ).
cnf(221,axiom,
( ~ isCountable0(u)
| ~ skP13(u)
| ~ aElementOf0(v,xT)
| ~ equal(sdtlpdtrp0(xc,skf52(v,u)),v) ),
file('NUM633+3.p',unknown),
[] ).
cnf(595,plain,
skP13(xO),
inference(res,[status(thm),theory(equality)],[21,47]),
[iquote('0:Res:21.0,47.0')] ).
cnf(675,plain,
( ~ skP13(xO)
| ~ aElementOf0(u,xT)
| aElementOf0(skf52(u,xO),slbdtsldtrb0(xO,xK)) ),
inference(res,[status(thm),theory(equality)],[15,200]),
[iquote('0:Res:15.0,200.1')] ).
cnf(682,plain,
( ~ skP13(xO)
| ~ equal(sdtlpdtrp0(xc,skf52(u,xO)),u)
| ~ aElementOf0(u,xT) ),
inference(res,[status(thm),theory(equality)],[15,221]),
[iquote('0:Res:15.0,221.1')] ).
cnf(702,plain,
( ~ aElementOf0(u,xT)
| aElementOf0(skf52(u,xO),slbdtsldtrb0(xO,xK)) ),
inference(mrr,[status(thm)],[675,595]),
[iquote('0:MRR:675.0,595.0')] ).
cnf(705,plain,
( ~ aElementOf0(u,xT)
| ~ equal(sdtlpdtrp0(xc,skf52(u,xO)),u) ),
inference(mrr,[status(thm)],[682,595]),
[iquote('0:MRR:682.0,595.0')] ).
cnf(14580,plain,
( ~ aElementOf0(u,xT)
| skP12(skf52(u,xO)) ),
inference(res,[status(thm),theory(equality)],[702,70]),
[iquote('0:Res:702.1,70.0')] ).
cnf(41748,plain,
( ~ skP12(skf52(u,xO))
| ~ aElementOf0(u,xT)
| ~ equal(szDzizrdt0(xd),u) ),
inference(spl,[status(thm),theory(equality)],[81,705]),
[iquote('0:SpL:81.1,705.1')] ).
cnf(41749,plain,
( ~ aElementOf0(u,xT)
| ~ equal(szDzizrdt0(xd),u) ),
inference(mrr,[status(thm)],[41748,14580]),
[iquote('0:MRR:41748.0,14580.1')] ).
cnf(41753,plain,
~ equal(szDzizrdt0(xd),szDzizrdt0(xd)),
inference(res,[status(thm),theory(equality)],[35,41749]),
[iquote('0:Res:35.0,41749.0')] ).
cnf(41780,plain,
$false,
inference(obv,[status(thm),theory(equality)],[41753]),
[iquote('0:Obv:41753.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM633+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n008.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 : Wed Jul 6 13:18:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 31.85/32.05
% 31.85/32.05 SPASS V 3.9
% 31.85/32.05 SPASS beiseite: Proof found.
% 31.85/32.05 % SZS status Theorem
% 31.85/32.05 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 31.85/32.05 SPASS derived 32477 clauses, backtracked 6354 clauses, performed 54 splits and kept 18044 clauses.
% 31.85/32.05 SPASS allocated 130609 KBytes.
% 31.85/32.05 SPASS spent 0:0:30.53 on the problem.
% 31.85/32.05 0:00:00.04 for the input.
% 31.85/32.05 0:00:00.89 for the FLOTTER CNF translation.
% 31.85/32.05 0:00:00.60 for inferences.
% 31.85/32.05 0:00:01.80 for the backtracking.
% 31.85/32.05 0:0:26.66 for the reduction.
% 31.85/32.05
% 31.85/32.05
% 31.85/32.05 Here is a proof with depth 3, length 18 :
% 31.85/32.05 % SZS output start Refutation
% See solution above
% 31.85/32.05 Formulae used in the proof : m__4908 m__4998 m__4854 m__ m__4891
% 31.85/32.05
%------------------------------------------------------------------------------