TSTP Solution File: NUM605+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM605+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.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:01 EDT 2022
% Result : Theorem 12.81s 13.03s
% Output : Refutation 12.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 19 ( 9 unt; 0 nHn; 19 RR)
% Number of literals : 38 ( 0 equ; 20 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 : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(13,axiom,
aSet0(xO),
file('NUM605+1.p',unknown),
[] ).
cnf(14,axiom,
isCountable0(xO),
file('NUM605+1.p',unknown),
[] ).
cnf(15,axiom,
equal(slcrc0,xQ),
file('NUM605+1.p',unknown),
[] ).
cnf(17,axiom,
aElementOf0(xK,szNzAzT0),
file('NUM605+1.p',unknown),
[] ).
cnf(26,axiom,
~ equal(xK,sz00),
file('NUM605+1.p',unknown),
[] ).
cnf(40,axiom,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
file('NUM605+1.p',unknown),
[] ).
cnf(41,axiom,
( ~ equal(u,slcrc0)
| aSet0(u) ),
file('NUM605+1.p',unknown),
[] ).
cnf(80,axiom,
( ~ aSet0(u)
| ~ equal(u,slcrc0)
| equal(sbrdtbr0(u),sz00) ),
file('NUM605+1.p',unknown),
[] ).
cnf(149,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,w)
| ~ aElementOf0(x,szNzAzT0)
| ~ equal(w,slbdtsldtrb0(u,x))
| equal(sbrdtbr0(v),x) ),
file('NUM605+1.p',unknown),
[] ).
cnf(200,plain,
( ~ equal(u,xQ)
| aSet0(u) ),
inference(rew,[status(thm),theory(equality)],[15,41]),
[iquote('0:Rew:15.0,41.0')] ).
cnf(203,plain,
( ~ aSet0(u)
| ~ equal(u,xQ)
| equal(sbrdtbr0(u),sz00) ),
inference(rew,[status(thm),theory(equality)],[15,80]),
[iquote('0:Rew:15.0,80.1')] ).
cnf(204,plain,
( ~ equal(u,xQ)
| equal(sbrdtbr0(u),sz00) ),
inference(mrr,[status(thm)],[203,200]),
[iquote('0:MRR:203.0,200.1')] ).
cnf(254,plain,
equal(sbrdtbr0(slcrc0),sz00),
inference(res,[status(thm),theory(equality)],[15,204]),
[iquote('0:Res:15.0,204.0')] ).
cnf(414,plain,
equal(sbrdtbr0(xQ),sz00),
inference(rew,[status(thm),theory(equality)],[15,254]),
[iquote('0:Rew:15.0,254.0')] ).
cnf(3927,plain,
( ~ aSet0(u)
| ~ aElementOf0(v,slbdtsldtrb0(u,w))
| ~ aElementOf0(w,szNzAzT0)
| equal(sbrdtbr0(v),w) ),
inference(eqr,[status(thm),theory(equality)],[149]),
[iquote('0:EqR:149.3')] ).
cnf(16946,plain,
( ~ aSet0(xO)
| ~ aElementOf0(xK,szNzAzT0)
| equal(sbrdtbr0(xQ),xK) ),
inference(res,[status(thm),theory(equality)],[40,3927]),
[iquote('0:Res:40.0,3927.1')] ).
cnf(16948,plain,
( ~ aSet0(xO)
| ~ aElementOf0(xK,szNzAzT0)
| equal(xK,sz00) ),
inference(rew,[status(thm),theory(equality)],[414,16946]),
[iquote('0:Rew:414.0,16946.2')] ).
cnf(16949,plain,
( ~ aElementOf0(xK,szNzAzT0)
| equal(xK,sz00) ),
inference(ssi,[status(thm)],[16948,13,14]),
[iquote('0:SSi:16948.0,13.0,14.0')] ).
cnf(16950,plain,
$false,
inference(mrr,[status(thm)],[16949,17,26]),
[iquote('0:MRR:16949.0,16949.1,17.0,26.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : NUM605+1 : TPTP v8.1.0. Released v4.0.0.
% 0.02/0.09 % Command : run_spass %d %s
% 0.09/0.29 % Computer : n004.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Tue Jul 5 09:10:52 EDT 2022
% 0.09/0.29 % CPUTime :
% 12.81/13.03
% 12.81/13.03 SPASS V 3.9
% 12.81/13.03 SPASS beiseite: Proof found.
% 12.81/13.03 % SZS status Theorem
% 12.81/13.03 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.81/13.03 SPASS derived 12868 clauses, backtracked 2372 clauses, performed 30 splits and kept 7193 clauses.
% 12.81/13.03 SPASS allocated 112510 KBytes.
% 12.81/13.03 SPASS spent 0:0:12.36 on the problem.
% 12.81/13.03 0:00:00.03 for the input.
% 12.81/13.03 0:00:00.29 for the FLOTTER CNF translation.
% 12.81/13.03 0:00:00.38 for inferences.
% 12.81/13.03 0:00:00.32 for the backtracking.
% 12.81/13.03 0:0:11.14 for the reduction.
% 12.81/13.03
% 12.81/13.03
% 12.81/13.03 Here is a proof with depth 2, length 19 :
% 12.81/13.03 % SZS output start Refutation
% See solution above
% 12.81/13.03 Formulae used in the proof : m__4908 m__ m__3418 m__3520 m__5078 mDefEmp mCardEmpty mDefSel
% 12.81/13.03
%------------------------------------------------------------------------------