TSTP Solution File: NUM627+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM627+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:17 EDT 2022
% Result : Theorem 2.14s 2.36s
% Output : Refutation 2.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 15 ( 8 unt; 1 nHn; 15 RR)
% Number of literals : 30 ( 0 equ; 22 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(33,axiom,
aElementOf0(xn,szNzAzT0),
file('NUM627+3.p',unknown),
[] ).
cnf(37,axiom,
aElementOf0(xm,szNzAzT0),
file('NUM627+3.p',unknown),
[] ).
cnf(117,axiom,
( ~ aElementOf0(u,szNzAzT0)
| aElementOf0(szszuzczcdt0(u),szNzAzT0) ),
file('NUM627+3.p',unknown),
[] ).
cnf(126,axiom,
~ aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)),
file('NUM627+3.p',unknown),
[] ).
cnf(142,axiom,
~ aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
file('NUM627+3.p',unknown),
[] ).
cnf(206,axiom,
( ~ aElementOf0(u,szNzAzT0)
| ~ aElementOf0(v,szNzAzT0)
| sdtlseqdt0(v,u)
| sdtlseqdt0(szszuzczcdt0(u),v) ),
file('NUM627+3.p',unknown),
[] ).
cnf(278,axiom,
( ~ sdtlseqdt0(u,v)
| ~ aElementOf0(u,szNzAzT0)
| ~ aElementOf0(v,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,v),sdtlpdtrp0(xN,u)) ),
file('NUM627+3.p',unknown),
[] ).
cnf(5002,plain,
( ~ sdtlseqdt0(xm,xn)
| ~ aElementOf0(xm,szNzAzT0)
| ~ aElementOf0(xn,szNzAzT0) ),
inference(res,[status(thm),theory(equality)],[278,126]),
[iquote('0:Res:278.3,126.0')] ).
cnf(5003,plain,
( ~ sdtlseqdt0(szszuzczcdt0(xn),xm)
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ aElementOf0(xm,szNzAzT0) ),
inference(res,[status(thm),theory(equality)],[278,142]),
[iquote('0:Res:278.3,142.0')] ).
cnf(5008,plain,
~ sdtlseqdt0(xm,xn),
inference(mrr,[status(thm)],[5002,37,33]),
[iquote('0:MRR:5002.1,5002.2,37.0,33.0')] ).
cnf(5009,plain,
( ~ sdtlseqdt0(szszuzczcdt0(xn),xm)
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0) ),
inference(mrr,[status(thm)],[5003,37]),
[iquote('0:MRR:5003.2,37.0')] ).
cnf(5570,plain,
( ~ aElementOf0(xn,szNzAzT0)
| ~ aElementOf0(xm,szNzAzT0)
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| sdtlseqdt0(xm,xn) ),
inference(res,[status(thm),theory(equality)],[206,5009]),
[iquote('0:Res:206.3,5009.0')] ).
cnf(5571,plain,
~ aElementOf0(szszuzczcdt0(xn),szNzAzT0),
inference(mrr,[status(thm)],[5570,33,37,5008]),
[iquote('0:MRR:5570.0,5570.1,5570.3,33.0,37.0,5008.0')] ).
cnf(5572,plain,
~ aElementOf0(xn,szNzAzT0),
inference(res,[status(thm),theory(equality)],[117,5571]),
[iquote('0:Res:117.1,5571.0')] ).
cnf(5576,plain,
$false,
inference(mrr,[status(thm)],[5572,33]),
[iquote('0:MRR:5572.0,33.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM627+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 5 13:08:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.14/2.36
% 2.14/2.36 SPASS V 3.9
% 2.14/2.36 SPASS beiseite: Proof found.
% 2.14/2.36 % SZS status Theorem
% 2.14/2.36 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.14/2.36 SPASS derived 3747 clauses, backtracked 380 clauses, performed 4 splits and kept 2714 clauses.
% 2.14/2.36 SPASS allocated 105177 KBytes.
% 2.14/2.36 SPASS spent 0:00:01.96 on the problem.
% 2.14/2.36 0:00:00.04 for the input.
% 2.14/2.36 0:00:00.81 for the FLOTTER CNF translation.
% 2.14/2.36 0:00:00.06 for inferences.
% 2.14/2.36 0:00:00.01 for the backtracking.
% 2.14/2.36 0:00:00.97 for the reduction.
% 2.14/2.36
% 2.14/2.36
% 2.14/2.36 Here is a proof with depth 3, length 15 :
% 2.14/2.36 % SZS output start Refutation
% See solution above
% 2.14/2.36 Formulae used in the proof : m__5309 m__5389 mSuccNum m__5461 m__5442 mLessTotal m__3754
% 2.14/2.36
%------------------------------------------------------------------------------