TSTP Solution File: RNG089+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG089+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:26 EDT 2022
% Result : Theorem 0.18s 0.51s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 8 unt; 0 nHn; 13 RR)
% Number of literals : 23 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
aIdeal0(xI),
file('RNG089+1.p',unknown),
[] ).
cnf(4,axiom,
aIdeal0(xJ),
file('RNG089+1.p',unknown),
[] ).
cnf(5,axiom,
aElement0(xz),
file('RNG089+1.p',unknown),
[] ).
cnf(7,axiom,
aElementOf0(xk,xI),
file('RNG089+1.p',unknown),
[] ).
cnf(8,axiom,
aElementOf0(xl,xJ),
file('RNG089+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ aElementOf0(sdtasdt0(xz,xl),xJ)
| ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
file('RNG089+1.p',unknown),
[] ).
cnf(43,axiom,
( ~ aIdeal0(u)
| ~ aElement0(v)
| ~ aElementOf0(w,u)
| aElementOf0(sdtasdt0(v,w),u) ),
file('RNG089+1.p',unknown),
[] ).
cnf(195,plain,
( ~ aIdeal0(xJ)
| ~ aElement0(xz)
| ~ aElementOf0(xl,xJ)
| ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
inference(res,[status(thm),theory(equality)],[43,38]),
[iquote('0:Res:43.3,38.0')] ).
cnf(199,plain,
( ~ aElementOf0(xl,xJ)
| ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
inference(ssi,[status(thm)],[195,5,4]),
[iquote('0:SSi:195.1,195.0,5.0,4.0')] ).
cnf(200,plain,
~ aElementOf0(sdtasdt0(xz,xk),xI),
inference(mrr,[status(thm)],[199,8]),
[iquote('0:MRR:199.0,8.0')] ).
cnf(206,plain,
( ~ aIdeal0(xI)
| ~ aElement0(xz)
| ~ aElementOf0(xk,xI) ),
inference(res,[status(thm),theory(equality)],[43,200]),
[iquote('0:Res:43.3,200.0')] ).
cnf(207,plain,
~ aElementOf0(xk,xI),
inference(ssi,[status(thm)],[206,5,3]),
[iquote('0:SSi:206.1,206.0,5.0,3.0')] ).
cnf(208,plain,
$false,
inference(mrr,[status(thm)],[207,7]),
[iquote('0:MRR:207.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : RNG089+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n028.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 18:12:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.51
% 0.18/0.51 SPASS V 3.9
% 0.18/0.51 SPASS beiseite: Proof found.
% 0.18/0.51 % SZS status Theorem
% 0.18/0.51 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.51 SPASS derived 96 clauses, backtracked 0 clauses, performed 0 splits and kept 90 clauses.
% 0.18/0.51 SPASS allocated 98835 KBytes.
% 0.18/0.51 SPASS spent 0:00:00.16 on the problem.
% 0.18/0.51 0:00:00.03 for the input.
% 0.18/0.51 0:00:00.10 for the FLOTTER CNF translation.
% 0.18/0.51 0:00:00.00 for inferences.
% 0.18/0.51 0:00:00.00 for the backtracking.
% 0.18/0.51 0:00:00.01 for the reduction.
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 Here is a proof with depth 2, length 13 :
% 0.18/0.51 % SZS output start Refutation
% See solution above
% 0.18/0.51 Formulae used in the proof : m__870 m__901 m__934 m__ mDefIdeal
% 0.18/0.51
%------------------------------------------------------------------------------