TSTP Solution File: RNG088+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG088+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 6 unt; 0 nHn; 11 RR)
% Number of literals : 19 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 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(13,axiom,
aElementOf0(xk,xI),
file('RNG088+2.p',unknown),
[] ).
cnf(14,axiom,
aElementOf0(xl,xJ),
file('RNG088+2.p',unknown),
[] ).
cnf(15,axiom,
aElementOf0(xm,xI),
file('RNG088+2.p',unknown),
[] ).
cnf(16,axiom,
aElementOf0(xn,xJ),
file('RNG088+2.p',unknown),
[] ).
cnf(44,axiom,
( ~ aElementOf0(sdtpldt0(xl,xn),xJ)
| ~ aElementOf0(sdtpldt0(xk,xm),xI) ),
file('RNG088+2.p',unknown),
[] ).
cnf(49,axiom,
( ~ aElementOf0(u,xI)
| ~ aElementOf0(v,xI)
| aElementOf0(sdtpldt0(u,v),xI) ),
file('RNG088+2.p',unknown),
[] ).
cnf(50,axiom,
( ~ aElementOf0(u,xJ)
| ~ aElementOf0(v,xJ)
| aElementOf0(sdtpldt0(u,v),xJ) ),
file('RNG088+2.p',unknown),
[] ).
cnf(201,plain,
( ~ aElementOf0(xl,xJ)
| ~ aElementOf0(xn,xJ)
| ~ aElementOf0(sdtpldt0(xk,xm),xI) ),
inference(res,[status(thm),theory(equality)],[50,44]),
[iquote('0:Res:50.2,44.0')] ).
cnf(207,plain,
~ aElementOf0(sdtpldt0(xk,xm),xI),
inference(mrr,[status(thm)],[201,14,16]),
[iquote('0:MRR:201.0,201.1,14.0,16.0')] ).
cnf(217,plain,
( ~ aElementOf0(xk,xI)
| ~ aElementOf0(xm,xI) ),
inference(res,[status(thm),theory(equality)],[49,207]),
[iquote('0:Res:49.2,207.0')] ).
cnf(219,plain,
$false,
inference(mrr,[status(thm)],[217,13,15]),
[iquote('0:MRR:217.0,217.1,13.0,15.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG088+2 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n026.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 08:27:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.51
% 0.20/0.51 SPASS V 3.9
% 0.20/0.51 SPASS beiseite: Proof found.
% 0.20/0.51 % SZS status Theorem
% 0.20/0.51 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.51 SPASS derived 109 clauses, backtracked 0 clauses, performed 0 splits and kept 116 clauses.
% 0.20/0.51 SPASS allocated 98763 KBytes.
% 0.20/0.51 SPASS spent 0:00:00.16 on the problem.
% 0.20/0.51 0:00:00.03 for the input.
% 0.20/0.51 0:00:00.10 for the FLOTTER CNF translation.
% 0.20/0.51 0:00:00.00 for inferences.
% 0.20/0.51 0:00:00.00 for the backtracking.
% 0.20/0.51 0:00:00.01 for the reduction.
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 Here is a proof with depth 2, length 11 :
% 0.20/0.51 % SZS output start Refutation
% See solution above
% 0.20/0.51 Formulae used in the proof : m__934 m__967 m__ m__870
% 0.20/0.51
%------------------------------------------------------------------------------