%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM434+3 : 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:09 EDT 2022
% Result : Theorem 0.18s 0.43s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR)
% Number of literals : 6 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
aInteger0(skc1),
file('NUM434+3.p',unknown),
[] ).
cnf(28,axiom,
equal(sdtasdt0(sdtasdt0(xp,xq),skc1),sdtpldt0(xa,smndt0(xb))),
file('NUM434+3.p',unknown),
[] ).
cnf(33,axiom,
( ~ aInteger0(u)
| ~ equal(sdtasdt0(sdtasdt0(xp,xq),u),sdtpldt0(xa,smndt0(xb))) ),
file('NUM434+3.p',unknown),
[] ).
cnf(53,plain,
~ aInteger0(skc1),
inference(res,[status(thm),theory(equality)],[28,33]),
[iquote('0:Res:28.0,33.1')] ).
cnf(54,plain,
$false,
inference(mrr,[status(thm)],[53,7]),
[iquote('0:MRR:53.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM434+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n026.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 20:56:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43
% 0.18/0.43 SPASS V 3.9
% 0.18/0.43 SPASS beiseite: Proof found.
% 0.18/0.43 % SZS status Theorem
% 0.18/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.43 SPASS derived 9 clauses, backtracked 0 clauses, performed 0 splits and kept 45 clauses.
% 0.18/0.43 SPASS allocated 97768 KBytes.
% 0.18/0.43 SPASS spent 0:00:00.09 on the problem.
% 0.18/0.43 0:00:00.03 for the input.
% 0.18/0.43 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.43 0:00:00.00 for inferences.
% 0.18/0.43 0:00:00.00 for the backtracking.
% 0.18/0.43 0:00:00.00 for the reduction.
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Here is a proof with depth 1, length 5 :
% 0.18/0.43 % SZS output start Refutation
% See solution above
% 0.18/0.43 Formulae used in the proof : m__1003 m__
% 0.18/0.43
%------------------------------------------------------------------------------