%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG091+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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 0.18s 0.51s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 22 ( 0 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(25,axiom,
aElementOf0(sdtpldt0(xk,xm),xI),
file('RNG091+2.p',unknown),
[] ).
cnf(26,axiom,
aElementOf0(sdtpldt0(xl,xn),xJ),
file('RNG091+2.p',unknown),
[] ).
cnf(27,axiom,
aElementOf0(sdtasdt0(xz,xk),xI),
file('RNG091+2.p',unknown),
[] ).
cnf(28,axiom,
aElementOf0(sdtasdt0(xz,xl),xJ),
file('RNG091+2.p',unknown),
[] ).
cnf(50,axiom,
equal(sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),sdtpldt0(xx,xy)),
file('RNG091+2.p',unknown),
[] ).
cnf(51,axiom,
equal(sdtpldt0(sdtasdt0(xz,xk),sdtasdt0(xz,xl)),sdtasdt0(xz,xx)),
file('RNG091+2.p',unknown),
[] ).
cnf(63,axiom,
( ~ aElementOf0(u,xI)
| ~ equal(sdtpldt0(u,v),sdtpldt0(xx,xy))
| ~ aElementOf0(v,xJ)
| skC0 ),
file('RNG091+2.p',unknown),
[] ).
cnf(66,axiom,
( ~ aElementOf0(u,xI)
| ~ equal(sdtpldt0(u,v),sdtasdt0(xz,xx))
| ~ aElementOf0(v,xJ)
| ~ skC0 ),
file('RNG091+2.p',unknown),
[] ).
cnf(90,plain,
( ~ aElementOf0(sdtpldt0(xk,xm),xI)
| ~ aElementOf0(sdtpldt0(xl,xn),xJ)
| skC0 ),
inference(res,[status(thm),theory(equality)],[50,63]),
[iquote('0:Res:50.0,63.1')] ).
cnf(103,plain,
( ~ aElementOf0(sdtasdt0(xz,xk),xI)
| ~ aElementOf0(sdtasdt0(xz,xl),xJ)
| ~ skC0 ),
inference(res,[status(thm),theory(equality)],[51,66]),
[iquote('0:Res:51.0,66.1')] ).
cnf(110,plain,
skC0,
inference(mrr,[status(thm)],[90,25,26]),
[iquote('0:MRR:90.0,90.1,25.0,26.0')] ).
cnf(117,plain,
$false,
inference(mrr,[status(thm)],[103,27,28,110]),
[iquote('0:MRR:103.0,103.1,103.2,27.0,28.0,110.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG091+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n027.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 06:10:31 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 20 clauses, backtracked 0 clauses, performed 0 splits and kept 94 clauses.
% 0.18/0.51 SPASS allocated 98788 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.00 for the reduction.
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 Here is a proof with depth 1, length 12 :
% 0.18/0.51 % SZS output start Refutation
% See solution above
% 0.18/0.51 Formulae used in the proof : m__994 m__1021 m__1061 m__1098 m__
% 0.18/0.51
%------------------------------------------------------------------------------