TSTP Solution File: NUM552+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM552+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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:25 EDT 2022
% Result : Theorem 1.22s 1.39s
% Output : Refutation 1.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 22 ( 9 unt; 0 nHn; 22 RR)
% Number of literals : 49 ( 0 equ; 31 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
aSet0(xT),
file('NUM552+1.p',unknown),
[] ).
cnf(9,axiom,
aElementOf0(xx,xQ),
file('NUM552+1.p',unknown),
[] ).
cnf(11,axiom,
aElementOf0(xk,szNzAzT0),
file('NUM552+1.p',unknown),
[] ).
cnf(14,axiom,
~ aElementOf0(xx,xT),
file('NUM552+1.p',unknown),
[] ).
cnf(20,axiom,
aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
file('NUM552+1.p',unknown),
[] ).
cnf(31,axiom,
aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)),
file('NUM552+1.p',unknown),
[] ).
cnf(61,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,w)
| ~ aSubsetOf0(w,u)
| aElementOf0(v,u) ),
file('NUM552+1.p',unknown),
[] ).
cnf(72,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,szNzAzT0)
| ~ equal(w,slbdtsldtrb0(u,v))
| aSet0(w) ),
file('NUM552+1.p',unknown),
[] ).
cnf(90,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,w)
| ~ aElementOf0(x,szNzAzT0)
| ~ equal(w,slbdtsldtrb0(u,x))
| aSubsetOf0(v,u) ),
file('NUM552+1.p',unknown),
[] ).
cnf(155,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(u,xT)
| ~ aElementOf0(xx,u) ),
inference(res,[status(thm),theory(equality)],[61,14]),
[iquote('0:Res:61.3,14.0')] ).
cnf(164,plain,
( ~ aSubsetOf0(u,xT)
| ~ aElementOf0(xx,u) ),
inference(mrr,[status(thm)],[155,5]),
[iquote('0:MRR:155.0,5.0')] ).
cnf(172,plain,
~ aSubsetOf0(xQ,xT),
inference(res,[status(thm),theory(equality)],[9,164]),
[iquote('0:Res:9.0,164.1')] ).
cnf(799,plain,
( ~ aSet0(u)
| ~ aSubsetOf0(slbdtsldtrb0(xS,xk),u)
| aElementOf0(xQ,u) ),
inference(res,[status(thm),theory(equality)],[20,61]),
[iquote('0:Res:20.0,61.1')] ).
cnf(993,plain,
( ~ aSet0(u)
| ~ aElementOf0(v,szNzAzT0)
| aSet0(slbdtsldtrb0(u,v)) ),
inference(eqr,[status(thm),theory(equality)],[72]),
[iquote('0:EqR:72.2')] ).
cnf(1256,plain,
( ~ aSet0(slbdtsldtrb0(xT,xk))
| aElementOf0(xQ,slbdtsldtrb0(xT,xk)) ),
inference(res,[status(thm),theory(equality)],[31,799]),
[iquote('0:Res:31.0,799.1')] ).
cnf(1268,plain,
( ~ aSet0(xT)
| ~ aElementOf0(xk,szNzAzT0)
| aElementOf0(xQ,slbdtsldtrb0(xT,xk)) ),
inference(sor,[status(thm)],[1256,993]),
[iquote('0:SoR:1256.0,993.2')] ).
cnf(1273,plain,
( ~ aElementOf0(xk,szNzAzT0)
| aElementOf0(xQ,slbdtsldtrb0(xT,xk)) ),
inference(ssi,[status(thm)],[1268,5]),
[iquote('0:SSi:1268.0,5.0')] ).
cnf(1274,plain,
aElementOf0(xQ,slbdtsldtrb0(xT,xk)),
inference(mrr,[status(thm)],[1273,11]),
[iquote('0:MRR:1273.0,11.0')] ).
cnf(1865,plain,
( ~ aSet0(u)
| ~ aElementOf0(v,slbdtsldtrb0(u,w))
| ~ aElementOf0(w,szNzAzT0)
| aSubsetOf0(v,u) ),
inference(eqr,[status(thm),theory(equality)],[90]),
[iquote('0:EqR:90.3')] ).
cnf(5071,plain,
( ~ aSet0(xT)
| ~ aElementOf0(xk,szNzAzT0)
| aSubsetOf0(xQ,xT) ),
inference(res,[status(thm),theory(equality)],[1274,1865]),
[iquote('0:Res:1274.0,1865.1')] ).
cnf(5074,plain,
( ~ aElementOf0(xk,szNzAzT0)
| aSubsetOf0(xQ,xT) ),
inference(ssi,[status(thm)],[5071,5]),
[iquote('0:SSi:5071.0,5.0')] ).
cnf(5075,plain,
$false,
inference(mrr,[status(thm)],[5074,11,172]),
[iquote('0:MRR:5074.0,5074.1,11.0,172.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM552+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 12:07:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.22/1.39
% 1.22/1.39 SPASS V 3.9
% 1.22/1.39 SPASS beiseite: Proof found.
% 1.22/1.39 % SZS status Theorem
% 1.22/1.39 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.22/1.39 SPASS derived 3730 clauses, backtracked 204 clauses, performed 10 splits and kept 1684 clauses.
% 1.22/1.39 SPASS allocated 102088 KBytes.
% 1.22/1.39 SPASS spent 0:00:01.01 on the problem.
% 1.22/1.39 0:00:00.04 for the input.
% 1.22/1.39 0:00:00.11 for the FLOTTER CNF translation.
% 1.22/1.39 0:00:00.07 for inferences.
% 1.22/1.39 0:00:00.01 for the backtracking.
% 1.22/1.39 0:00:00.74 for the reduction.
% 1.22/1.39
% 1.22/1.39
% 1.22/1.39 Here is a proof with depth 4, length 22 :
% 1.22/1.39 % SZS output start Refutation
% See solution above
% 1.22/1.39 Formulae used in the proof : m__2202_02 m__ m__2202 m__2270 m__2227 mDefSub mDefSel
% 1.22/1.39
%------------------------------------------------------------------------------