TSTP Solution File: NUM432+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM432+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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:08 EDT 2022
% Result : Theorem 0.21s 0.53s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 24 ( 12 unt; 4 nHn; 24 RR)
% Number of literals : 58 ( 0 equ; 33 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 : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
aInteger0(xa),
file('NUM432+1.p',unknown),
[] ).
cnf(5,axiom,
aInteger0(xq),
file('NUM432+1.p',unknown),
[] ).
cnf(6,axiom,
aInteger0(xc),
file('NUM432+1.p',unknown),
[] ).
cnf(7,axiom,
aInteger0(xn),
file('NUM432+1.p',unknown),
[] ).
cnf(8,axiom,
aInteger0(xm),
file('NUM432+1.p',unknown),
[] ).
cnf(10,axiom,
~ equal(xq,sz00),
file('NUM432+1.p',unknown),
[] ).
cnf(13,axiom,
~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
file('NUM432+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| aInteger0(sdtpldt0(v,u)) ),
file('NUM432+1.p',unknown),
[] ).
cnf(27,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| aInteger0(sdtasdt0(v,u)) ),
file('NUM432+1.p',unknown),
[] ).
cnf(30,axiom,
equal(sdtasdt0(xq,sdtpldt0(xn,xm)),sdtpldt0(xa,smndt0(xc))),
file('NUM432+1.p',unknown),
[] ).
cnf(40,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| ~ aInteger0(w)
| ~ equal(sdtasdt0(w,v),u)
| aDivisorOf0(w,u)
| equal(w,sz00) ),
file('NUM432+1.p',unknown),
[] ).
cnf(43,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| ~ aInteger0(w)
| ~ aDivisorOf0(u,sdtpldt0(w,smndt0(v)))
| equal(u,sz00)
| sdteqdtlpzmzozddtrp0(w,v,u) ),
file('NUM432+1.p',unknown),
[] ).
cnf(45,plain,
( ~ aInteger0(xa)
| ~ aInteger0(xc)
| ~ aInteger0(xq)
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| equal(xq,sz00) ),
inference(res,[status(thm),theory(equality)],[43,13]),
[iquote('0:Res:43.4,13.0')] ).
cnf(48,plain,
~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc))),
inference(mrr,[status(thm)],[45,3,6,5,10]),
[iquote('0:MRR:45.0,45.1,45.2,45.4,3.0,6.0,5.0,10.0')] ).
cnf(81,plain,
( ~ aInteger0(sdtpldt0(xn,xm))
| ~ aInteger0(xq)
| aInteger0(sdtpldt0(xa,smndt0(xc))) ),
inference(spr,[status(thm),theory(equality)],[30,27]),
[iquote('0:SpR:30.0,27.2')] ).
cnf(90,plain,
( ~ aInteger0(sdtpldt0(xn,xm))
| aInteger0(sdtpldt0(xa,smndt0(xc))) ),
inference(ssi,[status(thm)],[81,5]),
[iquote('0:SSi:81.1,5.0')] ).
cnf(99,plain,
( ~ aInteger0(xn)
| ~ aInteger0(xm)
| aInteger0(sdtpldt0(xa,smndt0(xc))) ),
inference(sor,[status(thm)],[90,26]),
[iquote('0:SoR:90.0,26.2')] ).
cnf(100,plain,
aInteger0(sdtpldt0(xa,smndt0(xc))),
inference(ssi,[status(thm)],[99,8,7]),
[iquote('0:SSi:99.1,99.0,8.0,7.0')] ).
cnf(428,plain,
( ~ aInteger0(u)
| ~ aInteger0(sdtpldt0(xn,xm))
| ~ aInteger0(xq)
| ~ equal(sdtpldt0(xa,smndt0(xc)),u)
| aDivisorOf0(xq,u)
| equal(xq,sz00) ),
inference(spl,[status(thm),theory(equality)],[30,40]),
[iquote('0:SpL:30.0,40.3')] ).
cnf(454,plain,
( ~ aInteger0(u)
| ~ equal(sdtpldt0(xa,smndt0(xc)),u)
| aDivisorOf0(xq,u)
| equal(xq,sz00) ),
inference(ssi,[status(thm)],[428,5,26,7,8]),
[iquote('0:SSi:428.2,428.1,5.0,26.0,7.2,8.0')] ).
cnf(455,plain,
( ~ aInteger0(u)
| ~ equal(sdtpldt0(xa,smndt0(xc)),u)
| aDivisorOf0(xq,u) ),
inference(mrr,[status(thm)],[454,10]),
[iquote('0:MRR:454.3,10.0')] ).
cnf(589,plain,
( ~ aInteger0(sdtpldt0(xa,smndt0(xc)))
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc))) ),
inference(eqr,[status(thm),theory(equality)],[455]),
[iquote('0:EqR:455.1')] ).
cnf(590,plain,
aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc))),
inference(ssi,[status(thm)],[589,100]),
[iquote('0:SSi:589.0,100.0')] ).
cnf(591,plain,
$false,
inference(mrr,[status(thm)],[590,48]),
[iquote('0:MRR:590.0,48.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : NUM432+1 : TPTP v8.1.0. Released v4.0.0.
% 0.14/0.15 % Command : run_spass %d %s
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jul 7 22:22:50 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.21/0.53
% 0.21/0.53 SPASS V 3.9
% 0.21/0.53 SPASS beiseite: Proof found.
% 0.21/0.53 % SZS status Theorem
% 0.21/0.53 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.53 SPASS derived 297 clauses, backtracked 0 clauses, performed 0 splits and kept 135 clauses.
% 0.21/0.53 SPASS allocated 98251 KBytes.
% 0.21/0.53 SPASS spent 0:00:00.15 on the problem.
% 0.21/0.53 0:00:00.04 for the input.
% 0.21/0.53 0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.53 0:00:00.01 for inferences.
% 0.21/0.53 0:00:00.00 for the backtracking.
% 0.21/0.53 0:00:00.05 for the reduction.
% 0.21/0.53
% 0.21/0.53
% 0.21/0.53 Here is a proof with depth 2, length 24 :
% 0.21/0.53 % SZS output start Refutation
% See solution above
% 0.21/0.53 Formulae used in the proof : m__818 m__876 m__899 m__ mIntPlus mIntMult m__924 mDivisor mEquMod
% 0.21/0.53
%------------------------------------------------------------------------------