TSTP Solution File: RNG077+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG077+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:24 EDT 2022
% Result : Theorem 1.36s 1.54s
% Output : Refutation 1.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 8 unt; 0 nHn; 15 RR)
% Number of literals : 30 ( 0 equ; 22 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(11,axiom,
aScalar0(xE),
file('RNG077+1.p',unknown),
[] ).
cnf(14,axiom,
aScalar0(xH),
file('RNG077+1.p',unknown),
[] ).
cnf(16,axiom,
aScalar0(xP),
file('RNG077+1.p',unknown),
[] ).
cnf(32,axiom,
equal(sdtasdt0(xE,xH),xP),
file('RNG077+1.p',unknown),
[] ).
cnf(56,axiom,
( ~ aScalar0(u)
| ~ aScalar0(v)
| aScalar0(sdtasdt0(v,u)) ),
file('RNG077+1.p',unknown),
[] ).
cnf(61,axiom,
( ~ aScalar0(u)
| ~ aScalar0(v)
| equal(sdtasdt0(v,u),sdtasdt0(u,v)) ),
file('RNG077+1.p',unknown),
[] ).
cnf(74,axiom,
( ~ aScalar0(u)
| ~ aScalar0(v)
| ~ aScalar0(w)
| equal(sdtpldt0(sdtpldt0(w,v),u),sdtpldt0(w,sdtpldt0(v,u))) ),
file('RNG077+1.p',unknown),
[] ).
cnf(75,axiom,
~ equal(sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH))),
file('RNG077+1.p',unknown),
[] ).
cnf(90,plain,
~ equal(sdtpldt0(xP,sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH))),
inference(rew,[status(thm),theory(equality)],[32,75]),
[iquote('0:Rew:32.0,75.0')] ).
cnf(623,plain,
( ~ aScalar0(xH)
| ~ aScalar0(xE)
| ~ equal(sdtpldt0(xP,sdtpldt0(sdtasdt0(xE,xH),sdtasdt0(xH,xH))),sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH))) ),
inference(spl,[status(thm),theory(equality)],[61,90]),
[iquote('0:SpL:61.2,90.0')] ).
cnf(624,plain,
( ~ aScalar0(xH)
| ~ aScalar0(xE)
| ~ equal(sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)),sdtpldt0(xP,sdtpldt0(xP,sdtasdt0(xH,xH)))) ),
inference(rew,[status(thm),theory(equality)],[32,623]),
[iquote('0:Rew:32.0,623.2')] ).
cnf(625,plain,
~ equal(sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)),sdtpldt0(xP,sdtpldt0(xP,sdtasdt0(xH,xH)))),
inference(ssi,[status(thm)],[624,11,14]),
[iquote('0:SSi:624.1,624.0,11.0,14.0')] ).
cnf(5541,plain,
( ~ aScalar0(sdtasdt0(xH,xH))
| ~ aScalar0(xP)
| ~ aScalar0(xP)
| ~ equal(sdtpldt0(xP,sdtpldt0(xP,sdtasdt0(xH,xH))),sdtpldt0(xP,sdtpldt0(xP,sdtasdt0(xH,xH)))) ),
inference(spl,[status(thm),theory(equality)],[74,625]),
[iquote('0:SpL:74.3,625.0')] ).
cnf(5547,plain,
( ~ aScalar0(sdtasdt0(xH,xH))
| ~ aScalar0(xP) ),
inference(obv,[status(thm),theory(equality)],[5541]),
[iquote('0:Obv:5541.3')] ).
cnf(5548,plain,
$false,
inference(ssi,[status(thm)],[5547,16,56,14]),
[iquote('0:SSi:5547.1,5547.0,16.0,56.0,14.2,14.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG077+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.31 % Computer : n025.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon May 30 22:29:27 EDT 2022
% 0.12/0.32 % CPUTime :
% 1.36/1.54
% 1.36/1.54 SPASS V 3.9
% 1.36/1.54 SPASS beiseite: Proof found.
% 1.36/1.54 % SZS status Theorem
% 1.36/1.54 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.36/1.54 SPASS derived 3057 clauses, backtracked 0 clauses, performed 0 splits and kept 1166 clauses.
% 1.36/1.54 SPASS allocated 103752 KBytes.
% 1.36/1.54 SPASS spent 0:00:01.12 on the problem.
% 1.36/1.54 0:00:00.04 for the input.
% 1.36/1.54 0:00:00.04 for the FLOTTER CNF translation.
% 1.36/1.54 0:00:00.04 for inferences.
% 1.36/1.54 0:00:00.00 for the backtracking.
% 1.36/1.54 0:00:00.96 for the reduction.
% 1.36/1.54
% 1.36/1.54
% 1.36/1.54 Here is a proof with depth 2, length 15 :
% 1.36/1.54 % SZS output start Refutation
% See solution above
% 1.36/1.54 Formulae used in the proof : m__1820 m__1873 m__1911 mMulSc mArith m__
% 1.36/1.54
%------------------------------------------------------------------------------