TSTP Solution File: RNG046+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG046+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:19 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 16 ( 5 unt; 0 nHn; 16 RR)
% Number of literals : 37 ( 0 equ; 27 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
aScalar0(xx),
file('RNG046+1.p',unknown),
[] ).
cnf(4,axiom,
aScalar0(xy),
file('RNG046+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ aScalar0(u)
| aScalar0(smndt0(u)) ),
file('RNG046+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ aScalar0(u)
| equal(smndt0(smndt0(u)),u) ),
file('RNG046+1.p',unknown),
[] ).
cnf(18,axiom,
~ equal(sdtasdt0(smndt0(xx),smndt0(xy)),sdtasdt0(xx,xy)),
file('RNG046+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ aScalar0(u)
| ~ aScalar0(v)
| equal(sdtasdt0(v,smndt0(u)),smndt0(sdtasdt0(v,u))) ),
file('RNG046+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ aScalar0(u)
| ~ aScalar0(v)
| equal(sdtasdt0(smndt0(v),u),smndt0(sdtasdt0(v,u))) ),
file('RNG046+1.p',unknown),
[] ).
cnf(122,plain,
( ~ aScalar0(u)
| ~ aScalar0(v)
| ~ aScalar0(smndt0(u))
| equal(smndt0(sdtasdt0(smndt0(u),v)),sdtasdt0(u,v)) ),
inference(spr,[status(thm),theory(equality)],[15,26]),
[iquote('0:SpR:15.1,26.2')] ).
cnf(123,plain,
( ~ aScalar0(smndt0(xy))
| ~ aScalar0(xx)
| ~ equal(smndt0(sdtasdt0(xx,smndt0(xy))),sdtasdt0(xx,xy)) ),
inference(spl,[status(thm),theory(equality)],[26,18]),
[iquote('0:SpL:26.2,18.0')] ).
cnf(126,plain,
~ equal(smndt0(sdtasdt0(xx,smndt0(xy))),sdtasdt0(xx,xy)),
inference(ssi,[status(thm)],[123,3,7,4]),
[iquote('0:SSi:123.1,123.0,3.0,7.1,4.0')] ).
cnf(129,plain,
( ~ aScalar0(u)
| ~ aScalar0(v)
| ~ aScalar0(smndt0(u))
| equal(smndt0(smndt0(sdtasdt0(u,v))),sdtasdt0(u,v)) ),
inference(rew,[status(thm),theory(equality)],[26,122]),
[iquote('0:Rew:26.2,122.3')] ).
cnf(130,plain,
( ~ aScalar0(u)
| ~ aScalar0(v)
| equal(smndt0(smndt0(sdtasdt0(u,v))),sdtasdt0(u,v)) ),
inference(ssi,[status(thm)],[129,7]),
[iquote('0:SSi:129.2,7.1')] ).
cnf(159,plain,
( ~ aScalar0(xy)
| ~ aScalar0(xx)
| ~ equal(smndt0(smndt0(sdtasdt0(xx,xy))),sdtasdt0(xx,xy)) ),
inference(spl,[status(thm),theory(equality)],[25,126]),
[iquote('0:SpL:25.2,126.0')] ).
cnf(162,plain,
( ~ aScalar0(xy)
| ~ aScalar0(xx)
| ~ equal(sdtasdt0(xx,xy),sdtasdt0(xx,xy)) ),
inference(rew,[status(thm),theory(equality)],[130,159]),
[iquote('0:Rew:130.2,159.2')] ).
cnf(163,plain,
( ~ aScalar0(xy)
| ~ aScalar0(xx) ),
inference(obv,[status(thm),theory(equality)],[162]),
[iquote('0:Obv:162.2')] ).
cnf(164,plain,
$false,
inference(ssi,[status(thm)],[163,3,4]),
[iquote('0:SSi:163.1,163.0,3.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG046+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n022.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 18:18:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 80 clauses, backtracked 0 clauses, performed 0 splits and kept 39 clauses.
% 0.19/0.44 SPASS allocated 104008 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.44 0:00:00.03 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.01 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 2, length 16 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : m__799 mNegSc mScZero m__ mMNeg
% 0.19/0.44
%------------------------------------------------------------------------------