TSTP Solution File: NUM430+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM430+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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:06 EDT 2022
% Result : Theorem 0.18s 0.52s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 18 ( 9 unt; 3 nHn; 18 RR)
% Number of literals : 37 ( 0 equ; 22 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
aInteger0(xb),
file('NUM430+1.p',unknown),
[] ).
cnf(5,axiom,
aInteger0(xq),
file('NUM430+1.p',unknown),
[] ).
cnf(6,axiom,
aInteger0(xc),
file('NUM430+1.p',unknown),
[] ).
cnf(8,axiom,
aInteger0(skf1(u,v)),
file('NUM430+1.p',unknown),
[] ).
cnf(9,axiom,
~ equal(xq,sz00),
file('NUM430+1.p',unknown),
[] ).
cnf(11,axiom,
sdteqdtlpzmzozddtrp0(xb,xc,xq),
file('NUM430+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ aInteger0(u)
| aInteger0(smndt0(u)) ),
file('NUM430+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| aInteger0(sdtpldt0(v,u)) ),
file('NUM430+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ aInteger0(u)
| ~ equal(sdtasdt0(xq,u),sdtpldt0(xb,smndt0(xc))) ),
file('NUM430+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ aInteger0(u)
| ~ aDivisorOf0(v,u)
| equal(sdtasdt0(v,skf1(u,v)),u) ),
file('NUM430+1.p',unknown),
[] ).
cnf(41,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| ~ aInteger0(w)
| ~ sdteqdtlpzmzozddtrp0(w,v,u)
| equal(u,sz00)
| aDivisorOf0(u,sdtpldt0(w,smndt0(v))) ),
file('NUM430+1.p',unknown),
[] ).
cnf(49,plain,
~ equal(sdtasdt0(xq,skf1(u,v)),sdtpldt0(xb,smndt0(xc))),
inference(res,[status(thm),theory(equality)],[8,28]),
[iquote('0:Res:8.0,28.0')] ).
cnf(191,plain,
( ~ aInteger0(u)
| ~ aDivisorOf0(xq,u)
| ~ equal(u,sdtpldt0(xb,smndt0(xc))) ),
inference(spl,[status(thm),theory(equality)],[32,49]),
[iquote('0:SpL:32.2,49.0')] ).
cnf(220,plain,
( ~ aInteger0(sdtpldt0(xb,smndt0(xc)))
| ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))) ),
inference(eqr,[status(thm),theory(equality)],[191]),
[iquote('0:EqR:191.2')] ).
cnf(221,plain,
~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))),
inference(ssi,[status(thm)],[220,23,4,12,6]),
[iquote('0:SSi:220.0,23.0,4.1,12.0,6.2')] ).
cnf(874,plain,
( ~ aInteger0(xq)
| ~ aInteger0(xc)
| ~ aInteger0(xb)
| equal(xq,sz00)
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))) ),
inference(res,[status(thm),theory(equality)],[11,41]),
[iquote('0:Res:11.0,41.3')] ).
cnf(879,plain,
( equal(xq,sz00)
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))) ),
inference(ssi,[status(thm)],[874,4,6,5]),
[iquote('0:SSi:874.2,874.1,874.0,4.0,6.0,5.0')] ).
cnf(880,plain,
$false,
inference(mrr,[status(thm)],[879,9,221]),
[iquote('0:MRR:879.0,879.1,9.0,221.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM430+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n020.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 : Thu Jul 7 16:38:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.52
% 0.18/0.52 SPASS V 3.9
% 0.18/0.52 SPASS beiseite: Proof found.
% 0.18/0.52 % SZS status Theorem
% 0.18/0.52 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.52 SPASS derived 451 clauses, backtracked 0 clauses, performed 2 splits and kept 192 clauses.
% 0.18/0.52 SPASS allocated 98588 KBytes.
% 0.18/0.52 SPASS spent 0:00:00.17 on the problem.
% 0.18/0.52 0:00:00.04 for the input.
% 0.18/0.52 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.52 0:00:00.01 for inferences.
% 0.18/0.52 0:00:00.00 for the backtracking.
% 0.18/0.52 0:00:00.07 for the reduction.
% 0.18/0.52
% 0.18/0.52
% 0.18/0.52 Here is a proof with depth 3, length 18 :
% 0.18/0.52 % SZS output start Refutation
% See solution above
% 0.18/0.52 Formulae used in the proof : m__818 mDivisor m__876 m__853 mIntNeg mIntPlus m__ mEquMod
% 0.18/0.52
%------------------------------------------------------------------------------