TSTP Solution File: RNG121+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG121+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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 20:41:32 EDT 2022
% Result : Theorem 180.29s 180.45s
% Output : Refutation 180.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 22 ( 9 unt; 0 nHn; 22 RR)
% Number of literals : 52 ( 0 equ; 37 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
aElement0(xa),
file('RNG121+1.p',unknown),
[] ).
cnf(4,axiom,
aElement0(xb),
file('RNG121+1.p',unknown),
[] ).
cnf(13,axiom,
~ aElementOf0(xb,xI),
file('RNG121+1.p',unknown),
[] ).
cnf(21,axiom,
aElementOf0(sz00,slsdtgt0(xa)),
file('RNG121+1.p',unknown),
[] ).
cnf(24,axiom,
aElementOf0(xb,slsdtgt0(xb)),
file('RNG121+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ aElement0(u)
| aIdeal0(slsdtgt0(u)) ),
file('RNG121+1.p',unknown),
[] ).
cnf(34,axiom,
equal(sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),xI),
file('RNG121+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ aElement0(u)
| equal(sdtpldt0(sz00,u),u) ),
file('RNG121+1.p',unknown),
[] ).
cnf(62,axiom,
( ~ aElement0(u)
| ~ equal(v,slsdtgt0(u))
| aSet0(v) ),
file('RNG121+1.p',unknown),
[] ).
cnf(85,axiom,
( ~ aElementOf0(u,v)
| ~ aElementOf0(w,x)
| ~ equal(sdtpldt0(w,u),y)
| skP1(y,v,x) ),
file('RNG121+1.p',unknown),
[] ).
cnf(94,axiom,
( ~ aSet0(u)
| ~ aSet0(v)
| ~ equal(w,sdtpldt1(v,u))
| ~ skP1(x,u,v)
| aElementOf0(x,w) ),
file('RNG121+1.p',unknown),
[] ).
cnf(121,plain,
( ~ aSet0(u)
| ~ aSet0(v)
| ~ equal(sdtpldt1(v,u),xI)
| ~ skP1(xb,u,v) ),
inference(res,[status(thm),theory(equality)],[94,13]),
[iquote('0:Res:94.4,13.0')] ).
cnf(184,plain,
( ~ aElement0(u)
| aSet0(slsdtgt0(u)) ),
inference(eqr,[status(thm),theory(equality)],[62]),
[iquote('0:EqR:62.1')] ).
cnf(660,plain,
( ~ aElement0(u)
| ~ aElementOf0(u,v)
| ~ aElementOf0(sz00,w)
| ~ equal(u,x)
| skP1(x,v,w) ),
inference(spl,[status(thm),theory(equality)],[38,85]),
[iquote('0:SpL:38.1,85.2')] ).
cnf(7098,plain,
( ~ aSet0(slsdtgt0(xb))
| ~ aSet0(slsdtgt0(xa))
| ~ equal(xI,xI)
| ~ skP1(xb,slsdtgt0(xb),slsdtgt0(xa)) ),
inference(spl,[status(thm),theory(equality)],[34,121]),
[iquote('0:SpL:34.0,121.2')] ).
cnf(7099,plain,
( ~ aSet0(slsdtgt0(xb))
| ~ aSet0(slsdtgt0(xa))
| ~ skP1(xb,slsdtgt0(xb),slsdtgt0(xa)) ),
inference(obv,[status(thm),theory(equality)],[7098]),
[iquote('0:Obv:7098.2')] ).
cnf(7100,plain,
~ skP1(xb,slsdtgt0(xb),slsdtgt0(xa)),
inference(ssi,[status(thm)],[7099,32,3,184,4]),
[iquote('0:SSi:7099.1,7099.0,32.0,3.1,184.0,3.1,32.0,4.1,184.0,4.1')] ).
cnf(8828,plain,
( ~ aElement0(xb)
| ~ aElementOf0(sz00,u)
| ~ equal(xb,v)
| skP1(v,slsdtgt0(xb),u) ),
inference(res,[status(thm),theory(equality)],[24,660]),
[iquote('0:Res:24.0,660.1')] ).
cnf(8862,plain,
( ~ aElementOf0(sz00,u)
| ~ equal(xb,v)
| skP1(v,slsdtgt0(xb),u) ),
inference(ssi,[status(thm)],[8828,4]),
[iquote('0:SSi:8828.0,4.0')] ).
cnf(57356,plain,
( ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ equal(xb,xb) ),
inference(res,[status(thm),theory(equality)],[8862,7100]),
[iquote('0:Res:8862.2,7100.0')] ).
cnf(57357,plain,
~ aElementOf0(sz00,slsdtgt0(xa)),
inference(obv,[status(thm),theory(equality)],[57356]),
[iquote('0:Obv:57356.1')] ).
cnf(57358,plain,
$false,
inference(mrr,[status(thm)],[57357,21]),
[iquote('0:MRR:57357.0,21.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : RNG121+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n020.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 : Mon May 30 13:24:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 180.29/180.45
% 180.29/180.45 SPASS V 3.9
% 180.29/180.45 SPASS beiseite: Proof found.
% 180.29/180.45 % SZS status Theorem
% 180.29/180.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 180.29/180.45 SPASS derived 32377 clauses, backtracked 139 clauses, performed 11 splits and kept 10399 clauses.
% 180.29/180.45 SPASS allocated 171587 KBytes.
% 180.29/180.45 SPASS spent 0:2:37.28 on the problem.
% 180.29/180.45 0:00:00.03 for the input.
% 180.29/180.45 0:00:00.13 for the FLOTTER CNF translation.
% 180.29/180.45 0:00:00.67 for inferences.
% 180.29/180.45 0:00:00.33 for the backtracking.
% 180.29/180.45 0:2:35.79 for the reduction.
% 180.29/180.45
% 180.29/180.45
% 180.29/180.45 Here is a proof with depth 3, length 22 :
% 180.29/180.45 % SZS output start Refutation
% See solution above
% 180.29/180.45 Formulae used in the proof : m__2091 m__ m__2203 mPrIdeal m__2174 mAddZero mDefPrIdeal m__2666 mDefSSum
% 180.29/180.45
%------------------------------------------------------------------------------