TSTP Solution File: NUM427+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM427+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:04 EDT 2022
% Result : Theorem 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 21 ( 11 unt; 4 nHn; 21 RR)
% Number of literals : 51 ( 0 equ; 29 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; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
aInteger0(xa),
file('NUM427+1.p',unknown),
[] ).
cnf(4,axiom,
aInteger0(xb),
file('NUM427+1.p',unknown),
[] ).
cnf(5,axiom,
aInteger0(xq),
file('NUM427+1.p',unknown),
[] ).
cnf(6,axiom,
aInteger0(xn),
file('NUM427+1.p',unknown),
[] ).
cnf(8,axiom,
~ equal(xq,sz00),
file('NUM427+1.p',unknown),
[] ).
cnf(10,axiom,
~ sdteqdtlpzmzozddtrp0(xb,xa,xq),
file('NUM427+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ aInteger0(u)
| aInteger0(smndt0(u)) ),
file('NUM427+1.p',unknown),
[] ).
cnf(22,axiom,
equal(sdtasdt0(xq,smndt0(xn)),sdtpldt0(xb,smndt0(xa))),
file('NUM427+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| aInteger0(sdtasdt0(v,u)) ),
file('NUM427+1.p',unknown),
[] ).
cnf(35,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| ~ aInteger0(w)
| ~ equal(sdtasdt0(w,v),u)
| aDivisorOf0(w,u)
| equal(w,sz00) ),
file('NUM427+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| ~ aInteger0(w)
| ~ aDivisorOf0(u,sdtpldt0(w,smndt0(v)))
| equal(u,sz00)
| sdteqdtlpzmzozddtrp0(w,v,u) ),
file('NUM427+1.p',unknown),
[] ).
cnf(40,plain,
( ~ aInteger0(xb)
| ~ aInteger0(xa)
| ~ aInteger0(xq)
| ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
| equal(xq,sz00) ),
inference(res,[status(thm),theory(equality)],[38,10]),
[iquote('0:Res:38.4,10.0')] ).
cnf(41,plain,
~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa))),
inference(mrr,[status(thm)],[40,4,3,5,8]),
[iquote('0:MRR:40.0,40.1,40.2,40.4,4.0,3.0,5.0,8.0')] ).
cnf(72,plain,
( ~ aInteger0(smndt0(xn))
| ~ aInteger0(xq)
| aInteger0(sdtpldt0(xb,smndt0(xa))) ),
inference(spr,[status(thm),theory(equality)],[22,24]),
[iquote('0:SpR:22.0,24.2')] ).
cnf(80,plain,
aInteger0(sdtpldt0(xb,smndt0(xa))),
inference(ssi,[status(thm)],[72,5,11,6]),
[iquote('0:SSi:72.1,72.0,5.0,11.1,6.0')] ).
cnf(411,plain,
( ~ aInteger0(u)
| ~ aInteger0(smndt0(xn))
| ~ aInteger0(xq)
| ~ equal(sdtpldt0(xb,smndt0(xa)),u)
| aDivisorOf0(xq,u)
| equal(xq,sz00) ),
inference(spl,[status(thm),theory(equality)],[22,35]),
[iquote('0:SpL:22.0,35.3')] ).
cnf(431,plain,
( ~ aInteger0(u)
| ~ equal(sdtpldt0(xb,smndt0(xa)),u)
| aDivisorOf0(xq,u)
| equal(xq,sz00) ),
inference(ssi,[status(thm)],[411,5,11,6]),
[iquote('0:SSi:411.2,411.1,5.0,11.1,6.0')] ).
cnf(432,plain,
( ~ aInteger0(u)
| ~ equal(sdtpldt0(xb,smndt0(xa)),u)
| aDivisorOf0(xq,u) ),
inference(mrr,[status(thm)],[431,8]),
[iquote('0:MRR:431.3,8.0')] ).
cnf(863,plain,
( ~ aInteger0(sdtpldt0(xb,smndt0(xa)))
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa))) ),
inference(eqr,[status(thm),theory(equality)],[432]),
[iquote('0:EqR:432.1')] ).
cnf(865,plain,
aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa))),
inference(ssi,[status(thm)],[863,80]),
[iquote('0:SSi:863.0,80.0')] ).
cnf(866,plain,
$false,
inference(mrr,[status(thm)],[865,41]),
[iquote('0:MRR:865.0,41.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM427+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n012.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jul 6 13:28:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.53
% 0.19/0.53 SPASS V 3.9
% 0.19/0.53 SPASS beiseite: Proof found.
% 0.19/0.53 % SZS status Theorem
% 0.19/0.53 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.53 SPASS derived 458 clauses, backtracked 0 clauses, performed 1 splits and kept 194 clauses.
% 0.19/0.53 SPASS allocated 98521 KBytes.
% 0.19/0.53 SPASS spent 0:00:00.18 on the problem.
% 0.19/0.53 0:00:00.04 for the input.
% 0.19/0.53 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.53 0:00:00.01 for inferences.
% 0.19/0.53 0:00:00.00 for the backtracking.
% 0.19/0.53 0:00:00.07 for the reduction.
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 Here is a proof with depth 2, length 21 :
% 0.19/0.53 % SZS output start Refutation
% See solution above
% 0.19/0.53 Formulae used in the proof : m__704 m__747 m__ mIntNeg m__767 mIntMult mDivisor mEquMod
% 0.19/0.53
%------------------------------------------------------------------------------