TSTP Solution File: NUM441+6 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM441+6 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n008.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:13 EDT 2022
% Result : Theorem 1.60s 1.79s
% Output : Refutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of clauses : 12 ( 9 unt; 0 nHn; 12 RR)
% Number of literals : 22 ( 0 equ; 11 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(14,axiom,
isOpen0(stldt0(xA)),
file('NUM441+6.p',unknown),
[] ).
cnf(16,axiom,
isOpen0(stldt0(xB)),
file('NUM441+6.p',unknown),
[] ).
cnf(17,axiom,
aSet0(stldt0(xA)),
file('NUM441+6.p',unknown),
[] ).
cnf(18,axiom,
aSet0(stldt0(xB)),
file('NUM441+6.p',unknown),
[] ).
cnf(25,axiom,
aSubsetOf0(stldt0(xA),cS1395),
file('NUM441+6.p',unknown),
[] ).
cnf(26,axiom,
aSubsetOf0(stldt0(xB),cS1395),
file('NUM441+6.p',unknown),
[] ).
cnf(32,axiom,
~ isOpen0(stldt0(sdtbsmnsldt0(xA,xB))),
file('NUM441+6.p',unknown),
[] ).
cnf(92,axiom,
equal(sdtslmnbsdt0(stldt0(xA),stldt0(xB)),stldt0(sdtbsmnsldt0(xA,xB))),
file('NUM441+6.p',unknown),
[] ).
cnf(148,axiom,
( ~ isOpen0(u)
| ~ isOpen0(v)
| ~ aSubsetOf0(u,cS1395)
| ~ aSubsetOf0(v,cS1395)
| isOpen0(sdtslmnbsdt0(v,u)) ),
file('NUM441+6.p',unknown),
[] ).
cnf(4603,plain,
( ~ isOpen0(stldt0(xB))
| ~ isOpen0(stldt0(xA))
| ~ aSubsetOf0(stldt0(xB),cS1395)
| ~ aSubsetOf0(stldt0(xA),cS1395)
| isOpen0(stldt0(sdtbsmnsldt0(xA,xB))) ),
inference(spr,[status(thm),theory(equality)],[92,148]),
[iquote('0:SpR:92.0,148.4')] ).
cnf(4637,plain,
( ~ aSubsetOf0(stldt0(xB),cS1395)
| ~ aSubsetOf0(stldt0(xA),cS1395)
| isOpen0(stldt0(sdtbsmnsldt0(xA,xB))) ),
inference(ssi,[status(thm)],[4603,14,17,16,18]),
[iquote('0:SSi:4603.1,4603.0,14.0,17.0,16.0,18.0')] ).
cnf(4638,plain,
$false,
inference(mrr,[status(thm)],[4637,26,25,32]),
[iquote('0:MRR:4637.0,4637.1,4637.2,26.0,25.0,32.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM441+6 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jul 7 07:41:53 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.60/1.79
% 1.60/1.79 SPASS V 3.9
% 1.60/1.79 SPASS beiseite: Proof found.
% 1.60/1.79 % SZS status Theorem
% 1.60/1.79 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.60/1.79 SPASS derived 3002 clauses, backtracked 1669 clauses, performed 71 splits and kept 3546 clauses.
% 1.60/1.79 SPASS allocated 101128 KBytes.
% 1.60/1.79 SPASS spent 0:00:01.42 on the problem.
% 1.60/1.79 0:00:00.04 for the input.
% 1.60/1.79 0:00:00.22 for the FLOTTER CNF translation.
% 1.60/1.79 0:00:00.02 for inferences.
% 1.60/1.79 0:00:00.02 for the backtracking.
% 1.60/1.79 0:00:00.99 for the reduction.
% 1.60/1.79
% 1.60/1.79
% 1.60/1.79 Here is a proof with depth 1, length 12 :
% 1.60/1.79 % SZS output start Refutation
% See solution above
% 1.60/1.79 Formulae used in the proof : m__1826 mIntOne mUnionOpen m__1883 m__ mInterOpen
% 1.60/1.79
%------------------------------------------------------------------------------