%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM436+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:10 EDT 2022
% Result : Theorem 0.19s 0.56s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 33 ( 15 unt; 10 nHn; 33 RR)
% Number of literals : 81 ( 0 equ; 42 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('NUM436+1.p',unknown),
[] ).
cnf(4,axiom,
aInteger0(xb),
file('NUM436+1.p',unknown),
[] ).
cnf(5,axiom,
aInteger0(xp),
file('NUM436+1.p',unknown),
[] ).
cnf(6,axiom,
aInteger0(xq),
file('NUM436+1.p',unknown),
[] ).
cnf(7,axiom,
aInteger0(xm),
file('NUM436+1.p',unknown),
[] ).
cnf(9,axiom,
~ equal(xp,sz00),
file('NUM436+1.p',unknown),
[] ).
cnf(10,axiom,
~ equal(xq,sz00),
file('NUM436+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ aInteger0(u)
| aInteger0(smndt0(u)) ),
file('NUM436+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) ),
file('NUM436+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| aInteger0(sdtpldt0(v,u)) ),
file('NUM436+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| aInteger0(sdtasdt0(v,u)) ),
file('NUM436+1.p',unknown),
[] ).
cnf(28,axiom,
equal(sdtasdt0(xp,sdtasdt0(xq,xm)),sdtpldt0(xa,smndt0(xb))),
file('NUM436+1.p',unknown),
[] ).
cnf(29,axiom,
equal(sdtasdt0(xq,sdtasdt0(xp,xm)),sdtpldt0(xa,smndt0(xb))),
file('NUM436+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| ~ aInteger0(w)
| ~ equal(sdtasdt0(w,v),u)
| aDivisorOf0(w,u)
| equal(w,sz00) ),
file('NUM436+1.p',unknown),
[] ).
cnf(42,axiom,
( ~ aInteger0(u)
| ~ aInteger0(v)
| ~ aInteger0(w)
| ~ aDivisorOf0(u,sdtpldt0(w,smndt0(v)))
| equal(u,sz00)
| sdteqdtlpzmzozddtrp0(w,v,u) ),
file('NUM436+1.p',unknown),
[] ).
cnf(521,plain,
( ~ aInteger0(u)
| ~ aInteger0(sdtasdt0(xp,xm))
| ~ aInteger0(xq)
| ~ equal(sdtpldt0(xa,smndt0(xb)),u)
| aDivisorOf0(xq,u)
| equal(xq,sz00) ),
inference(spl,[status(thm),theory(equality)],[29,39]),
[iquote('0:SpL:29.0,39.3')] ).
cnf(522,plain,
( ~ aInteger0(u)
| ~ aInteger0(sdtasdt0(xq,xm))
| ~ aInteger0(xp)
| ~ equal(sdtpldt0(xa,smndt0(xb)),u)
| aDivisorOf0(xp,u)
| equal(xp,sz00) ),
inference(spl,[status(thm),theory(equality)],[28,39]),
[iquote('0:SpL:28.0,39.3')] ).
cnf(538,plain,
( ~ aInteger0(u)
| ~ equal(sdtpldt0(xa,smndt0(xb)),u)
| aDivisorOf0(xp,u)
| equal(xp,sz00) ),
inference(ssi,[status(thm)],[522,5,24,6,7]),
[iquote('0:SSi:522.2,522.1,5.0,24.0,6.2,7.0')] ).
cnf(539,plain,
( ~ aInteger0(u)
| ~ equal(sdtpldt0(xa,smndt0(xb)),u)
| aDivisorOf0(xp,u) ),
inference(mrr,[status(thm)],[538,9]),
[iquote('0:MRR:538.3,9.0')] ).
cnf(540,plain,
( ~ aInteger0(u)
| ~ equal(sdtpldt0(xa,smndt0(xb)),u)
| aDivisorOf0(xq,u)
| equal(xq,sz00) ),
inference(ssi,[status(thm)],[521,6,24,5,7]),
[iquote('0:SSi:521.2,521.1,6.0,24.0,5.2,7.0')] ).
cnf(541,plain,
( ~ aInteger0(u)
| ~ equal(sdtpldt0(xa,smndt0(xb)),u)
| aDivisorOf0(xq,u) ),
inference(mrr,[status(thm)],[540,10]),
[iquote('0:MRR:540.3,10.0')] ).
cnf(553,plain,
( ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))) ),
inference(eqr,[status(thm),theory(equality)],[539]),
[iquote('0:EqR:539.1')] ).
cnf(554,plain,
aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))),
inference(ssi,[status(thm)],[553,23,3,11,4]),
[iquote('0:SSi:553.0,23.0,3.1,11.0,4.2')] ).
cnf(557,plain,
( ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
inference(eqr,[status(thm),theory(equality)],[541]),
[iquote('0:EqR:541.1')] ).
cnf(558,plain,
aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))),
inference(ssi,[status(thm)],[557,23,3,11,4]),
[iquote('0:SSi:557.0,23.0,3.1,11.0,4.2')] ).
cnf(1154,plain,
( ~ aInteger0(xq)
| ~ aInteger0(xb)
| ~ aInteger0(xa)
| equal(xq,sz00)
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
inference(res,[status(thm),theory(equality)],[558,42]),
[iquote('0:Res:558.0,42.3')] ).
cnf(1155,plain,
( ~ aInteger0(xp)
| ~ aInteger0(xb)
| ~ aInteger0(xa)
| equal(xp,sz00)
| sdteqdtlpzmzozddtrp0(xa,xb,xp) ),
inference(res,[status(thm),theory(equality)],[554,42]),
[iquote('0:Res:554.0,42.3')] ).
cnf(1160,plain,
( equal(xq,sz00)
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
inference(ssi,[status(thm)],[1154,3,4,6]),
[iquote('0:SSi:1154.2,1154.1,1154.0,3.0,4.0,6.0')] ).
cnf(1161,plain,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
inference(mrr,[status(thm)],[1160,10]),
[iquote('0:MRR:1160.0,10.0')] ).
cnf(1162,plain,
~ sdteqdtlpzmzozddtrp0(xa,xb,xp),
inference(mrr,[status(thm)],[22,1161]),
[iquote('0:MRR:22.0,1161.0')] ).
cnf(1163,plain,
( equal(xp,sz00)
| sdteqdtlpzmzozddtrp0(xa,xb,xp) ),
inference(ssi,[status(thm)],[1155,3,4,5]),
[iquote('0:SSi:1155.2,1155.1,1155.0,3.0,4.0,5.0')] ).
cnf(1164,plain,
sdteqdtlpzmzozddtrp0(xa,xb,xp),
inference(mrr,[status(thm)],[1163,9]),
[iquote('0:MRR:1163.0,9.0')] ).
cnf(1165,plain,
$false,
inference(mrr,[status(thm)],[1164,1162]),
[iquote('0:MRR:1164.0,1162.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM436+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jul 6 01:06:13 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.56
% 0.19/0.56 SPASS V 3.9
% 0.19/0.56 SPASS beiseite: Proof found.
% 0.19/0.56 % SZS status Theorem
% 0.19/0.56 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.56 SPASS derived 673 clauses, backtracked 41 clauses, performed 5 splits and kept 275 clauses.
% 0.19/0.56 SPASS allocated 98782 KBytes.
% 0.19/0.56 SPASS spent 0:00:00.20 on the problem.
% 0.19/0.56 0:00:00.04 for the input.
% 0.19/0.56 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.56 0:00:00.01 for inferences.
% 0.19/0.56 0:00:00.00 for the backtracking.
% 0.19/0.56 0:00:00.09 for the reduction.
% 0.19/0.56
% 0.19/0.56
% 0.19/0.56 Here is a proof with depth 3, length 33 :
% 0.19/0.56 % SZS output start Refutation
% See solution above
% 0.19/0.56 Formulae used in the proof : m__979 m__1032 mIntNeg m__ mIntPlus mIntMult m__1071 mDivisor mEquMod
% 0.19/0.56
%------------------------------------------------------------------------------