TSTP Solution File: RNG070+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG070+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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.19s 0.45s
% Output : Refutation 0.19s
% 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+2.p',unknown),
[] ).
cnf(16,axiom,
aScalar0(xP),
file('RNG070+2.p',unknown),
[] ).
cnf(17,axiom,
aScalar0(xS),
file('RNG070+2.p',unknown),
[] ).
cnf(47,axiom,
~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
file('RNG070+2.p',unknown),
[] ).
cnf(56,axiom,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
file('RNG070+2.p',unknown),
[] ).
cnf(59,axiom,
( ~ aScalar0(u)
| ~ aScalar0(v)
| aScalar0(sdtpldt0(v,u)) ),
file('RNG070+2.p',unknown),
[] ).
cnf(65,axiom,
( ~ aScalar0(u)
| ~ aScalar0(v)
| sdtlseqdt0(u,v)
| sdtlseqdt0(v,u) ),
file('RNG070+2.p',unknown),
[] ).
cnf(97,plain,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP))
| sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)) ),
inference(res,[status(thm),theory(equality)],[65,47]),
[iquote('0:Res:65.2,47.0')] ).
cnf(101,plain,
( ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(mrr,[status(thm)],[97,56]),
[iquote('0:MRR:97.2,56.0')] ).
cnf(200,plain,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(xP)
| ~ aScalar0(xP) ),
inference(sor,[status(thm)],[101,59]),
[iquote('0:SoR:101.0,59.2')] ).
cnf(206,plain,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(xP) ),
inference(obv,[status(thm),theory(equality)],[200]),
[iquote('0:Obv:200.1')] ).
cnf(207,plain,
$false,
inference(ssi,[status(thm)],[206,16,59,15,17]),
[iquote('0:SSi:206.1,206.0,16.0,59.0,15.2,17.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG070+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n018.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 08:29:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45
% 0.19/0.45 SPASS V 3.9
% 0.19/0.45 SPASS beiseite: Proof found.
% 0.19/0.45 % SZS status Theorem
% 0.19/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 SPASS derived 91 clauses, backtracked 0 clauses, performed 0 splits and kept 110 clauses.
% 0.19/0.45 SPASS allocated 97883 KBytes.
% 0.19/0.45 SPASS spent 0:00:00.11 on the problem.
% 0.19/0.45 0:00:00.03 for the input.
% 0.19/0.45 0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.45 0:00:00.00 for inferences.
% 0.19/0.45 0:00:00.00 for the backtracking.
% 0.19/0.45 0:00:00.01 for the reduction.
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Here is a proof with depth 2, length 12 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.45 Formulae used in the proof : m__1892 m__1911 m__1930 m__ m__2590 mSumSc mLETot
% 0.19/0.45
%------------------------------------------------------------------------------