TSTP Solution File: SET148+4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET148+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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 : Tue Jul 19 05:24:32 EDT 2022
% Result : Theorem 3.75s 3.90s
% Output : Refutation 3.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 5 unt; 5 nHn; 17 RR)
% Number of literals : 33 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
~ equal_set(intersection(skc1,skc1),skc1),
file('SET148+4.p',unknown),
[] ).
cnf(7,axiom,
( subset(u,v)
| member(skf3(v,u),u) ),
file('SET148+4.p',unknown),
[] ).
cnf(12,axiom,
( ~ member(skf3(u,v),u)
| subset(w,u) ),
file('SET148+4.p',unknown),
[] ).
cnf(14,axiom,
( ~ member(u,intersection(v,w))
| member(u,w) ),
file('SET148+4.p',unknown),
[] ).
cnf(24,axiom,
( ~ subset(u,v)
| ~ subset(v,u)
| equal_set(v,u) ),
file('SET148+4.p',unknown),
[] ).
cnf(30,axiom,
( ~ member(u,v)
| ~ member(u,w)
| member(u,intersection(v,w)) ),
file('SET148+4.p',unknown),
[] ).
cnf(31,plain,
( ~ subset(skc1,intersection(skc1,skc1))
| ~ subset(intersection(skc1,skc1),skc1) ),
inference(res,[status(thm),theory(equality)],[24,3]),
[iquote('0:Res:24.2,3.0')] ).
cnf(51,plain,
( subset(intersection(u,v),w)
| member(skf3(w,intersection(u,v)),v) ),
inference(res,[status(thm),theory(equality)],[7,14]),
[iquote('0:Res:7.1,14.0')] ).
cnf(192,plain,
( ~ member(skf3(intersection(u,v),w),u)
| ~ member(skf3(intersection(u,v),w),v)
| subset(x,intersection(u,v)) ),
inference(res,[status(thm),theory(equality)],[30,12]),
[iquote('0:Res:30.2,12.0')] ).
cnf(548,plain,
( subset(intersection(u,v),v)
| subset(w,v) ),
inference(res,[status(thm),theory(equality)],[51,12]),
[iquote('0:Res:51.1,12.0')] ).
cnf(550,plain,
subset(intersection(u,v),v),
inference(con,[status(thm)],[548]),
[iquote('0:Con:548.1')] ).
cnf(551,plain,
~ subset(skc1,intersection(skc1,skc1)),
inference(mrr,[status(thm)],[31,550]),
[iquote('0:MRR:31.1,550.0')] ).
cnf(3989,plain,
( ~ member(skf3(intersection(u,v),u),v)
| subset(u,intersection(u,v))
| subset(w,intersection(u,v)) ),
inference(res,[status(thm),theory(equality)],[7,192]),
[iquote('0:Res:7.1,192.0')] ).
cnf(3999,plain,
( ~ member(skf3(intersection(u,v),u),v)
| subset(u,intersection(u,v)) ),
inference(con,[status(thm)],[3989]),
[iquote('0:Con:3989.2')] ).
cnf(8685,plain,
( subset(u,intersection(u,u))
| subset(u,intersection(u,u)) ),
inference(res,[status(thm),theory(equality)],[7,3999]),
[iquote('0:Res:7.1,3999.0')] ).
cnf(8717,plain,
subset(u,intersection(u,u)),
inference(obv,[status(thm),theory(equality)],[8685]),
[iquote('0:Obv:8685.0')] ).
cnf(8718,plain,
$false,
inference(unc,[status(thm)],[8717,551]),
[iquote('0:UnC:8717.0,551.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET148+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 04:08:46 EDT 2022
% 0.14/0.35 % CPUTime :
% 3.75/3.90
% 3.75/3.90 SPASS V 3.9
% 3.75/3.90 SPASS beiseite: Proof found.
% 3.75/3.90 % SZS status Theorem
% 3.75/3.90 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.75/3.90 SPASS derived 7622 clauses, backtracked 0 clauses, performed 0 splits and kept 4602 clauses.
% 3.75/3.90 SPASS allocated 92536 KBytes.
% 3.75/3.90 SPASS spent 0:00:03.45 on the problem.
% 3.75/3.90 0:00:00.04 for the input.
% 3.75/3.90 0:00:00.04 for the FLOTTER CNF translation.
% 3.75/3.90 0:00:00.10 for inferences.
% 3.75/3.90 0:00:00.00 for the backtracking.
% 3.75/3.90 0:00:03.20 for the reduction.
% 3.75/3.90
% 3.75/3.90
% 3.75/3.90 Here is a proof with depth 3, length 17 :
% 3.75/3.90 % SZS output start Refutation
% See solution above
% 3.75/3.90 Formulae used in the proof : thI13 subset intersection equal_set
% 3.75/3.90
%------------------------------------------------------------------------------