TSTP Solution File: RNG093+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG093+2 : 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:27 EDT 2022
% Result : Theorem 1.31s 1.50s
% Output : Refutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 30 ( 9 unt; 0 nHn; 30 RR)
% Number of literals : 65 ( 0 equ; 42 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 : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
aElement0(skc3),
file('RNG093+2.p',unknown),
[] ).
cnf(11,axiom,
aElementOf0(skc2,sdtasasdt0(xI,xJ)),
file('RNG093+2.p',unknown),
[] ).
cnf(14,axiom,
aElementOf0(skf9(u),sdtasasdt0(xI,xJ)),
file('RNG093+2.p',unknown),
[] ).
cnf(23,axiom,
( ~ aElementOf0(u,sdtasasdt0(xI,xJ))
| aElementOf0(u,xI) ),
file('RNG093+2.p',unknown),
[] ).
cnf(24,axiom,
( ~ aElementOf0(u,sdtasasdt0(xI,xJ))
| aElementOf0(u,xJ) ),
file('RNG093+2.p',unknown),
[] ).
cnf(35,axiom,
( ~ skP2(skc2)
| ~ aElementOf0(sdtasdt0(skc3,skc2),sdtasasdt0(xI,xJ)) ),
file('RNG093+2.p',unknown),
[] ).
cnf(36,axiom,
( ~ aElementOf0(sdtpldt0(u,skf9(u)),sdtasasdt0(xI,xJ))
| skP2(u) ),
file('RNG093+2.p',unknown),
[] ).
cnf(39,axiom,
( ~ aElement0(u)
| ~ aElementOf0(v,xI)
| aElementOf0(sdtasdt0(u,v),xI) ),
file('RNG093+2.p',unknown),
[] ).
cnf(40,axiom,
( ~ aElement0(u)
| ~ aElementOf0(v,xJ)
| aElementOf0(sdtasdt0(u,v),xJ) ),
file('RNG093+2.p',unknown),
[] ).
cnf(41,axiom,
( ~ aElementOf0(u,xJ)
| ~ aElementOf0(u,xI)
| aElementOf0(u,sdtasasdt0(xI,xJ)) ),
file('RNG093+2.p',unknown),
[] ).
cnf(44,axiom,
( ~ aElementOf0(u,xI)
| ~ aElementOf0(v,xI)
| aElementOf0(sdtpldt0(u,v),xI) ),
file('RNG093+2.p',unknown),
[] ).
cnf(45,axiom,
( ~ aElementOf0(u,xJ)
| ~ aElementOf0(v,xJ)
| aElementOf0(sdtpldt0(u,v),xJ) ),
file('RNG093+2.p',unknown),
[] ).
cnf(78,plain,
( ~ aElementOf0(u,xI)
| aElementOf0(sdtasdt0(skc3,u),xI) ),
inference(res,[status(thm),theory(equality)],[1,39]),
[iquote('0:Res:1.0,39.0')] ).
cnf(79,plain,
( ~ aElementOf0(u,xJ)
| aElementOf0(sdtasdt0(skc3,u),xJ) ),
inference(res,[status(thm),theory(equality)],[1,40]),
[iquote('0:Res:1.0,40.0')] ).
cnf(144,plain,
aElementOf0(skc2,xI),
inference(res,[status(thm),theory(equality)],[11,23]),
[iquote('0:Res:11.0,23.0')] ).
cnf(145,plain,
aElementOf0(skc2,xJ),
inference(res,[status(thm),theory(equality)],[11,24]),
[iquote('0:Res:11.0,24.0')] ).
cnf(157,plain,
aElementOf0(skf9(u),xI),
inference(res,[status(thm),theory(equality)],[14,23]),
[iquote('0:Res:14.0,23.0')] ).
cnf(158,plain,
aElementOf0(skf9(u),xJ),
inference(res,[status(thm),theory(equality)],[14,24]),
[iquote('0:Res:14.0,24.0')] ).
cnf(530,plain,
( ~ aElementOf0(sdtpldt0(u,skf9(u)),xJ)
| ~ aElementOf0(sdtpldt0(u,skf9(u)),xI)
| skP2(u) ),
inference(res,[status(thm),theory(equality)],[41,36]),
[iquote('0:Res:41.2,36.0')] ).
cnf(5042,plain,
( ~ aElementOf0(u,xJ)
| ~ aElementOf0(skf9(u),xJ)
| ~ aElementOf0(sdtpldt0(u,skf9(u)),xI)
| skP2(u) ),
inference(res,[status(thm),theory(equality)],[45,530]),
[iquote('0:Res:45.2,530.0')] ).
cnf(5044,plain,
( ~ aElementOf0(u,xJ)
| ~ aElementOf0(sdtpldt0(u,skf9(u)),xI)
| skP2(u) ),
inference(mrr,[status(thm)],[5042,158]),
[iquote('0:MRR:5042.1,158.0')] ).
cnf(5102,plain,
( ~ aElementOf0(u,xI)
| ~ aElementOf0(skf9(u),xI)
| ~ aElementOf0(u,xJ)
| skP2(u) ),
inference(res,[status(thm),theory(equality)],[44,5044]),
[iquote('0:Res:44.2,5044.1')] ).
cnf(5104,plain,
( ~ aElementOf0(u,xI)
| ~ aElementOf0(u,xJ)
| skP2(u) ),
inference(mrr,[status(thm)],[5102,157]),
[iquote('0:MRR:5102.1,157.0')] ).
cnf(5248,plain,
( ~ aElementOf0(sdtasdt0(skc3,skc2),xJ)
| ~ aElementOf0(sdtasdt0(skc3,skc2),xI)
| ~ skP2(skc2) ),
inference(res,[status(thm),theory(equality)],[41,35]),
[iquote('0:Res:41.2,35.1')] ).
cnf(6390,plain,
( ~ aElementOf0(skc2,xJ)
| ~ aElementOf0(sdtasdt0(skc3,skc2),xI)
| ~ skP2(skc2) ),
inference(res,[status(thm),theory(equality)],[79,5248]),
[iquote('0:Res:79.1,5248.0')] ).
cnf(6393,plain,
( ~ aElementOf0(sdtasdt0(skc3,skc2),xI)
| ~ skP2(skc2) ),
inference(mrr,[status(thm)],[6390,145]),
[iquote('0:MRR:6390.0,145.0')] ).
cnf(6408,plain,
( ~ aElementOf0(skc2,xI)
| ~ skP2(skc2) ),
inference(res,[status(thm),theory(equality)],[78,6393]),
[iquote('0:Res:78.1,6393.0')] ).
cnf(6411,plain,
~ skP2(skc2),
inference(mrr,[status(thm)],[6408,144]),
[iquote('0:MRR:6408.0,144.0')] ).
cnf(6412,plain,
( ~ aElementOf0(skc2,xI)
| ~ aElementOf0(skc2,xJ) ),
inference(res,[status(thm),theory(equality)],[5104,6411]),
[iquote('0:Res:5104.2,6411.0')] ).
cnf(6413,plain,
$false,
inference(mrr,[status(thm)],[6412,144,145]),
[iquote('0:MRR:6412.0,6412.1,144.0,145.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG093+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n020.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 04:41:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.31/1.50
% 1.31/1.50 SPASS V 3.9
% 1.31/1.50 SPASS beiseite: Proof found.
% 1.31/1.50 % SZS status Theorem
% 1.31/1.50 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.31/1.50 SPASS derived 4310 clauses, backtracked 107 clauses, performed 2 splits and kept 1093 clauses.
% 1.31/1.50 SPASS allocated 103071 KBytes.
% 1.31/1.50 SPASS spent 0:00:01.00 on the problem.
% 1.31/1.50 0:00:00.04 for the input.
% 1.31/1.50 0:00:00.12 for the FLOTTER CNF translation.
% 1.31/1.50 0:00:00.07 for inferences.
% 1.31/1.50 0:00:00.00 for the backtracking.
% 1.31/1.50 0:00:00.73 for the reduction.
% 1.31/1.50
% 1.31/1.50
% 1.31/1.50 Here is a proof with depth 4, length 30 :
% 1.31/1.50 % SZS output start Refutation
% See solution above
% 1.31/1.50 Formulae used in the proof : m__ mSortsC_01 m__1150
% 1.31/1.50
%------------------------------------------------------------------------------