TSTP Solution File: NUM623+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM623+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:14 EDT 2022
% Result : Theorem 4.77s 5.03s
% Output : Refutation 4.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 19 ( 10 unt; 1 nHn; 19 RR)
% Number of literals : 48 ( 0 equ; 31 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(23,axiom,
aSubsetOf0(xQ,szNzAzT0),
file('NUM623+1.p',unknown),
[] ).
cnf(32,axiom,
aElementOf0(xm,szNzAzT0),
file('NUM623+1.p',unknown),
[] ).
cnf(33,axiom,
aElementOf0(xx,xQ),
file('NUM623+1.p',unknown),
[] ).
cnf(34,axiom,
~ equal(xx,xp),
file('NUM623+1.p',unknown),
[] ).
cnf(51,axiom,
equal(szmzizndt0(xQ),xp),
file('NUM623+1.p',unknown),
[] ).
cnf(61,axiom,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
file('NUM623+1.p',unknown),
[] ).
cnf(74,axiom,
equal(szmzizndt0(sdtlpdtrp0(xN,xm)),xx),
file('NUM623+1.p',unknown),
[] ).
cnf(81,axiom,
( ~ aElementOf0(u,v)
| ~ equal(v,slcrc0) ),
file('NUM623+1.p',unknown),
[] ).
cnf(97,axiom,
( ~ aElementOf0(u,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,u),szNzAzT0) ),
file('NUM623+1.p',unknown),
[] ).
cnf(209,axiom,
( ~ aSubsetOf0(u,szNzAzT0)
| ~ aElementOf0(szmzizndt0(u),v)
| ~ aElementOf0(szmzizndt0(v),u)
| ~ aSubsetOf0(v,szNzAzT0)
| equal(u,slcrc0)
| equal(szmzizndt0(u),szmzizndt0(v))
| equal(v,slcrc0) ),
file('NUM623+1.p',unknown),
[] ).
cnf(241,plain,
( ~ aSubsetOf0(u,szNzAzT0)
| ~ aSubsetOf0(v,szNzAzT0)
| ~ aElementOf0(szmzizndt0(u),v)
| ~ aElementOf0(szmzizndt0(v),u)
| equal(szmzizndt0(v),szmzizndt0(u)) ),
inference(mrr,[status(thm)],[209,81]),
[iquote('0:MRR:209.4,209.6,81.1,81.1')] ).
cnf(4234,plain,
( ~ aSubsetOf0(xQ,szNzAzT0)
| ~ aSubsetOf0(u,szNzAzT0)
| ~ aElementOf0(xp,u)
| ~ aElementOf0(szmzizndt0(u),xQ)
| equal(szmzizndt0(u),szmzizndt0(xQ)) ),
inference(spl,[status(thm),theory(equality)],[51,241]),
[iquote('0:SpL:51.0,241.2')] ).
cnf(4238,plain,
( ~ aSubsetOf0(xQ,szNzAzT0)
| ~ aSubsetOf0(u,szNzAzT0)
| ~ aElementOf0(xp,u)
| ~ aElementOf0(szmzizndt0(u),xQ)
| equal(szmzizndt0(u),xp) ),
inference(rew,[status(thm),theory(equality)],[51,4234]),
[iquote('0:Rew:51.0,4234.4')] ).
cnf(4239,plain,
( ~ aSubsetOf0(u,szNzAzT0)
| ~ aElementOf0(xp,u)
| ~ aElementOf0(szmzizndt0(u),xQ)
| equal(szmzizndt0(u),xp) ),
inference(mrr,[status(thm)],[4238,23]),
[iquote('0:MRR:4238.0,23.0')] ).
cnf(11749,plain,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0)
| ~ aElementOf0(xp,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(xx,xQ)
| equal(szmzizndt0(sdtlpdtrp0(xN,xm)),xp) ),
inference(spl,[status(thm),theory(equality)],[74,4239]),
[iquote('0:SpL:74.0,4239.2')] ).
cnf(11752,plain,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0)
| ~ aElementOf0(xp,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(xx,xQ)
| equal(xx,xp) ),
inference(rew,[status(thm),theory(equality)],[74,11749]),
[iquote('0:Rew:74.0,11749.3')] ).
cnf(11753,plain,
~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0),
inference(mrr,[status(thm)],[11752,61,33,34]),
[iquote('0:MRR:11752.1,11752.2,11752.3,61.0,33.0,34.0')] ).
cnf(13297,plain,
~ aElementOf0(xm,szNzAzT0),
inference(res,[status(thm),theory(equality)],[97,11753]),
[iquote('0:Res:97.1,11753.0')] ).
cnf(13298,plain,
$false,
inference(mrr,[status(thm)],[13297,32]),
[iquote('0:MRR:13297.0,32.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM623+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n013.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 : Fri Jul 8 01:50:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 4.77/5.03
% 4.77/5.03 SPASS V 3.9
% 4.77/5.03 SPASS beiseite: Proof found.
% 4.77/5.03 % SZS status Theorem
% 4.77/5.03 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.77/5.03 SPASS derived 9901 clauses, backtracked 1807 clauses, performed 37 splits and kept 6132 clauses.
% 4.77/5.03 SPASS allocated 108557 KBytes.
% 4.77/5.03 SPASS spent 0:00:04.55 on the problem.
% 4.77/5.03 0:00:00.04 for the input.
% 4.77/5.03 0:00:00.27 for the FLOTTER CNF translation.
% 4.77/5.03 0:00:00.18 for inferences.
% 4.77/5.03 0:00:00.11 for the backtracking.
% 4.77/5.03 0:00:03.84 for the reduction.
% 4.77/5.03
% 4.77/5.03
% 4.77/5.03 Here is a proof with depth 3, length 19 :
% 4.77/5.03 % SZS output start Refutation
% See solution above
% 4.77/5.03 Formulae used in the proof : m__5106 m__5389 m__5481 m__ m__5147 m__5401 mDefEmp m__3671 mMinMin
% 4.77/5.03
%------------------------------------------------------------------------------