TSTP Solution File: NUM588+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM588+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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:27:50 EDT 2022
% Result : Theorem 1.51s 1.71s
% Output : Refutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 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(14,axiom,
aElementOf0(skc7,skc6),
file('NUM588+3.p',unknown),
[] ).
cnf(43,axiom,
( ~ aElementOf0(u,skc6)
| aElementOf0(u,skc5) ),
file('NUM588+3.p',unknown),
[] ).
cnf(79,axiom,
~ aElementOf0(skc7,sdtmndt0(sdtlpdtrp0(xN,skc4),szmzizndt0(sdtlpdtrp0(xN,skc4)))),
file('NUM588+3.p',unknown),
[] ).
cnf(114,axiom,
( ~ aElementOf0(u,skc5)
| aElementOf0(u,sdtmndt0(sdtlpdtrp0(xN,skc4),szmzizndt0(sdtlpdtrp0(xN,skc4)))) ),
file('NUM588+3.p',unknown),
[] ).
cnf(1614,plain,
aElementOf0(skc7,skc5),
inference(res,[status(thm),theory(equality)],[14,43]),
[iquote('0:Res:14.0,43.0')] ).
cnf(2910,plain,
~ aElementOf0(skc7,skc5),
inference(res,[status(thm),theory(equality)],[114,79]),
[iquote('0:Res:114.1,79.0')] ).
cnf(2911,plain,
$false,
inference(mrr,[status(thm)],[2910,1614]),
[iquote('0:MRR:2910.0,1614.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM588+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n019.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 : Wed Jul 6 21:30:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.51/1.71
% 1.51/1.71 SPASS V 3.9
% 1.51/1.71 SPASS beiseite: Proof found.
% 1.51/1.71 % SZS status Theorem
% 1.51/1.71 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.51/1.71 SPASS derived 2120 clauses, backtracked 891 clauses, performed 46 splits and kept 2522 clauses.
% 1.51/1.71 SPASS allocated 103773 KBytes.
% 1.51/1.71 SPASS spent 0:00:01.36 on the problem.
% 1.51/1.71 0:00:00.04 for the input.
% 1.51/1.71 0:00:00.67 for the FLOTTER CNF translation.
% 1.51/1.71 0:00:00.01 for inferences.
% 1.51/1.71 0:00:00.01 for the backtracking.
% 1.51/1.71 0:00:00.50 for the reduction.
% 1.51/1.71
% 1.51/1.71
% 1.51/1.71 Here is a proof with depth 1, length 7 :
% 1.51/1.71 % SZS output start Refutation
% See solution above
% 1.51/1.71 Formulae used in the proof : m__
% 1.51/1.71
%------------------------------------------------------------------------------