TSTP Solution File: RNG115+4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG115+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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.18s 0.60s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 5 unt; 0 nHn; 8 RR)
% Number of literals : 12 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(39,axiom,
aElementOf0(skc57,slsdtgt0(xa)),
file('RNG115+4.p',unknown),
[] ).
cnf(40,axiom,
aElementOf0(skc56,slsdtgt0(xb)),
file('RNG115+4.p',unknown),
[] ).
cnf(52,axiom,
equal(sdtpldt0(skc57,skc56),xu),
file('RNG115+4.p',unknown),
[] ).
cnf(62,axiom,
( ~ aElementOf0(u,slsdtgt0(xa))
| skP5(u) ),
file('RNG115+4.p',unknown),
[] ).
cnf(115,axiom,
( ~ skP5(u)
| ~ aElementOf0(v,slsdtgt0(xb))
| ~ equal(sdtpldt0(u,v),xu) ),
file('RNG115+4.p',unknown),
[] ).
cnf(165,plain,
skP5(skc57),
inference(res,[status(thm),theory(equality)],[39,62]),
[iquote('0:Res:39.0,62.0')] ).
cnf(200,plain,
( ~ skP5(skc57)
| ~ aElementOf0(skc56,slsdtgt0(xb)) ),
inference(res,[status(thm),theory(equality)],[52,115]),
[iquote('0:Res:52.0,115.2')] ).
cnf(229,plain,
$false,
inference(mrr,[status(thm)],[200,165,40]),
[iquote('0:MRR:200.0,200.1,165.0,40.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : RNG115+4 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 05:02:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.60
% 0.18/0.60 SPASS V 3.9
% 0.18/0.60 SPASS beiseite: Proof found.
% 0.18/0.60 % SZS status Theorem
% 0.18/0.60 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.60 SPASS derived 38 clauses, backtracked 0 clauses, performed 0 splits and kept 179 clauses.
% 0.18/0.60 SPASS allocated 100030 KBytes.
% 0.18/0.60 SPASS spent 0:00:00.26 on the problem.
% 0.18/0.60 0:00:00.04 for the input.
% 0.18/0.60 0:00:00.19 for the FLOTTER CNF translation.
% 0.18/0.60 0:00:00.00 for inferences.
% 0.18/0.60 0:00:00.00 for the backtracking.
% 0.18/0.60 0:00:00.01 for the reduction.
% 0.18/0.60
% 0.18/0.60
% 0.18/0.60 Here is a proof with depth 1, length 8 :
% 0.18/0.60 % SZS output start Refutation
% See solution above
% 0.18/0.60 Formulae used in the proof : m__2273 m__
% 0.18/0.60
%------------------------------------------------------------------------------