TSTP Solution File: SET688+4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET688+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:28:06 EDT 2022
% Result : Theorem 2.73s 2.94s
% Output : Refutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 19 ( 8 unt; 4 nHn; 19 RR)
% Number of literals : 35 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
subset(skc5,skc3),
file('SET688+4.p',unknown),
[] ).
cnf(2,axiom,
equal_set(skc5,skc4),
file('SET688+4.p',unknown),
[] ).
cnf(3,axiom,
subset(skc3,skc4),
file('SET688+4.p',unknown),
[] ).
cnf(5,axiom,
~ equal_set(skc3,skc4),
file('SET688+4.p',unknown),
[] ).
cnf(10,axiom,
( ~ equal_set(u,v)
| subset(v,u) ),
file('SET688+4.p',unknown),
[] ).
cnf(11,axiom,
( subset(u,v)
| member(skf3(v,u),u) ),
file('SET688+4.p',unknown),
[] ).
cnf(16,axiom,
( ~ member(skf3(u,v),u)
| subset(w,u) ),
file('SET688+4.p',unknown),
[] ).
cnf(27,axiom,
( ~ member(u,v)
| ~ subset(v,w)
| member(u,w) ),
file('SET688+4.p',unknown),
[] ).
cnf(28,axiom,
( ~ subset(u,v)
| ~ subset(v,u)
| equal_set(v,u) ),
file('SET688+4.p',unknown),
[] ).
cnf(37,plain,
( ~ subset(skc4,skc3)
| equal_set(skc3,skc4) ),
inference(res,[status(thm),theory(equality)],[3,28]),
[iquote('0:Res:3.0,28.0')] ).
cnf(40,plain,
subset(skc4,skc5),
inference(res,[status(thm),theory(equality)],[2,10]),
[iquote('0:Res:2.0,10.0')] ).
cnf(42,plain,
( ~ member(u,skc5)
| member(u,skc3) ),
inference(res,[status(thm),theory(equality)],[1,27]),
[iquote('0:Res:1.0,27.0')] ).
cnf(47,plain,
~ subset(skc4,skc3),
inference(mrr,[status(thm)],[37,5]),
[iquote('0:MRR:37.1,5.0')] ).
cnf(125,plain,
( ~ subset(u,v)
| subset(u,w)
| member(skf3(w,u),v) ),
inference(res,[status(thm),theory(equality)],[11,27]),
[iquote('0:Res:11.1,27.0')] ).
cnf(810,plain,
( ~ subset(u,skc5)
| subset(u,v)
| member(skf3(v,u),skc3) ),
inference(res,[status(thm),theory(equality)],[125,42]),
[iquote('0:Res:125.2,42.0')] ).
cnf(8636,plain,
( ~ subset(u,skc5)
| subset(u,skc3)
| subset(v,skc3) ),
inference(res,[status(thm),theory(equality)],[810,16]),
[iquote('0:Res:810.2,16.0')] ).
cnf(8643,plain,
( ~ subset(u,skc5)
| subset(u,skc3) ),
inference(con,[status(thm)],[8636]),
[iquote('0:Con:8636.2')] ).
cnf(8901,plain,
subset(skc4,skc3),
inference(res,[status(thm),theory(equality)],[40,8643]),
[iquote('0:Res:40.0,8643.0')] ).
cnf(8987,plain,
$false,
inference(mrr,[status(thm)],[8901,47]),
[iquote('0:MRR:8901.0,47.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET688+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 21:28:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.73/2.94
% 2.73/2.94 SPASS V 3.9
% 2.73/2.94 SPASS beiseite: Proof found.
% 2.73/2.94 % SZS status Theorem
% 2.73/2.94 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.73/2.94 SPASS derived 7492 clauses, backtracked 0 clauses, performed 0 splits and kept 3897 clauses.
% 2.73/2.94 SPASS allocated 92092 KBytes.
% 2.73/2.94 SPASS spent 0:00:02.51 on the problem.
% 2.73/2.94 0:00:00.03 for the input.
% 2.73/2.94 0:00:00.04 for the FLOTTER CNF translation.
% 2.73/2.94 0:00:00.09 for inferences.
% 2.73/2.94 0:00:00.00 for the backtracking.
% 2.73/2.94 0:00:02.28 for the reduction.
% 2.73/2.94
% 2.73/2.94
% 2.73/2.94 Here is a proof with depth 4, length 19 :
% 2.73/2.94 % SZS output start Refutation
% See solution above
% 2.73/2.94 Formulae used in the proof : thI04 equal_set subset
% 2.73/2.94
%------------------------------------------------------------------------------