TSTP Solution File: RNG112+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG112+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n032.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:30 EDT 2022
% Result : Theorem 0.14s 0.46s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 20 ( 12 unt; 3 nHn; 20 RR)
% Number of literals : 32 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(18,axiom,
~ equal(sz00,skc37),
file('RNG112+1.p',unknown),
[] ).
cnf(19,axiom,
~ equal(sz00,skc38),
file('RNG112+1.p',unknown),
[] ).
cnf(20,axiom,
~ equal(skf18(u),sz00),
file('RNG112+1.p',unknown),
[] ).
cnf(25,axiom,
equal(sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),xI),
file('RNG112+1.p',unknown),
[] ).
cnf(26,axiom,
aElementOf0(skc37,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
file('RNG112+1.p',unknown),
[] ).
cnf(50,axiom,
( ~ aElementOf0(u,xI)
| equal(u,sz00)
| aElementOf0(skc38,xI) ),
file('RNG112+1.p',unknown),
[] ).
cnf(51,axiom,
( ~ aElementOf0(u,xI)
| equal(u,sz00)
| aElementOf0(skf18(u),xI) ),
file('RNG112+1.p',unknown),
[] ).
cnf(56,axiom,
( ~ aElementOf0(u,xI)
| equal(u,sz00)
| iLess0(sbrdtbr0(skf18(u)),sbrdtbr0(u)) ),
file('RNG112+1.p',unknown),
[] ).
cnf(61,axiom,
( ~ aElementOf0(u,xI)
| ~ iLess0(sbrdtbr0(u),sbrdtbr0(skc38))
| equal(u,sz00) ),
file('RNG112+1.p',unknown),
[] ).
cnf(105,plain,
aElementOf0(skc37,xI),
inference(rew,[status(thm),theory(equality)],[25,26]),
[iquote('0:Rew:25.0,26.0')] ).
cnf(119,plain,
( ~ aElementOf0(skc38,xI)
| aElementOf0(skf18(skc38),xI) ),
inference(res,[status(thm),theory(equality)],[51,19]),
[iquote('0:Res:51.2,19.0')] ).
cnf(124,plain,
( ~ aElementOf0(skc38,xI)
| iLess0(sbrdtbr0(skf18(skc38)),sbrdtbr0(skc38)) ),
inference(res,[status(thm),theory(equality)],[56,19]),
[iquote('0:Res:56.2,19.0')] ).
cnf(135,plain,
( ~ aElementOf0(u,xI)
| equal(u,sz00) ),
inference(spt,[spt(split,[position(s1)])],[50]),
[iquote('1:Spt:50.0,50.1')] ).
cnf(136,plain,
equal(sz00,skc37),
inference(res,[status(thm),theory(equality)],[105,135]),
[iquote('1:Res:105.0,135.0')] ).
cnf(137,plain,
$false,
inference(mrr,[status(thm)],[136,18]),
[iquote('1:MRR:136.0,18.0')] ).
cnf(138,plain,
aElementOf0(skc38,xI),
inference(spt,[spt(split,[position(s2)])],[50]),
[iquote('1:Spt:137.0,50.2')] ).
cnf(139,plain,
aElementOf0(skf18(skc38),xI),
inference(mrr,[status(thm)],[119,138]),
[iquote('1:MRR:119.0,138.0')] ).
cnf(140,plain,
iLess0(sbrdtbr0(skf18(skc38)),sbrdtbr0(skc38)),
inference(mrr,[status(thm)],[124,138]),
[iquote('1:MRR:124.0,138.0')] ).
cnf(207,plain,
( ~ aElementOf0(skf18(skc38),xI)
| equal(skf18(skc38),sz00) ),
inference(res,[status(thm),theory(equality)],[140,61]),
[iquote('1:Res:140.0,61.1')] ).
cnf(209,plain,
$false,
inference(mrr,[status(thm)],[207,139,20]),
[iquote('1:MRR:207.0,207.1,139.0,20.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : RNG112+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.10 % Command : run_spass %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Mon May 30 09:39:42 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.14/0.46
% 0.14/0.46 SPASS V 3.9
% 0.14/0.46 SPASS beiseite: Proof found.
% 0.14/0.46 % SZS status Theorem
% 0.14/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.46 SPASS derived 71 clauses, backtracked 4 clauses, performed 1 splits and kept 135 clauses.
% 0.14/0.46 SPASS allocated 99551 KBytes.
% 0.14/0.46 SPASS spent 0:00:00.16 on the problem.
% 0.14/0.46 0:00:00.02 for the input.
% 0.14/0.46 0:00:00.11 for the FLOTTER CNF translation.
% 0.14/0.46 0:00:00.00 for inferences.
% 0.14/0.46 0:00:00.00 for the backtracking.
% 0.14/0.46 0:00:00.01 for the reduction.
% 0.14/0.46
% 0.14/0.46
% 0.14/0.46 Here is a proof with depth 2, length 20 :
% 0.14/0.46 % SZS output start Refutation
% See solution above
% 0.14/0.46 Formulae used in the proof : m__2228 m__2351 m__ m__2174
% 0.14/0.46
%------------------------------------------------------------------------------