TSTP Solution File: NUM480+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM480+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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 14:26:38 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 17 ( 0 equ; 7 neg)
% Maximal clause size : 4 ( 1 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(3,axiom,
aNaturalNumber0(xl),
file('NUM480+2.p',unknown),
[] ).
cnf(6,axiom,
aNaturalNumber0(xn),
file('NUM480+2.p',unknown),
[] ).
cnf(13,axiom,
aNaturalNumber0(sdtsldt0(xm,xl)),
file('NUM480+2.p',unknown),
[] ).
cnf(27,axiom,
equal(sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),sdtasdt0(xn,xm)),
file('NUM480+2.p',unknown),
[] ).
cnf(28,axiom,
~ equal(sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))),sdtasdt0(xn,xm)),
file('NUM480+2.p',unknown),
[] ).
cnf(39,axiom,
equal(sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl))),
file('NUM480+2.p',unknown),
[] ).
cnf(53,axiom,
( ~ aNaturalNumber0(u)
| ~ aNaturalNumber0(v)
| ~ aNaturalNumber0(w)
| equal(sdtasdt0(sdtasdt0(w,v),u),sdtasdt0(w,sdtasdt0(v,u))) ),
file('NUM480+2.p',unknown),
[] ).
cnf(74,plain,
equal(sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)),sdtasdt0(xn,xm)),
inference(rew,[status(thm),theory(equality)],[27,39]),
[iquote('0:Rew:27.0,39.0')] ).
cnf(1221,plain,
( ~ aNaturalNumber0(sdtsldt0(xm,xl))
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xl)
| equal(sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))),sdtasdt0(xn,xm)) ),
inference(spr,[status(thm),theory(equality)],[53,74]),
[iquote('0:SpR:53.3,74.0')] ).
cnf(1249,plain,
equal(sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))),sdtasdt0(xn,xm)),
inference(ssi,[status(thm)],[1221,3,6,13]),
[iquote('0:SSi:1221.2,1221.1,1221.0,3.0,6.0,13.0')] ).
cnf(1250,plain,
$false,
inference(mrr,[status(thm)],[1249,28]),
[iquote('0:MRR:1249.0,28.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM480+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 21:59:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.55
% 0.20/0.55 SPASS V 3.9
% 0.20/0.55 SPASS beiseite: Proof found.
% 0.20/0.55 % SZS status Theorem
% 0.20/0.55 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.55 SPASS derived 748 clauses, backtracked 98 clauses, performed 6 splits and kept 434 clauses.
% 0.20/0.55 SPASS allocated 98561 KBytes.
% 0.20/0.55 SPASS spent 0:00:00.19 on the problem.
% 0.20/0.55 0:00:00.04 for the input.
% 0.20/0.55 0:00:00.04 for the FLOTTER CNF translation.
% 0.20/0.55 0:00:00.01 for inferences.
% 0.20/0.55 0:00:00.00 for the backtracking.
% 0.20/0.55 0:00:00.08 for the reduction.
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 Here is a proof with depth 1, length 11 :
% 0.20/0.55 % SZS output start Refutation
% See solution above
% 0.20/0.55 Formulae used in the proof : m__1524 m__1553 m__1594 m__ mMulAsso
% 0.20/0.55
%------------------------------------------------------------------------------