TSTP Solution File: RNG119+4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG119+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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.66s 0.91s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 21 ( 11 unt; 0 nHn; 21 RR)
% Number of literals : 35 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(8,axiom,
aSet0(xI),
file('RNG119+4.p',unknown),
[] ).
cnf(9,axiom,
aIdeal0(xI),
file('RNG119+4.p',unknown),
[] ).
cnf(17,axiom,
aElement0(xq),
file('RNG119+4.p',unknown),
[] ).
cnf(19,axiom,
equal(sz00,xr),
file('RNG119+4.p',unknown),
[] ).
cnf(30,axiom,
aElementOf0(xu,xI),
file('RNG119+4.p',unknown),
[] ).
cnf(73,axiom,
equal(sdtpldt0(sdtasdt0(xq,xu),xr),xb),
file('RNG119+4.p',unknown),
[] ).
cnf(74,axiom,
( ~ aElement0(u)
| equal(sdtpldt0(u,sz00),u) ),
file('RNG119+4.p',unknown),
[] ).
cnf(85,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,u)
| aElement0(v) ),
file('RNG119+4.p',unknown),
[] ).
cnf(95,axiom,
( ~ aElement0(u)
| ~ equal(sdtasdt0(xu,u),xb) ),
file('RNG119+4.p',unknown),
[] ).
cnf(97,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| aElement0(sdtasdt0(v,u)) ),
file('RNG119+4.p',unknown),
[] ).
cnf(117,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| equal(sdtasdt0(v,u),sdtasdt0(u,v)) ),
file('RNG119+4.p',unknown),
[] ).
cnf(188,plain,
( ~ aElement0(u)
| equal(sdtpldt0(u,xr),u) ),
inference(rew,[status(thm),theory(equality)],[19,74]),
[iquote('0:Rew:19.0,74.1')] ).
cnf(1059,plain,
( ~ aSet0(xI)
| aElement0(xu) ),
inference(res,[status(thm),theory(equality)],[30,85]),
[iquote('0:Res:30.0,85.1')] ).
cnf(1072,plain,
aElement0(xu),
inference(ssi,[status(thm)],[1059,9,8]),
[iquote('0:SSi:1059.0,9.0,8.0')] ).
cnf(2054,plain,
( ~ aElement0(sdtasdt0(xq,xu))
| equal(sdtasdt0(xq,xu),xb) ),
inference(spr,[status(thm),theory(equality)],[188,73]),
[iquote('0:SpR:188.1,73.0')] ).
cnf(2062,plain,
equal(sdtasdt0(xq,xu),xb),
inference(ssi,[status(thm)],[2054,97,17,1072]),
[iquote('0:SSi:2054.0,97.0,17.0,1072.2')] ).
cnf(2666,plain,
( ~ aElement0(xu)
| ~ aElement0(xq)
| equal(sdtasdt0(xu,xq),xb) ),
inference(spr,[status(thm),theory(equality)],[117,2062]),
[iquote('0:SpR:117.2,2062.0')] ).
cnf(2701,plain,
equal(sdtasdt0(xu,xq),xb),
inference(ssi,[status(thm)],[2666,17,1072]),
[iquote('0:SSi:2666.1,2666.0,17.0,1072.0')] ).
cnf(2740,plain,
( ~ aElement0(xq)
| ~ equal(xb,xb) ),
inference(spl,[status(thm),theory(equality)],[2701,95]),
[iquote('0:SpL:2701.0,95.1')] ).
cnf(2741,plain,
~ aElement0(xq),
inference(obv,[status(thm),theory(equality)],[2740]),
[iquote('0:Obv:2740.1')] ).
cnf(2742,plain,
$false,
inference(ssi,[status(thm)],[2741,17]),
[iquote('0:SSi:2741.0,17.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG119+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon May 30 11:58:14 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.66/0.91
% 0.66/0.91 SPASS V 3.9
% 0.66/0.91 SPASS beiseite: Proof found.
% 0.66/0.91 % SZS status Theorem
% 0.66/0.91 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.66/0.91 SPASS derived 2159 clauses, backtracked 751 clauses, performed 21 splits and kept 1804 clauses.
% 0.66/0.91 SPASS allocated 100298 KBytes.
% 0.66/0.91 SPASS spent 0:00:00.54 on the problem.
% 0.66/0.91 0:00:00.04 for the input.
% 0.66/0.91 0:00:00.20 for the FLOTTER CNF translation.
% 0.66/0.91 0:00:00.01 for inferences.
% 0.66/0.91 0:00:00.01 for the backtracking.
% 0.66/0.91 0:00:00.22 for the reduction.
% 0.66/0.91
% 0.66/0.91
% 0.66/0.91 Here is a proof with depth 3, length 21 :
% 0.66/0.91 % SZS output start Refutation
% See solution above
% 0.66/0.91 Formulae used in the proof : m__2174 m__2666 m__2273 m__ mAddZero mEOfElem m__2612 mSortsB_02 mMulComm
% 0.66/0.91
%------------------------------------------------------------------------------