TSTP Solution File: NUM449+6 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM449+6 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:26:18 EDT 2022
% Result : Theorem 0.91s 1.17s
% Output : Refutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 22 ( 8 unt; 7 nHn; 22 RR)
% Number of literals : 51 ( 0 equ; 27 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
aInteger0(sz00),
file('NUM449+6.p',unknown),
[] ).
cnf(3,axiom,
aSet0(xS),
file('NUM449+6.p',unknown),
[] ).
cnf(4,axiom,
isFinite0(xS),
file('NUM449+6.p',unknown),
[] ).
cnf(6,axiom,
aInteger0(skf39(u)),
file('NUM449+6.p',unknown),
[] ).
cnf(10,axiom,
~ isClosed0(sbsmnsldt0(xS)),
file('NUM449+6.p',unknown),
[] ).
cnf(46,axiom,
( ~ isClosed0(skf38(u))
| ~ aSubsetOf0(skf38(u),cS1395) ),
file('NUM449+6.p',unknown),
[] ).
cnf(47,axiom,
( ~ aElementOf0(u,xS)
| ~ equal(skf39(u),sz00) ),
file('NUM449+6.p',unknown),
[] ).
cnf(63,axiom,
( ~ aElementOf0(u,xS)
| equal(szAzrzSzezqlpdtcmdtrp0(sz00,skf39(u)),u) ),
file('NUM449+6.p',unknown),
[] ).
cnf(80,axiom,
( ~ isFinite0(u)
| ~ aSet0(u)
| isClosed0(sbsmnsldt0(u))
| aElementOf0(skf38(u),u) ),
file('NUM449+6.p',unknown),
[] ).
cnf(81,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| isClosed0(szAzrzSzezqlpdtcmdtrp0(v,u))
| equal(u,sz00) ),
file('NUM449+6.p',unknown),
[] ).
cnf(92,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| equal(u,sz00)
| aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(v,u),cS1395) ),
file('NUM449+6.p',unknown),
[] ).
cnf(213,plain,
( ~ aSet0(xS)
| ~ isFinite0(xS)
| aElementOf0(skf38(xS),xS) ),
inference(res,[status(thm),theory(equality)],[80,10]),
[iquote('0:Res:80.3,10.0')] ).
cnf(463,plain,
aElementOf0(skf38(xS),xS),
inference(mrr,[status(thm)],[213,3,4]),
[iquote('0:MRR:213.0,213.1,3.0,4.0')] ).
cnf(2346,plain,
( ~ aInteger0(skf39(u))
| ~ aInteger0(sz00)
| ~ aElementOf0(u,xS)
| isClosed0(u)
| equal(skf39(u),sz00) ),
inference(spr,[status(thm),theory(equality)],[63,81]),
[iquote('0:SpR:63.1,81.2')] ).
cnf(2347,plain,
( ~ aElementOf0(u,xS)
| isClosed0(u)
| equal(skf39(u),sz00) ),
inference(ssi,[status(thm)],[2346,1,6]),
[iquote('0:SSi:2346.1,2346.0,1.0,6.0')] ).
cnf(2348,plain,
( ~ aElementOf0(u,xS)
| isClosed0(u) ),
inference(mrr,[status(thm)],[2347,47]),
[iquote('0:MRR:2347.2,47.1')] ).
cnf(2351,plain,
( ~ aElementOf0(skf38(u),xS)
| ~ aSubsetOf0(skf38(u),cS1395) ),
inference(res,[status(thm),theory(equality)],[2348,46]),
[iquote('0:Res:2348.1,46.0')] ).
cnf(2488,plain,
( ~ aInteger0(skf39(u))
| ~ aInteger0(sz00)
| ~ aElementOf0(u,xS)
| equal(skf39(u),sz00)
| aSubsetOf0(u,cS1395) ),
inference(spr,[status(thm),theory(equality)],[63,92]),
[iquote('0:SpR:63.1,92.3')] ).
cnf(2490,plain,
( ~ aElementOf0(u,xS)
| equal(skf39(u),sz00)
| aSubsetOf0(u,cS1395) ),
inference(ssi,[status(thm)],[2488,1,6]),
[iquote('0:SSi:2488.1,2488.0,1.0,6.0')] ).
cnf(2491,plain,
( ~ aElementOf0(u,xS)
| aSubsetOf0(u,cS1395) ),
inference(mrr,[status(thm)],[2490,47]),
[iquote('0:MRR:2490.1,47.1')] ).
cnf(2492,plain,
~ aElementOf0(skf38(u),xS),
inference(mrr,[status(thm)],[2351,2491]),
[iquote('0:MRR:2351.1,2491.1')] ).
cnf(2496,plain,
$false,
inference(unc,[status(thm)],[2492,463]),
[iquote('0:UnC:2492.0,463.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM449+6 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n024.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 : Fri Jul 8 01:24:14 EDT 2022
% 0.17/0.33 % CPUTime :
% 0.91/1.17
% 0.91/1.17 SPASS V 3.9
% 0.91/1.17 SPASS beiseite: Proof found.
% 0.91/1.17 % SZS status Theorem
% 0.91/1.17 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.91/1.17 SPASS derived 1661 clauses, backtracked 1136 clauses, performed 43 splits and kept 2292 clauses.
% 0.91/1.17 SPASS allocated 100697 KBytes.
% 0.91/1.17 SPASS spent 0:00:00.82 on the problem.
% 0.91/1.17 0:00:00.04 for the input.
% 0.91/1.17 0:00:00.21 for the FLOTTER CNF translation.
% 0.91/1.17 0:00:00.01 for inferences.
% 0.91/1.17 0:00:00.01 for the backtracking.
% 0.91/1.17 0:00:00.48 for the reduction.
% 0.91/1.17
% 0.91/1.17
% 0.91/1.17 Here is a proof with depth 2, length 22 :
% 0.91/1.17 % SZS output start Refutation
% See solution above
% 0.91/1.17 Formulae used in the proof : mIntZero m__2046 mUnionSClosed mIntOne m__2117 m__ mArSeqClosed
% 0.91/1.17
%------------------------------------------------------------------------------