TSTP Solution File: NUM423+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM423+3 : 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:02 EDT 2022
% Result : Theorem 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 7 unt; 0 nHn; 12 RR)
% Number of literals : 17 ( 0 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
aInteger0(sz00),
file('NUM423+3.p',unknown),
[] ).
cnf(3,axiom,
aInteger0(xa),
file('NUM423+3.p',unknown),
[] ).
cnf(4,axiom,
aInteger0(xq),
file('NUM423+3.p',unknown),
[] ).
cnf(14,axiom,
( ~ aInteger0(u)
| equal(sdtasdt0(u,sz00),sz00) ),
file('NUM423+3.p',unknown),
[] ).
cnf(16,axiom,
( ~ aInteger0(u)
| equal(sdtpldt0(u,smndt0(u)),sz00) ),
file('NUM423+3.p',unknown),
[] ).
cnf(24,axiom,
( ~ aInteger0(u)
| ~ equal(sdtasdt0(xq,u),sdtpldt0(xa,smndt0(xa))) ),
file('NUM423+3.p',unknown),
[] ).
cnf(42,plain,
~ equal(sdtasdt0(xq,sz00),sdtpldt0(xa,smndt0(xa))),
inference(res,[status(thm),theory(equality)],[1,24]),
[iquote('0:Res:1.0,24.0')] ).
cnf(57,plain,
( ~ aInteger0(xq)
| ~ equal(sdtpldt0(xa,smndt0(xa)),sz00) ),
inference(spl,[status(thm),theory(equality)],[14,42]),
[iquote('0:SpL:14.1,42.0')] ).
cnf(58,plain,
~ equal(sdtpldt0(xa,smndt0(xa)),sz00),
inference(ssi,[status(thm)],[57,4]),
[iquote('0:SSi:57.0,4.0')] ).
cnf(71,plain,
( ~ aInteger0(xa)
| ~ equal(sz00,sz00) ),
inference(spl,[status(thm),theory(equality)],[16,58]),
[iquote('0:SpL:16.1,58.0')] ).
cnf(74,plain,
~ aInteger0(xa),
inference(obv,[status(thm),theory(equality)],[71]),
[iquote('0:Obv:71.1')] ).
cnf(75,plain,
$false,
inference(ssi,[status(thm)],[74,3]),
[iquote('0:SSi:74.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM423+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 5 18:46:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45
% 0.20/0.45 SPASS V 3.9
% 0.20/0.45 SPASS beiseite: Proof found.
% 0.20/0.45 % SZS status Theorem
% 0.20/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 SPASS derived 32 clauses, backtracked 0 clauses, performed 0 splits and kept 45 clauses.
% 0.20/0.45 SPASS allocated 97737 KBytes.
% 0.20/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.20/0.45 0:00:00.04 for the input.
% 0.20/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.45 0:00:00.00 for inferences.
% 0.20/0.45 0:00:00.00 for the backtracking.
% 0.20/0.45 0:00:00.00 for the reduction.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Here is a proof with depth 3, length 12 :
% 0.20/0.45 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : mIntZero m__671 mMulZero mAddNeg m__
% 0.20/0.45
%------------------------------------------------------------------------------