%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG070+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:23 EDT 2022
% Result : Theorem 0.21s 0.47s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 12 ( 6 unt; 1 nHn; 12 RR)
% Number of literals : 23 ( 0 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(15,axiom,
aScalar0(xR),
file('RNG070+1.p',unknown),
[] ).
cnf(16,axiom,
aScalar0(xP),
file('RNG070+1.p',unknown),
[] ).
cnf(17,axiom,
aScalar0(xS),
file('RNG070+1.p',unknown),
[] ).
cnf(45,axiom,
~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
file('RNG070+1.p',unknown),
[] ).
cnf(54,axiom,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
file('RNG070+1.p',unknown),
[] ).
cnf(57,axiom,
( ~ aScalar0(u)
| ~ aScalar0(v)
| aScalar0(sdtpldt0(v,u)) ),
file('RNG070+1.p',unknown),
[] ).
cnf(61,axiom,
( ~ aScalar0(u)
| ~ aScalar0(v)
| sdtlseqdt0(u,v)
| sdtlseqdt0(v,u) ),
file('RNG070+1.p',unknown),
[] ).
cnf(92,plain,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP))
| sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)) ),
inference(res,[status(thm),theory(equality)],[61,45]),
[iquote('0:Res:61.2,45.0')] ).
cnf(96,plain,
( ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(mrr,[status(thm)],[92,54]),
[iquote('0:MRR:92.2,54.0')] ).
cnf(175,plain,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(xP)
| ~ aScalar0(xP) ),
inference(sor,[status(thm)],[96,57]),
[iquote('0:SoR:96.0,57.2')] ).
cnf(181,plain,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(xP) ),
inference(obv,[status(thm),theory(equality)],[175]),
[iquote('0:Obv:175.1')] ).
cnf(182,plain,
$false,
inference(ssi,[status(thm)],[181,16,57,15,17]),
[iquote('0:SSi:181.1,181.0,16.0,57.0,15.2,17.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG070+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n022.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 12:06:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.47
% 0.21/0.47 SPASS V 3.9
% 0.21/0.47 SPASS beiseite: Proof found.
% 0.21/0.47 % SZS status Theorem
% 0.21/0.47 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 SPASS derived 77 clauses, backtracked 0 clauses, performed 0 splits and kept 100 clauses.
% 0.21/0.47 SPASS allocated 97873 KBytes.
% 0.21/0.47 SPASS spent 0:00:00.11 on the problem.
% 0.21/0.47 0:00:00.04 for the input.
% 0.21/0.47 0:00:00.04 for the FLOTTER CNF translation.
% 0.21/0.47 0:00:00.00 for inferences.
% 0.21/0.47 0:00:00.00 for the backtracking.
% 0.21/0.47 0:00:00.01 for the reduction.
% 0.21/0.47
% 0.21/0.47
% 0.21/0.47 Here is a proof with depth 2, length 12 :
% 0.21/0.47 % SZS output start Refutation
% See solution above
% 0.21/0.47 Formulae used in the proof : m__1892 m__1911 m__1930 m__ m__2590 mSumSc mLETot
% 0.21/0.47
%------------------------------------------------------------------------------