TSTP Solution File: RNG124+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG124+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:33 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 4 unt; 1 nHn; 7 RR)
% Number of literals : 11 ( 0 equ; 4 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 : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(14,axiom,
aElementOf0(xr,xI),
file('RNG124+1.p',unknown),
[] ).
cnf(29,axiom,
~ equal(sz00,xr),
file('RNG124+1.p',unknown),
[] ).
cnf(47,axiom,
( equal(sz00,xr)
| iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ),
file('RNG124+1.p',unknown),
[] ).
cnf(73,axiom,
( ~ aElementOf0(u,xI)
| ~ iLess0(sbrdtbr0(u),sbrdtbr0(xu))
| equal(u,sz00) ),
file('RNG124+1.p',unknown),
[] ).
cnf(118,plain,
iLess0(sbrdtbr0(xr),sbrdtbr0(xu)),
inference(mrr,[status(thm)],[47,29]),
[iquote('0:MRR:47.0,29.0')] ).
cnf(187,plain,
( ~ aElementOf0(xr,xI)
| equal(sz00,xr) ),
inference(res,[status(thm),theory(equality)],[118,73]),
[iquote('0:Res:118.0,73.1')] ).
cnf(189,plain,
$false,
inference(mrr,[status(thm)],[187,14,29]),
[iquote('0:MRR:187.0,187.1,14.0,29.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : RNG124+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon May 30 20:36:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.55
% 0.20/0.55 SPASS V 3.9
% 0.20/0.55 SPASS beiseite: Proof found.
% 0.20/0.55 % SZS status Theorem
% 0.20/0.55 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.55 SPASS derived 61 clauses, backtracked 0 clauses, performed 0 splits and kept 128 clauses.
% 0.20/0.55 SPASS allocated 99472 KBytes.
% 0.20/0.55 SPASS spent 0:00:00.20 on the problem.
% 0.20/0.55 0:00:00.04 for the input.
% 0.20/0.55 0:00:00.13 for the FLOTTER CNF translation.
% 0.20/0.55 0:00:00.00 for inferences.
% 0.20/0.55 0:00:00.00 for the backtracking.
% 0.20/0.55 0:00:00.01 for the reduction.
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 Here is a proof with depth 1, length 7 :
% 0.20/0.55 % SZS output start Refutation
% See solution above
% 0.20/0.55 Formulae used in the proof : m__2729 m__2673 m__2666 m__2273
% 0.20/0.55
%------------------------------------------------------------------------------