TSTP Solution File: RNG101+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG101+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:28 EDT 2022
% Result : Theorem 0.18s 0.53s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR)
% Number of literals : 6 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
aElement0(skc37),
file('RNG101+2.p',unknown),
[] ).
cnf(17,axiom,
equal(sdtasdt0(xc,skc37),xx),
file('RNG101+2.p',unknown),
[] ).
cnf(28,axiom,
( ~ aElement0(u)
| ~ equal(sdtasdt0(xc,u),xx) ),
file('RNG101+2.p',unknown),
[] ).
cnf(108,plain,
~ aElement0(skc37),
inference(res,[status(thm),theory(equality)],[17,28]),
[iquote('0:Res:17.0,28.1')] ).
cnf(109,plain,
$false,
inference(mrr,[status(thm)],[108,5]),
[iquote('0:MRR:108.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : RNG101+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.32 % Computer : n021.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % 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 08:11:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.53
% 0.18/0.53 SPASS V 3.9
% 0.18/0.53 SPASS beiseite: Proof found.
% 0.18/0.53 % SZS status Theorem
% 0.18/0.53 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.53 SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 95 clauses.
% 0.18/0.53 SPASS allocated 99338 KBytes.
% 0.18/0.53 SPASS spent 0:00:00.19 on the problem.
% 0.18/0.53 0:00:00.04 for the input.
% 0.18/0.53 0:00:00.12 for the FLOTTER CNF translation.
% 0.18/0.53 0:00:00.00 for inferences.
% 0.18/0.53 0:00:00.00 for the backtracking.
% 0.18/0.53 0:00:00.01 for the reduction.
% 0.18/0.53
% 0.18/0.53
% 0.18/0.53 Here is a proof with depth 1, length 5 :
% 0.18/0.53 % SZS output start Refutation
% See solution above
% 0.18/0.53 Formulae used in the proof : m__1933 m__
% 0.18/0.53
%------------------------------------------------------------------------------