TSTP Solution File: RNG060+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG060+2 : 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:21 EDT 2022
% Result : Theorem 0.63s 0.82s
% Output : Refutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 13 ( 6 unt; 0 nHn; 13 RR)
% Number of literals : 29 ( 0 equ; 21 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(15,axiom,
aScalar0(xR),
file('RNG060+2.p',unknown),
[] ).
cnf(17,axiom,
aScalar0(xS),
file('RNG060+2.p',unknown),
[] ).
cnf(37,axiom,
( ~ aScalar0(u)
| aScalar0(smndt0(u)) ),
file('RNG060+2.p',unknown),
[] ).
cnf(47,axiom,
equal(sdtasdt0(xR,smndt0(xS)),smndt0(xN)),
file('RNG060+2.p',unknown),
[] ).
cnf(59,axiom,
equal(sdtasdt0(smndt0(xS),smndt0(xS)),sdtasdt0(xS,xS)),
file('RNG060+2.p',unknown),
[] ).
cnf(68,axiom,
( ~ aScalar0(u)
| ~ aScalar0(v)
| equal(sdtasdt0(v,u),sdtasdt0(u,v)) ),
file('RNG060+2.p',unknown),
[] ).
cnf(87,axiom,
~ equal(sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))),
file('RNG060+2.p',unknown),
[] ).
cnf(94,axiom,
( ~ aScalar0(u)
| ~ aScalar0(v)
| ~ aScalar0(w)
| ~ aScalar0(x)
| equal(sdtasdt0(sdtpldt0(x,w),sdtpldt0(v,u)),sdtpldt0(sdtpldt0(sdtasdt0(x,v),sdtasdt0(x,u)),sdtpldt0(sdtasdt0(w,v),sdtasdt0(w,u)))) ),
file('RNG060+2.p',unknown),
[] ).
cnf(2136,plain,
( ~ aScalar0(smndt0(xS))
| ~ aScalar0(xR)
| ~ aScalar0(smndt0(xS))
| ~ aScalar0(xR)
| ~ equal(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xR,smndt0(xS))),sdtpldt0(sdtasdt0(smndt0(xS),xR),sdtasdt0(smndt0(xS),smndt0(xS)))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))) ),
inference(spl,[status(thm),theory(equality)],[94,87]),
[iquote('0:SpL:94.4,87.0')] ).
cnf(2182,plain,
( ~ aScalar0(smndt0(xS))
| ~ aScalar0(xR)
| ~ equal(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xR,smndt0(xS))),sdtpldt0(sdtasdt0(smndt0(xS),xR),sdtasdt0(smndt0(xS),smndt0(xS)))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))) ),
inference(obv,[status(thm),theory(equality)],[2136]),
[iquote('0:Obv:2136.1')] ).
cnf(2183,plain,
( ~ aScalar0(smndt0(xS))
| ~ aScalar0(xR)
| ~ equal(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS))),sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))) ),
inference(rew,[status(thm),theory(equality)],[47,2182,68,59]),
[iquote('0:Rew:47.0,2182.2,68.2,2182.2,59.0,2182.2')] ).
cnf(2184,plain,
( ~ aScalar0(smndt0(xS))
| ~ aScalar0(xR) ),
inference(obv,[status(thm),theory(equality)],[2183]),
[iquote('0:Obv:2183.2')] ).
cnf(2185,plain,
$false,
inference(ssi,[status(thm)],[2184,15,37,17]),
[iquote('0:SSi:2184.1,2184.0,15.0,37.1,17.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG060+2 : 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 05:55:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.63/0.82
% 0.63/0.82 SPASS V 3.9
% 0.63/0.82 SPASS beiseite: Proof found.
% 0.63/0.82 % SZS status Theorem
% 0.63/0.82 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.63/0.82 SPASS derived 1139 clauses, backtracked 0 clauses, performed 0 splits and kept 580 clauses.
% 0.63/0.82 SPASS allocated 100321 KBytes.
% 0.63/0.82 SPASS spent 0:00:00.44 on the problem.
% 0.63/0.82 0:00:00.03 for the input.
% 0.63/0.82 0:00:00.04 for the FLOTTER CNF translation.
% 0.63/0.82 0:00:00.02 for inferences.
% 0.63/0.82 0:00:00.00 for the backtracking.
% 0.63/0.82 0:00:00.32 for the reduction.
% 0.63/0.82
% 0.63/0.82
% 0.63/0.82 Here is a proof with depth 1, length 13 :
% 0.63/0.82 % SZS output start Refutation
% See solution above
% 0.63/0.82 Formulae used in the proof : m__1892 m__1930 mNegSc m__2144 mArith m__ mDistr2
% 0.63/0.82
%------------------------------------------------------------------------------