TSTP Solution File: RNG112+4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG112+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:31 EDT 2022
% Result : Theorem 0.49s 0.64s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 27 ( 14 unt; 3 nHn; 27 RR)
% Number of literals : 43 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(37,axiom,
~ equal(sz00,skc55),
file('RNG112+4.p',unknown),
[] ).
cnf(40,axiom,
~ equal(sz00,skc58),
file('RNG112+4.p',unknown),
[] ).
cnf(43,axiom,
~ equal(skf27(u),sz00),
file('RNG112+4.p',unknown),
[] ).
cnf(54,axiom,
( ~ aElementOf0(u,xI)
| skP6(u) ),
file('RNG112+4.p',unknown),
[] ).
cnf(60,axiom,
( ~ skP5(u)
| aElementOf0(skc58,xI) ),
file('RNG112+4.p',unknown),
[] ).
cnf(61,axiom,
equal(sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),xI),
file('RNG112+4.p',unknown),
[] ).
cnf(62,axiom,
aElementOf0(skc55,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
file('RNG112+4.p',unknown),
[] ).
cnf(83,axiom,
( ~ skP5(u)
| ~ iLess0(sbrdtbr0(u),sbrdtbr0(skc58)) ),
file('RNG112+4.p',unknown),
[] ).
cnf(84,axiom,
( ~ aElementOf0(u,xI)
| skP5(u)
| equal(u,sz00) ),
file('RNG112+4.p',unknown),
[] ).
cnf(85,axiom,
( ~ skP6(u)
| equal(u,sz00)
| aElementOf0(skf27(u),xI) ),
file('RNG112+4.p',unknown),
[] ).
cnf(102,axiom,
( ~ skP6(u)
| equal(u,sz00)
| iLess0(sbrdtbr0(skf27(u)),sbrdtbr0(u)) ),
file('RNG112+4.p',unknown),
[] ).
cnf(163,plain,
aElementOf0(skc55,xI),
inference(rew,[status(thm),theory(equality)],[61,62]),
[iquote('0:Rew:61.0,62.0')] ).
cnf(169,plain,
( ~ aElementOf0(skf27(u),xI)
| skP5(skf27(u)) ),
inference(res,[status(thm),theory(equality)],[84,43]),
[iquote('0:Res:84.1,43.0')] ).
cnf(210,plain,
skP6(skc55),
inference(res,[status(thm),theory(equality)],[163,54]),
[iquote('0:Res:163.0,54.0')] ).
cnf(212,plain,
( ~ skP6(skc58)
| aElementOf0(skf27(skc58),xI) ),
inference(res,[status(thm),theory(equality)],[85,40]),
[iquote('0:Res:85.2,40.0')] ).
cnf(213,plain,
( ~ skP6(skc55)
| aElementOf0(skf27(skc55),xI) ),
inference(res,[status(thm),theory(equality)],[85,37]),
[iquote('0:Res:85.2,37.0')] ).
cnf(216,plain,
( ~ skP6(skc58)
| iLess0(sbrdtbr0(skf27(skc58)),sbrdtbr0(skc58)) ),
inference(res,[status(thm),theory(equality)],[102,40]),
[iquote('0:Res:102.2,40.0')] ).
cnf(236,plain,
aElementOf0(skf27(skc55),xI),
inference(mrr,[status(thm)],[213,210]),
[iquote('0:MRR:213.0,210.0')] ).
cnf(273,plain,
( ~ aElementOf0(skc58,xI)
| aElementOf0(skf27(skc58),xI) ),
inference(sor,[status(thm)],[212,54]),
[iquote('0:SoR:212.0,54.1')] ).
cnf(285,plain,
( ~ aElementOf0(skf27(u),xI)
| aElementOf0(skc58,xI) ),
inference(ems,[status(thm)],[60,169]),
[iquote('0:EmS:60.0,169.1')] ).
cnf(286,plain,
aElementOf0(skc58,xI),
inference(res,[status(thm),theory(equality)],[236,285]),
[iquote('0:Res:236.0,285.0')] ).
cnf(289,plain,
aElementOf0(skf27(skc58),xI),
inference(mrr,[status(thm)],[273,286]),
[iquote('0:MRR:273.0,286.0')] ).
cnf(297,plain,
( ~ aElementOf0(skc58,xI)
| iLess0(sbrdtbr0(skf27(skc58)),sbrdtbr0(skc58)) ),
inference(sor,[status(thm)],[216,54]),
[iquote('0:SoR:216.0,54.1')] ).
cnf(298,plain,
iLess0(sbrdtbr0(skf27(skc58)),sbrdtbr0(skc58)),
inference(mrr,[status(thm)],[297,286]),
[iquote('0:MRR:297.0,286.0')] ).
cnf(299,plain,
~ skP5(skf27(skc58)),
inference(res,[status(thm),theory(equality)],[298,83]),
[iquote('0:Res:298.0,83.1')] ).
cnf(300,plain,
~ aElementOf0(skf27(skc58),xI),
inference(sor,[status(thm)],[299,169]),
[iquote('0:SoR:299.0,169.1')] ).
cnf(301,plain,
$false,
inference(mrr,[status(thm)],[300,289]),
[iquote('0:MRR:300.0,289.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12 % Problem : RNG112+4 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon May 30 04:45:24 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.49/0.64
% 0.49/0.64 SPASS V 3.9
% 0.49/0.64 SPASS beiseite: Proof found.
% 0.49/0.64 % SZS status Theorem
% 0.49/0.64 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.49/0.64 SPASS derived 71 clauses, backtracked 0 clauses, performed 0 splits and kept 203 clauses.
% 0.49/0.64 SPASS allocated 100382 KBytes.
% 0.49/0.64 SPASS spent 0:00:00.28 on the problem.
% 0.49/0.64 0:00:00.04 for the input.
% 0.49/0.64 0:00:00.20 for the FLOTTER CNF translation.
% 0.49/0.64 0:00:00.00 for inferences.
% 0.49/0.64 0:00:00.00 for the backtracking.
% 0.49/0.64 0:00:00.01 for the reduction.
% 0.49/0.64
% 0.49/0.64
% 0.49/0.64 Here is a proof with depth 4, length 27 :
% 0.49/0.64 % SZS output start Refutation
% See solution above
% 0.49/0.64 Formulae used in the proof : m__2228 m__2203 m__2351 m__ m__2174
% 0.49/0.64
%------------------------------------------------------------------------------