TSTP Solution File: NUM584+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM584+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:47 EDT 2022
% Result : Theorem 0.76s 0.97s
% Output : Refutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 6 ( 4 unt; 0 nHn; 6 RR)
% Number of literals : 8 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(58,axiom,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
file('NUM584+3.p',unknown),
[] ).
cnf(72,axiom,
equal(sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),xK),
file('NUM584+3.p',unknown),
[] ).
cnf(174,axiom,
( ~ aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS)
| ~ equal(sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),xK) ),
file('NUM584+3.p',unknown),
[] ).
cnf(270,plain,
( ~ aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS)
| ~ equal(xK,xK) ),
inference(rew,[status(thm),theory(equality)],[72,174]),
[iquote('0:Rew:72.0,174.1')] ).
cnf(271,plain,
~ aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
inference(obv,[status(thm),theory(equality)],[270]),
[iquote('0:Obv:270.1')] ).
cnf(272,plain,
$false,
inference(mrr,[status(thm)],[271,58]),
[iquote('0:MRR:271.0,58.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM584+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n016.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 03:49:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.76/0.97
% 0.76/0.97 SPASS V 3.9
% 0.76/0.97 SPASS beiseite: Proof found.
% 0.76/0.97 % SZS status Theorem
% 0.76/0.97 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.76/0.97 SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 166 clauses.
% 0.76/0.97 SPASS allocated 102899 KBytes.
% 0.76/0.97 SPASS spent 0:00:00.62 on the problem.
% 0.76/0.97 0:00:00.04 for the input.
% 0.76/0.97 0:00:00.53 for the FLOTTER CNF translation.
% 0.76/0.97 0:00:00.00 for inferences.
% 0.76/0.97 0:00:00.00 for the backtracking.
% 0.76/0.97 0:00:00.01 for the reduction.
% 0.76/0.97
% 0.76/0.97
% 0.76/0.97 Here is a proof with depth 0, length 6 :
% 0.76/0.97 % SZS output start Refutation
% See solution above
% 0.76/0.97 Formulae used in the proof : m__4024 m__4007 m__
% 0.76/0.97
%------------------------------------------------------------------------------