TSTP Solution File: NUM587+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM587+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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:49 EDT 2022
% Result : Theorem 0.52s 0.73s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 11 RR)
% Number of literals : 17 ( 0 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
aSet0(xT),
file('NUM587+1.p',unknown),
[] ).
cnf(15,axiom,
~ aElementOf0(xx,xT),
file('NUM587+1.p',unknown),
[] ).
cnf(33,axiom,
aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT),
file('NUM587+1.p',unknown),
[] ).
cnf(60,axiom,
equal(sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),xx),
file('NUM587+1.p',unknown),
[] ).
cnf(77,axiom,
aElementOf0(sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),sdtlcdtrc0(xc,szDzozmdt0(xc))),
file('NUM587+1.p',unknown),
[] ).
cnf(78,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,w)
| ~ aSubsetOf0(w,u)
| aElementOf0(v,u) ),
file('NUM587+1.p',unknown),
[] ).
cnf(177,plain,
aElementOf0(xx,sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(rew,[status(thm),theory(equality)],[60,77]),
[iquote('0:Rew:60.0,77.0')] ).
cnf(197,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(u,xT)
| ~ aElementOf0(xx,u) ),
inference(res,[status(thm),theory(equality)],[78,15]),
[iquote('0:Res:78.3,15.0')] ).
cnf(204,plain,
( ~ aSubsetOf0(u,xT)
| ~ aElementOf0(xx,u) ),
inference(mrr,[status(thm)],[197,4]),
[iquote('0:MRR:197.0,4.0')] ).
cnf(224,plain,
~ aElementOf0(xx,sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(res,[status(thm),theory(equality)],[33,204]),
[iquote('0:Res:33.0,204.0')] ).
cnf(226,plain,
$false,
inference(mrr,[status(thm)],[224,177]),
[iquote('0:MRR:224.0,177.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM587+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n014.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 : Thu Jul 7 04:02:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.52/0.73
% 0.52/0.73 SPASS V 3.9
% 0.52/0.73 SPASS beiseite: Proof found.
% 0.52/0.73 % SZS status Theorem
% 0.52/0.73 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.52/0.73 SPASS derived 30 clauses, backtracked 0 clauses, performed 0 splits and kept 190 clauses.
% 0.52/0.73 SPASS allocated 101048 KBytes.
% 0.52/0.73 SPASS spent 0:00:00.38 on the problem.
% 0.52/0.73 0:00:00.04 for the input.
% 0.52/0.73 0:00:00.29 for the FLOTTER CNF translation.
% 0.52/0.73 0:00:00.00 for inferences.
% 0.52/0.73 0:00:00.00 for the backtracking.
% 0.52/0.73 0:00:00.02 for the reduction.
% 0.52/0.73
% 0.52/0.73
% 0.52/0.73 Here is a proof with depth 2, length 11 :
% 0.52/0.73 % SZS output start Refutation
% See solution above
% 0.52/0.73 Formulae used in the proof : m__3291 m__ m__3453 m__4263 mDefSub
% 0.52/0.73
%------------------------------------------------------------------------------