TSTP Solution File: NUM523+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM523+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:27:05 EDT 2022
% Result : Theorem 0.69s 0.90s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 18 ( 9 unt; 2 nHn; 18 RR)
% Number of literals : 46 ( 0 equ; 28 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
aNaturalNumber0(xn),
file('NUM523+1.p',unknown),
[] ).
cnf(4,axiom,
aNaturalNumber0(xm),
file('NUM523+1.p',unknown),
[] ).
cnf(5,axiom,
aNaturalNumber0(xp),
file('NUM523+1.p',unknown),
[] ).
cnf(6,axiom,
isPrime0(xp),
file('NUM523+1.p',unknown),
[] ).
cnf(22,axiom,
equal(sdtasdt0(xp,sdtasdt0(xm,xm)),sdtasdt0(xn,xn)),
file('NUM523+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ doDivides0(xp,xn)
| ~ doDivides0(xp,sdtasdt0(xn,xn)) ),
file('NUM523+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ aNaturalNumber0(u)
| ~ aNaturalNumber0(v)
| aNaturalNumber0(sdtasdt0(v,u)) ),
file('NUM523+1.p',unknown),
[] ).
cnf(50,axiom,
( ~ aNaturalNumber0(u)
| ~ aNaturalNumber0(v)
| ~ aNaturalNumber0(w)
| ~ equal(u,sdtasdt0(v,w))
| doDivides0(v,u) ),
file('NUM523+1.p',unknown),
[] ).
cnf(68,axiom,
( ~ isPrime0(u)
| ~ aNaturalNumber0(u)
| ~ aNaturalNumber0(v)
| ~ aNaturalNumber0(w)
| ~ doDivides0(u,sdtasdt0(w,v))
| doDivides0(u,v)
| doDivides0(u,w) ),
file('NUM523+1.p',unknown),
[] ).
cnf(457,plain,
( ~ aNaturalNumber0(sdtasdt0(u,v))
| ~ aNaturalNumber0(u)
| ~ aNaturalNumber0(v)
| doDivides0(u,sdtasdt0(u,v)) ),
inference(eqr,[status(thm),theory(equality)],[50]),
[iquote('0:EqR:50.3')] ).
cnf(466,plain,
( ~ aNaturalNumber0(u)
| ~ aNaturalNumber0(v)
| doDivides0(u,sdtasdt0(u,v)) ),
inference(ssi,[status(thm)],[457,25]),
[iquote('0:SSi:457.0,25.2')] ).
cnf(530,plain,
( ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sdtasdt0(xm,xm))
| doDivides0(xp,sdtasdt0(xn,xn)) ),
inference(spr,[status(thm),theory(equality)],[22,466]),
[iquote('0:SpR:22.0,466.2')] ).
cnf(544,plain,
doDivides0(xp,sdtasdt0(xn,xn)),
inference(ssi,[status(thm)],[530,25,4,6,5]),
[iquote('0:SSi:530.1,530.0,25.0,4.0,4.0,6.0,5.2')] ).
cnf(545,plain,
~ doDivides0(xp,xn),
inference(mrr,[status(thm)],[23,544]),
[iquote('0:MRR:23.1,544.0')] ).
cnf(2309,plain,
( ~ isPrime0(xp)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xn)
| doDivides0(xp,xn)
| doDivides0(xp,xn) ),
inference(res,[status(thm),theory(equality)],[544,68]),
[iquote('0:Res:544.0,68.4')] ).
cnf(2312,plain,
( ~ isPrime0(xp)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| doDivides0(xp,xn) ),
inference(obv,[status(thm),theory(equality)],[2309]),
[iquote('0:Obv:2309.4')] ).
cnf(2313,plain,
doDivides0(xp,xn),
inference(ssi,[status(thm)],[2312,3,6,5]),
[iquote('0:SSi:2312.2,2312.1,2312.0,3.0,6.0,5.0,6.0,5.0')] ).
cnf(2314,plain,
$false,
inference(mrr,[status(thm)],[2313,545]),
[iquote('0:MRR:2313.0,545.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM523+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n013.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 : Wed Jul 6 15:03:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.69/0.90
% 0.69/0.90 SPASS V 3.9
% 0.69/0.90 SPASS beiseite: Proof found.
% 0.69/0.90 % SZS status Theorem
% 0.69/0.90 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.69/0.90 SPASS derived 1251 clauses, backtracked 0 clauses, performed 1 splits and kept 585 clauses.
% 0.69/0.90 SPASS allocated 99926 KBytes.
% 0.69/0.90 SPASS spent 0:00:00.51 on the problem.
% 0.69/0.90 0:00:00.04 for the input.
% 0.69/0.90 0:00:00.04 for the FLOTTER CNF translation.
% 0.69/0.90 0:00:00.02 for inferences.
% 0.69/0.90 0:00:00.00 for the backtracking.
% 0.69/0.90 0:00:00.39 for the reduction.
% 0.69/0.90
% 0.69/0.90
% 0.69/0.90 Here is a proof with depth 3, length 18 :
% 0.69/0.90 % SZS output start Refutation
% See solution above
% 0.69/0.90 Formulae used in the proof : m__2987 m__3025 m__3014 m__ mSortsB_02 mDefDiv mPDP
% 0.69/0.90
%------------------------------------------------------------------------------