TSTP Solution File: RNG119+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG119+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:32 EDT 2022
% Result : Theorem 0.69s 0.87s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 27 ( 12 unt; 0 nHn; 27 RR)
% Number of literals : 56 ( 0 equ; 30 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
aIdeal0(xI),
file('RNG119+1.p',unknown),
[] ).
cnf(8,axiom,
aElement0(xq),
file('RNG119+1.p',unknown),
[] ).
cnf(9,axiom,
aElement0(xr),
file('RNG119+1.p',unknown),
[] ).
cnf(10,axiom,
equal(sz00,xr),
file('RNG119+1.p',unknown),
[] ).
cnf(12,axiom,
aElementOf0(xu,xI),
file('RNG119+1.p',unknown),
[] ).
cnf(27,axiom,
~ doDivides0(xu,xb),
file('RNG119+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ aIdeal0(u)
| aSet0(u) ),
file('RNG119+1.p',unknown),
[] ).
cnf(34,axiom,
equal(sdtpldt0(sdtasdt0(xq,xu),xr),xb),
file('RNG119+1.p',unknown),
[] ).
cnf(36,axiom,
( ~ aElement0(u)
| equal(sdtpldt0(sz00,u),u) ),
file('RNG119+1.p',unknown),
[] ).
cnf(47,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,u)
| aElement0(v) ),
file('RNG119+1.p',unknown),
[] ).
cnf(54,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| aElement0(sdtasdt0(v,u)) ),
file('RNG119+1.p',unknown),
[] ).
cnf(65,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| equal(sdtpldt0(v,u),sdtpldt0(u,v)) ),
file('RNG119+1.p',unknown),
[] ).
cnf(66,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| equal(sdtasdt0(v,u),sdtasdt0(u,v)) ),
file('RNG119+1.p',unknown),
[] ).
cnf(84,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| ~ aElement0(w)
| ~ equal(sdtasdt0(v,w),u)
| doDivides0(v,u) ),
file('RNG119+1.p',unknown),
[] ).
cnf(123,plain,
( ~ aElement0(u)
| equal(sdtpldt0(xr,u),u) ),
inference(rew,[status(thm),theory(equality)],[10,36]),
[iquote('0:Rew:10.0,36.1')] ).
cnf(570,plain,
( ~ aSet0(xI)
| aElement0(xu) ),
inference(res,[status(thm),theory(equality)],[12,47]),
[iquote('0:Res:12.0,47.1')] ).
cnf(577,plain,
aElement0(xu),
inference(ssi,[status(thm)],[570,28,5]),
[iquote('0:SSi:570.0,28.0,5.1')] ).
cnf(1276,plain,
( ~ aElement0(sdtasdt0(u,v))
| ~ aElement0(u)
| ~ aElement0(v)
| doDivides0(u,sdtasdt0(u,v)) ),
inference(eqr,[status(thm),theory(equality)],[84]),
[iquote('0:EqR:84.3')] ).
cnf(1298,plain,
( ~ aElement0(u)
| ~ aElement0(v)
| doDivides0(u,sdtasdt0(u,v)) ),
inference(ssi,[status(thm)],[1276,54]),
[iquote('0:SSi:1276.0,54.2')] ).
cnf(2999,plain,
( ~ aElement0(xr)
| ~ aElement0(sdtasdt0(xq,xu))
| equal(sdtpldt0(xr,sdtasdt0(xq,xu)),xb) ),
inference(spr,[status(thm),theory(equality)],[34,65]),
[iquote('0:SpR:34.0,65.2')] ).
cnf(3008,plain,
( ~ aElement0(xr)
| ~ aElement0(sdtasdt0(xq,xu))
| equal(sdtasdt0(xq,xu),xb) ),
inference(rew,[status(thm),theory(equality)],[123,2999]),
[iquote('0:Rew:123.1,2999.2')] ).
cnf(3009,plain,
equal(sdtasdt0(xq,xu),xb),
inference(ssi,[status(thm)],[3008,54,8,577,9]),
[iquote('0:SSi:3008.1,3008.0,54.0,8.0,577.0,9.2')] ).
cnf(3249,plain,
( ~ aElement0(xu)
| ~ aElement0(xq)
| equal(sdtasdt0(xu,xq),xb) ),
inference(spr,[status(thm),theory(equality)],[3009,66]),
[iquote('0:SpR:3009.0,66.2')] ).
cnf(3257,plain,
equal(sdtasdt0(xu,xq),xb),
inference(ssi,[status(thm)],[3249,8,577]),
[iquote('0:SSi:3249.1,3249.0,8.0,577.0')] ).
cnf(3278,plain,
( ~ aElement0(xu)
| ~ aElement0(xq)
| doDivides0(xu,xb) ),
inference(spr,[status(thm),theory(equality)],[3257,1298]),
[iquote('0:SpR:3257.0,1298.2')] ).
cnf(3282,plain,
doDivides0(xu,xb),
inference(ssi,[status(thm)],[3278,8,577]),
[iquote('0:SSi:3278.1,3278.0,8.0,577.0')] ).
cnf(3283,plain,
$false,
inference(mrr,[status(thm)],[3282,27]),
[iquote('0:MRR:3282.0,27.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : RNG119+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n025.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:37:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/0.87
% 0.69/0.87 SPASS V 3.9
% 0.69/0.87 SPASS beiseite: Proof found.
% 0.69/0.87 % SZS status Theorem
% 0.69/0.87 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.69/0.87 SPASS derived 2435 clauses, backtracked 416 clauses, performed 16 splits and kept 1390 clauses.
% 0.69/0.87 SPASS allocated 99804 KBytes.
% 0.69/0.87 SPASS spent 0:00:00.52 on the problem.
% 0.69/0.87 0:00:00.03 for the input.
% 0.69/0.87 0:00:00.12 for the FLOTTER CNF translation.
% 0.69/0.87 0:00:00.02 for inferences.
% 0.69/0.87 0:00:00.01 for the backtracking.
% 0.69/0.87 0:00:00.27 for the reduction.
% 0.69/0.87
% 0.69/0.87
% 0.69/0.87 Here is a proof with depth 3, length 27 :
% 0.69/0.87 % SZS output start Refutation
% See solution above
% 0.69/0.87 Formulae used in the proof : m__2174 m__2666 m__ m__2273 m__2612 mDefIdeal mAddZero mEOfElem mSortsB_02 mAddComm mMulComm mDefDiv
% 0.69/0.87
%------------------------------------------------------------------------------