TSTP Solution File: NUM429+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM429+1 : 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:06 EDT 2022
% Result : Theorem 0.35s 0.52s
% Output : Refutation 0.35s
% 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(3,axiom,
aInteger0(xa),
file('NUM429+1.p',unknown),
[] ).
cnf(4,axiom,
aInteger0(xb),
file('NUM429+1.p',unknown),
[] ).
cnf(5,axiom,
aInteger0(xq),
file('NUM429+1.p',unknown),
[] ).
cnf(7,axiom,
aInteger0(skf1(u,v)),
file('NUM429+1.p',unknown),
[] ).
cnf(8,axiom,
~ equal(xq,sz00),
file('NUM429+1.p',unknown),
[] ).
cnf(9,axiom,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
file('NUM429+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ aInteger0(u)
| aInteger0(smndt0(u)) ),
file('NUM429+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| aInteger0(sdtpldt0(v,u)) ),
file('NUM429+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ aInteger0(u)
| ~ equal(sdtasdt0(xq,u),sdtpldt0(xa,smndt0(xb))) ),
file('NUM429+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ aInteger0(u)
| ~ aDivisorOf0(v,u)
| equal(sdtasdt0(v,skf1(u,v)),u) ),
file('NUM429+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| ~ aInteger0(w)
| ~ sdteqdtlpzmzozddtrp0(w,v,u)
| equal(u,sz00)
| aDivisorOf0(u,sdtpldt0(w,smndt0(v))) ),
file('NUM429+1.p',unknown),
[] ).
cnf(46,plain,
~ equal(sdtasdt0(xq,skf1(u,v)),sdtpldt0(xa,smndt0(xb))),
inference(res,[status(thm),theory(equality)],[7,26]),
[iquote('0:Res:7.0,26.0')] ).
cnf(183,plain,
( ~ aInteger0(u)
| ~ aDivisorOf0(xq,u)
| ~ equal(u,sdtpldt0(xa,smndt0(xb))) ),
inference(spl,[status(thm),theory(equality)],[30,46]),
[iquote('0:SpL:30.2,46.0')] ).
cnf(209,plain,
( ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
inference(eqr,[status(thm),theory(equality)],[183]),
[iquote('0:EqR:183.2')] ).
cnf(210,plain,
~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))),
inference(ssi,[status(thm)],[209,21,3,11,4]),
[iquote('0:SSi:209.0,21.0,3.1,11.0,4.2')] ).
cnf(863,plain,
( ~ aInteger0(xq)
| ~ aInteger0(xb)
| ~ aInteger0(xa)
| equal(xq,sz00)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
inference(res,[status(thm),theory(equality)],[9,39]),
[iquote('0:Res:9.0,39.3')] ).
cnf(870,plain,
( equal(xq,sz00)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
inference(ssi,[status(thm)],[863,3,4,5]),
[iquote('0:SSi:863.2,863.1,863.0,3.0,4.0,5.0')] ).
cnf(871,plain,
$false,
inference(mrr,[status(thm)],[870,8,210]),
[iquote('0:MRR:870.0,870.1,8.0,210.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM429+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/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 : Wed Jul 6 00:19:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.35/0.52
% 0.35/0.52 SPASS V 3.9
% 0.35/0.52 SPASS beiseite: Proof found.
% 0.35/0.52 % SZS status Theorem
% 0.35/0.52 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.52 SPASS derived 418 clauses, backtracked 0 clauses, performed 1 splits and kept 187 clauses.
% 0.35/0.52 SPASS allocated 98577 KBytes.
% 0.35/0.52 SPASS spent 0:00:00.17 on the problem.
% 0.35/0.52 0:00:00.03 for the input.
% 0.35/0.52 0:00:00.03 for the FLOTTER CNF translation.
% 0.35/0.52 0:00:00.01 for inferences.
% 0.35/0.52 0:00:00.00 for the backtracking.
% 0.35/0.52 0:00:00.07 for the reduction.
% 0.35/0.52
% 0.35/0.52
% 0.35/0.52 Here is a proof with depth 3, length 18 :
% 0.35/0.52 % SZS output start Refutation
% See solution above
% 0.35/0.52 Formulae used in the proof : m__818 mDivisor m__853 mIntNeg mIntPlus m__ mEquMod
% 0.35/0.52
%------------------------------------------------------------------------------