TSTP Solution File: RNG089+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG089+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:26 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 6 unt; 0 nHn; 12 RR)
% Number of literals : 21 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
aElement0(xz),
file('RNG089+2.p',unknown),
[] ).
cnf(13,axiom,
aElementOf0(xk,xI),
file('RNG089+2.p',unknown),
[] ).
cnf(14,axiom,
aElementOf0(xl,xJ),
file('RNG089+2.p',unknown),
[] ).
cnf(46,axiom,
( ~ aElementOf0(sdtasdt0(xz,xl),xJ)
| ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
file('RNG089+2.p',unknown),
[] ).
cnf(47,axiom,
( ~ aElement0(u)
| ~ aElementOf0(v,xI)
| aElementOf0(sdtasdt0(u,v),xI) ),
file('RNG089+2.p',unknown),
[] ).
cnf(48,axiom,
( ~ aElement0(u)
| ~ aElementOf0(v,xJ)
| aElementOf0(sdtasdt0(u,v),xJ) ),
file('RNG089+2.p',unknown),
[] ).
cnf(163,plain,
( ~ aElement0(xz)
| ~ aElementOf0(xl,xJ)
| ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
inference(res,[status(thm),theory(equality)],[48,46]),
[iquote('0:Res:48.2,46.0')] ).
cnf(167,plain,
( ~ aElementOf0(xl,xJ)
| ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
inference(ssi,[status(thm)],[163,7]),
[iquote('0:SSi:163.0,7.0')] ).
cnf(168,plain,
~ aElementOf0(sdtasdt0(xz,xk),xI),
inference(mrr,[status(thm)],[167,14]),
[iquote('0:MRR:167.0,14.0')] ).
cnf(187,plain,
( ~ aElement0(xz)
| ~ aElementOf0(xk,xI) ),
inference(res,[status(thm),theory(equality)],[47,168]),
[iquote('0:Res:47.2,168.0')] ).
cnf(189,plain,
~ aElementOf0(xk,xI),
inference(ssi,[status(thm)],[187,7]),
[iquote('0:SSi:187.0,7.0')] ).
cnf(190,plain,
$false,
inference(mrr,[status(thm)],[189,13]),
[iquote('0:MRR:189.0,13.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG089+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % 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 10:09:54 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.52
% 0.20/0.52 SPASS V 3.9
% 0.20/0.52 SPASS beiseite: Proof found.
% 0.20/0.52 % SZS status Theorem
% 0.20/0.52 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.52 SPASS derived 85 clauses, backtracked 0 clauses, performed 0 splits and kept 109 clauses.
% 0.20/0.52 SPASS allocated 98763 KBytes.
% 0.20/0.52 SPASS spent 0:00:00.16 on the problem.
% 0.20/0.52 0:00:00.04 for the input.
% 0.20/0.52 0:00:00.09 for the FLOTTER CNF translation.
% 0.20/0.52 0:00:00.00 for inferences.
% 0.20/0.52 0:00:00.00 for the backtracking.
% 0.20/0.52 0:00:00.01 for the reduction.
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 Here is a proof with depth 2, length 12 :
% 0.20/0.52 % SZS output start Refutation
% See solution above
% 0.20/0.52 Formulae used in the proof : m__901 m__934 m__ m__870
% 0.20/0.52
%------------------------------------------------------------------------------