%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG101+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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.75s 1.93s
% Output : Refutation 1.75s
% 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('RNG101+1.p',unknown),
[] ).
cnf(11,axiom,
aElement0(skf31(u,v)),
file('RNG101+1.p',unknown),
[] ).
cnf(12,axiom,
aElementOf0(xx,slsdtgt0(xc)),
file('RNG101+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ aElement0(u)
| ~ equal(sdtasdt0(xc,u),xx) ),
file('RNG101+1.p',unknown),
[] ).
cnf(65,axiom,
( ~ aElement0(u)
| ~ aElementOf0(v,w)
| ~ equal(w,slsdtgt0(u))
| equal(sdtasdt0(u,skf31(v,u)),v) ),
file('RNG101+1.p',unknown),
[] ).
cnf(763,plain,
( ~ aElement0(u)
| ~ aElementOf0(v,slsdtgt0(u))
| equal(sdtasdt0(u,skf31(v,u)),v) ),
inference(eqr,[status(thm),theory(equality)],[65]),
[iquote('0:EqR:65.2')] ).
cnf(4910,plain,
( ~ aElement0(xc)
| ~ aElement0(skf31(u,xc))
| ~ aElementOf0(u,slsdtgt0(xc))
| ~ equal(u,xx) ),
inference(spl,[status(thm),theory(equality)],[763,24]),
[iquote('0:SpL:763.2,24.1')] ).
cnf(4928,plain,
( ~ aElementOf0(u,slsdtgt0(xc))
| ~ equal(u,xx) ),
inference(ssi,[status(thm)],[4910,11,3]),
[iquote('0:SSi:4910.1,4910.0,11.0,3.0,3.0')] ).
cnf(5177,plain,
~ equal(xx,xx),
inference(res,[status(thm),theory(equality)],[12,4928]),
[iquote('0:Res:12.0,4928.0')] ).
cnf(5197,plain,
$false,
inference(obv,[status(thm),theory(equality)],[5177]),
[iquote('0:Obv:5177.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : RNG101+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n023.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 07:32:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.75/1.93
% 1.75/1.93 SPASS V 3.9
% 1.75/1.93 SPASS beiseite: Proof found.
% 1.75/1.93 % SZS status Theorem
% 1.75/1.93 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.75/1.93 SPASS derived 3263 clauses, backtracked 0 clauses, performed 2 splits and kept 1266 clauses.
% 1.75/1.93 SPASS allocated 102973 KBytes.
% 1.75/1.93 SPASS spent 0:00:01.43 on the problem.
% 1.75/1.93 0:00:00.03 for the input.
% 1.75/1.93 0:00:00.11 for the FLOTTER CNF translation.
% 1.75/1.93 0:00:00.04 for inferences.
% 1.75/1.93 0:00:00.00 for the backtracking.
% 1.75/1.93 0:00:01.20 for the reduction.
% 1.75/1.93
% 1.75/1.93
% 1.75/1.93 Here is a proof with depth 3, length 10 :
% 1.75/1.93 % SZS output start Refutation
% See solution above
% 1.75/1.93 Formulae used in the proof : m__1905 mDefPrIdeal m__1933 m__
% 1.75/1.93
%------------------------------------------------------------------------------