TSTP Solution File: RNG099+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG099+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 0.19s 0.55s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 28 ( 16 unt; 0 nHn; 28 RR)
% Number of literals : 52 ( 0 equ; 27 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
aIdeal0(xI),
file('RNG099+1.p',unknown),
[] ).
cnf(4,axiom,
aIdeal0(xJ),
file('RNG099+1.p',unknown),
[] ).
cnf(5,axiom,
aElement0(xx),
file('RNG099+1.p',unknown),
[] ).
cnf(6,axiom,
aElement0(xy),
file('RNG099+1.p',unknown),
[] ).
cnf(8,axiom,
aElementOf0(xa,xI),
file('RNG099+1.p',unknown),
[] ).
cnf(9,axiom,
aElementOf0(xb,xJ),
file('RNG099+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ aIdeal0(u)
| aSet0(u) ),
file('RNG099+1.p',unknown),
[] ).
cnf(14,axiom,
aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),
file('RNG099+1.p',unknown),
[] ).
cnf(15,axiom,
aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ),
file('RNG099+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,u)
| aElement0(v) ),
file('RNG099+1.p',unknown),
[] ).
cnf(29,axiom,
equal(sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),xw),
file('RNG099+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| aElement0(sdtpldt0(v,u)) ),
file('RNG099+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| aElement0(sdtasdt0(v,u)) ),
file('RNG099+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ aElement0(u)
| ~ sdteqdtlpzmzozddtrp0(u,xy,xJ)
| ~ sdteqdtlpzmzozddtrp0(u,xx,xI) ),
file('RNG099+1.p',unknown),
[] ).
cnf(52,axiom,
( ~ aIdeal0(u)
| ~ aElement0(v)
| ~ aElement0(w)
| ~ aElementOf0(sdtpldt0(w,smndt0(v)),u)
| sdteqdtlpzmzozddtrp0(w,v,u) ),
file('RNG099+1.p',unknown),
[] ).
cnf(94,plain,
( ~ aSet0(xJ)
| aElement0(xb) ),
inference(res,[status(thm),theory(equality)],[9,26]),
[iquote('0:Res:9.0,26.1')] ).
cnf(96,plain,
( ~ aSet0(xI)
| aElement0(xa) ),
inference(res,[status(thm),theory(equality)],[8,26]),
[iquote('0:Res:8.0,26.1')] ).
cnf(101,plain,
aElement0(xb),
inference(ssi,[status(thm)],[94,11,4]),
[iquote('0:SSi:94.0,11.0,4.1')] ).
cnf(102,plain,
aElement0(xa),
inference(ssi,[status(thm)],[96,11,3]),
[iquote('0:SSi:96.0,11.0,3.1')] ).
cnf(129,plain,
( ~ aElement0(sdtasdt0(xx,xb))
| ~ aElement0(sdtasdt0(xy,xa))
| aElement0(xw) ),
inference(spr,[status(thm),theory(equality)],[29,30]),
[iquote('0:SpR:29.0,30.2')] ).
cnf(132,plain,
aElement0(xw),
inference(ssi,[status(thm)],[129,31,6,102,5,101]),
[iquote('0:SSi:129.1,129.0,31.0,6.0,102.2,31.0,5.0,101.2')] ).
cnf(660,plain,
( ~ aIdeal0(xJ)
| ~ aElement0(xy)
| ~ aElement0(xw)
| sdteqdtlpzmzozddtrp0(xw,xy,xJ) ),
inference(res,[status(thm),theory(equality)],[15,52]),
[iquote('0:Res:15.0,52.3')] ).
cnf(661,plain,
( ~ aIdeal0(xI)
| ~ aElement0(xx)
| ~ aElement0(xw)
| sdteqdtlpzmzozddtrp0(xw,xx,xI) ),
inference(res,[status(thm),theory(equality)],[14,52]),
[iquote('0:Res:14.0,52.3')] ).
cnf(664,plain,
sdteqdtlpzmzozddtrp0(xw,xy,xJ),
inference(ssi,[status(thm)],[660,132,6,4]),
[iquote('0:SSi:660.2,660.1,660.0,132.0,6.0,4.0')] ).
cnf(665,plain,
sdteqdtlpzmzozddtrp0(xw,xx,xI),
inference(ssi,[status(thm)],[661,132,5,3]),
[iquote('0:SSi:661.2,661.1,661.0,132.0,5.0,3.0')] ).
cnf(677,plain,
( ~ aElement0(xw)
| ~ sdteqdtlpzmzozddtrp0(xw,xx,xI) ),
inference(res,[status(thm),theory(equality)],[664,38]),
[iquote('0:Res:664.0,38.1')] ).
cnf(678,plain,
~ sdteqdtlpzmzozddtrp0(xw,xx,xI),
inference(ssi,[status(thm)],[677,132]),
[iquote('0:SSi:677.0,132.0')] ).
cnf(679,plain,
$false,
inference(mrr,[status(thm)],[678,665]),
[iquote('0:MRR:678.0,665.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : RNG099+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon May 30 08:25:54 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.55
% 0.19/0.55 SPASS V 3.9
% 0.19/0.55 SPASS beiseite: Proof found.
% 0.19/0.55 % SZS status Theorem
% 0.19/0.55 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55 SPASS derived 417 clauses, backtracked 0 clauses, performed 1 splits and kept 216 clauses.
% 0.19/0.55 SPASS allocated 98815 KBytes.
% 0.19/0.55 SPASS spent 0:00:00.20 on the problem.
% 0.19/0.55 0:00:00.03 for the input.
% 0.19/0.55 0:00:00.10 for the FLOTTER CNF translation.
% 0.19/0.55 0:00:00.01 for inferences.
% 0.19/0.55 0:00:00.00 for the backtracking.
% 0.19/0.55 0:00:00.03 for the reduction.
% 0.19/0.55
% 0.19/0.55
% 0.19/0.55 Here is a proof with depth 2, length 28 :
% 0.19/0.55 % SZS output start Refutation
% See solution above
% 0.19/0.55 Formulae used in the proof : m__1205 m__1217 m__1294 mDefIdeal m__1332 m__1409 mEOfElem m__1319 mSortsB mSortsB_02 m__ mDefMod
% 0.19/0.55
%------------------------------------------------------------------------------