TSTP Solution File: NUM558+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM558+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:27:29 EDT 2022
% Result : Theorem 0.42s 0.58s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 20 ( 10 unt; 0 nHn; 20 RR)
% Number of literals : 35 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
aSet0(xS),
file('NUM558+3.p',unknown),
[] ).
cnf(5,axiom,
aSet0(xT),
file('NUM558+3.p',unknown),
[] ).
cnf(13,axiom,
aElementOf0(xx,xS),
file('NUM558+3.p',unknown),
[] ).
cnf(17,axiom,
~ aElementOf0(xx,xT),
file('NUM558+3.p',unknown),
[] ).
cnf(33,axiom,
aElementOf0(xP,slbdtsldtrb0(xS,xk)),
file('NUM558+3.p',unknown),
[] ).
cnf(57,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,u)
| aElement0(v) ),
file('NUM558+3.p',unknown),
[] ).
cnf(66,axiom,
( ~ aElementOf0(u,slbdtsldtrb0(xT,xk))
| aSubsetOf0(u,xT) ),
file('NUM558+3.p',unknown),
[] ).
cnf(74,axiom,
( ~ aElement0(u)
| ~ equal(u,xx)
| aElementOf0(u,xP) ),
file('NUM558+3.p',unknown),
[] ).
cnf(81,axiom,
( ~ aElementOf0(u,slbdtsldtrb0(xS,xk))
| aElementOf0(u,slbdtsldtrb0(xT,xk)) ),
file('NUM558+3.p',unknown),
[] ).
cnf(93,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,w)
| ~ aSubsetOf0(w,u)
| aElementOf0(v,u) ),
file('NUM558+3.p',unknown),
[] ).
cnf(179,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(u,xT)
| ~ aElementOf0(xx,u) ),
inference(res,[status(thm),theory(equality)],[93,17]),
[iquote('0:Res:93.3,17.0')] ).
cnf(183,plain,
( ~ aSubsetOf0(u,xT)
| ~ aElementOf0(xx,u) ),
inference(mrr,[status(thm)],[179,5]),
[iquote('0:MRR:179.0,5.0')] ).
cnf(241,plain,
( ~ aSet0(xS)
| aElement0(xx) ),
inference(res,[status(thm),theory(equality)],[13,57]),
[iquote('0:Res:13.0,57.1')] ).
cnf(250,plain,
aElement0(xx),
inference(ssi,[status(thm)],[241,4]),
[iquote('0:SSi:241.0,4.0')] ).
cnf(361,plain,
( ~ aElementOf0(u,slbdtsldtrb0(xS,xk))
| aSubsetOf0(u,xT) ),
inference(res,[status(thm),theory(equality)],[81,66]),
[iquote('0:Res:81.1,66.0')] ).
cnf(412,plain,
aSubsetOf0(xP,xT),
inference(res,[status(thm),theory(equality)],[33,361]),
[iquote('0:Res:33.0,361.0')] ).
cnf(418,plain,
~ aElementOf0(xx,xP),
inference(res,[status(thm),theory(equality)],[412,183]),
[iquote('0:Res:412.0,183.0')] ).
cnf(427,plain,
( ~ aElement0(xx)
| ~ equal(xx,xx) ),
inference(res,[status(thm),theory(equality)],[74,418]),
[iquote('0:Res:74.2,418.0')] ).
cnf(428,plain,
~ aElement0(xx),
inference(obv,[status(thm),theory(equality)],[427]),
[iquote('0:Obv:427.1')] ).
cnf(429,plain,
$false,
inference(ssi,[status(thm)],[428,250]),
[iquote('0:SSi:428.0,250.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM558+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n008.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:13:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.42/0.58
% 0.42/0.58 SPASS V 3.9
% 0.42/0.58 SPASS beiseite: Proof found.
% 0.42/0.58 % SZS status Theorem
% 0.42/0.58 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.58 SPASS derived 197 clauses, backtracked 0 clauses, performed 0 splits and kept 257 clauses.
% 0.42/0.58 SPASS allocated 99797 KBytes.
% 0.42/0.58 SPASS spent 0:00:00.23 on the problem.
% 0.42/0.58 0:00:00.04 for the input.
% 0.42/0.58 0:00:00.14 for the FLOTTER CNF translation.
% 0.42/0.58 0:00:00.00 for inferences.
% 0.42/0.58 0:00:00.00 for the backtracking.
% 0.42/0.58 0:00:00.02 for the reduction.
% 0.42/0.58
% 0.42/0.58
% 0.42/0.58 Here is a proof with depth 4, length 20 :
% 0.42/0.58 % SZS output start Refutation
% See solution above
% 0.42/0.58 Formulae used in the proof : m__2202_02 m__2256 m__ m__2378 mEOfElem m__2227 m__2357 mDefSub
% 0.42/0.58
%------------------------------------------------------------------------------