TSTP Solution File: RNG102+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG102+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:28 EDT 2022
% Result : Theorem 1.56s 1.77s
% Output : Refutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 5 unt; 0 nHn; 10 RR)
% Number of literals : 20 ( 0 equ; 14 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
aElement0(xc),
file('RNG102+1.p',unknown),
[] ).
cnf(12,axiom,
aElement0(skf31(u,v)),
file('RNG102+1.p',unknown),
[] ).
cnf(14,axiom,
aElementOf0(xy,slsdtgt0(xc)),
file('RNG102+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ aElement0(u)
| ~ equal(sdtasdt0(xc,u),xy) ),
file('RNG102+1.p',unknown),
[] ).
cnf(67,axiom,
( ~ aElement0(u)
| ~ aElementOf0(v,w)
| ~ equal(w,slsdtgt0(u))
| equal(sdtasdt0(u,skf31(v,u)),v) ),
file('RNG102+1.p',unknown),
[] ).
cnf(748,plain,
( ~ aElement0(u)
| ~ aElementOf0(v,slsdtgt0(u))
| equal(sdtasdt0(u,skf31(v,u)),v) ),
inference(eqr,[status(thm),theory(equality)],[67]),
[iquote('0:EqR:67.2')] ).
cnf(4329,plain,
( ~ aElement0(xc)
| ~ aElement0(skf31(u,xc))
| ~ aElementOf0(u,slsdtgt0(xc))
| ~ equal(u,xy) ),
inference(spl,[status(thm),theory(equality)],[748,26]),
[iquote('0:SpL:748.2,26.1')] ).
cnf(4347,plain,
( ~ aElementOf0(u,slsdtgt0(xc))
| ~ equal(u,xy) ),
inference(ssi,[status(thm)],[4329,12,3]),
[iquote('0:SSi:4329.1,4329.0,12.0,3.0,3.0')] ).
cnf(4603,plain,
~ equal(xy,xy),
inference(res,[status(thm),theory(equality)],[14,4347]),
[iquote('0:Res:14.0,4347.0')] ).
cnf(4625,plain,
$false,
inference(obv,[status(thm),theory(equality)],[4603]),
[iquote('0:Obv:4603.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.11 % Problem : RNG102+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.14/0.33 % Computer : n020.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Mon May 30 12:23:24 EDT 2022
% 0.20/0.33 % CPUTime :
% 1.56/1.77
% 1.56/1.77 SPASS V 3.9
% 1.56/1.77 SPASS beiseite: Proof found.
% 1.56/1.77 % SZS status Theorem
% 1.56/1.77 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.56/1.77 SPASS derived 2906 clauses, backtracked 0 clauses, performed 3 splits and kept 1242 clauses.
% 1.56/1.77 SPASS allocated 102654 KBytes.
% 1.56/1.77 SPASS spent 0:00:01.32 on the problem.
% 1.56/1.77 0:00:00.03 for the input.
% 1.56/1.77 0:00:00.12 for the FLOTTER CNF translation.
% 1.56/1.77 0:00:00.04 for inferences.
% 1.56/1.77 0:00:00.04 for the backtracking.
% 1.56/1.77 0:00:01.04 for the reduction.
% 1.56/1.77
% 1.56/1.77
% 1.56/1.77 Here is a proof with depth 3, length 10 :
% 1.56/1.77 % SZS output start Refutation
% See solution above
% 1.56/1.77 Formulae used in the proof : m__1905 mDefPrIdeal m__1956 m__1933 m__
% 1.56/1.77
%------------------------------------------------------------------------------