TSTP Solution File: SEU325+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU325+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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 14:36:16 EDT 2022
% Result : Theorem 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 32 ( 16 unt; 2 nHn; 32 RR)
% Number of literals : 57 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
one_sorted_str(skc4),
file('SEU325+1.p',unknown),
[] ).
cnf(3,axiom,
empty(empty_set),
file('SEU325+1.p',unknown),
[] ).
cnf(15,axiom,
~ empty_carrier(skc4),
file('SEU325+1.p',unknown),
[] ).
cnf(16,axiom,
is_a_cover_of_carrier(skc4,empty_set),
file('SEU325+1.p',unknown),
[] ).
cnf(18,axiom,
empty(skf13(u)),
file('SEU325+1.p',unknown),
[] ).
cnf(21,axiom,
element(skf11(u),u),
file('SEU325+1.p',unknown),
[] ).
cnf(33,axiom,
element(skf13(u),powerset(u)),
file('SEU325+1.p',unknown),
[] ).
cnf(34,axiom,
element(empty_set,powerset(powerset(the_carrier(skc4)))),
file('SEU325+1.p',unknown),
[] ).
cnf(37,axiom,
( ~ empty(u)
| equal(u,empty_set) ),
file('SEU325+1.p',unknown),
[] ).
cnf(41,axiom,
( ~ one_sorted_str(u)
| equal(cast_as_carrier_subset(u),the_carrier(u)) ),
file('SEU325+1.p',unknown),
[] ).
cnf(61,axiom,
( ~ one_sorted_str(u)
| ~ empty(cast_as_carrier_subset(u))
| empty_carrier(u) ),
file('SEU325+1.p',unknown),
[] ).
cnf(63,axiom,
( ~ element(u,v)
| empty(v)
| in(u,v) ),
file('SEU325+1.p',unknown),
[] ).
cnf(80,axiom,
( ~ element(u,powerset(powerset(v)))
| element(union_of_subsets(v,u),powerset(v)) ),
file('SEU325+1.p',unknown),
[] ).
cnf(81,axiom,
( ~ element(u,powerset(powerset(v)))
| equal(union_of_subsets(v,u),union(u)) ),
file('SEU325+1.p',unknown),
[] ).
cnf(83,axiom,
( ~ empty(u)
| ~ in(v,w)
| ~ element(w,powerset(u)) ),
file('SEU325+1.p',unknown),
[] ).
cnf(91,axiom,
( ~ one_sorted_str(u)
| ~ is_a_cover_of_carrier(u,v)
| ~ element(v,powerset(powerset(the_carrier(u))))
| equal(union_of_subsets(the_carrier(u),v),cast_as_carrier_subset(u)) ),
file('SEU325+1.p',unknown),
[] ).
cnf(92,plain,
( ~ one_sorted_str(u)
| ~ empty(the_carrier(u))
| empty_carrier(u) ),
inference(rew,[status(thm),theory(equality)],[41,61]),
[iquote('0:Rew:41.1,61.1')] ).
cnf(94,plain,
( ~ element(u,powerset(powerset(v)))
| element(union(u),powerset(v)) ),
inference(rew,[status(thm),theory(equality)],[81,80]),
[iquote('0:Rew:81.1,80.1')] ).
cnf(96,plain,
( ~ one_sorted_str(u)
| ~ is_a_cover_of_carrier(u,v)
| ~ element(v,powerset(powerset(the_carrier(u))))
| equal(union(v),the_carrier(u)) ),
inference(rew,[status(thm),theory(equality)],[81,91,41]),
[iquote('0:Rew:81.1,91.3,41.1,91.3')] ).
cnf(100,plain,
( ~ empty(the_carrier(skc4))
| empty_carrier(skc4) ),
inference(res,[status(thm),theory(equality)],[1,92]),
[iquote('0:Res:1.0,92.0')] ).
cnf(139,plain,
( ~ one_sorted_str(skc4)
| ~ is_a_cover_of_carrier(skc4,empty_set)
| equal(union(empty_set),the_carrier(skc4)) ),
inference(res,[status(thm),theory(equality)],[34,96]),
[iquote('0:Res:34.0,96.2')] ).
cnf(144,plain,
~ empty(the_carrier(skc4)),
inference(mrr,[status(thm)],[100,15]),
[iquote('0:MRR:100.1,15.0')] ).
cnf(147,plain,
equal(union(empty_set),the_carrier(skc4)),
inference(mrr,[status(thm)],[139,1,16]),
[iquote('0:MRR:139.0,139.1,1.0,16.0')] ).
cnf(155,plain,
equal(skf13(u),empty_set),
inference(ems,[status(thm)],[37,18]),
[iquote('0:EmS:37.0,18.0')] ).
cnf(158,plain,
element(empty_set,powerset(u)),
inference(rew,[status(thm),theory(equality)],[155,33]),
[iquote('0:Rew:155.0,33.0')] ).
cnf(389,plain,
( empty(u)
| in(skf11(u),u) ),
inference(res,[status(thm),theory(equality)],[21,63]),
[iquote('0:Res:21.0,63.0')] ).
cnf(588,plain,
( ~ element(empty_set,powerset(powerset(u)))
| element(the_carrier(skc4),powerset(u)) ),
inference(spr,[status(thm),theory(equality)],[147,94]),
[iquote('0:SpR:147.0,94.1')] ).
cnf(621,plain,
element(the_carrier(skc4),powerset(u)),
inference(mrr,[status(thm)],[588,158]),
[iquote('0:MRR:588.0,158.0')] ).
cnf(684,plain,
( ~ empty(u)
| ~ in(v,the_carrier(skc4)) ),
inference(res,[status(thm),theory(equality)],[621,83]),
[iquote('0:Res:621.0,83.2')] ).
cnf(842,plain,
~ in(u,the_carrier(skc4)),
inference(ems,[status(thm)],[684,3]),
[iquote('0:EmS:684.0,3.0')] ).
cnf(843,plain,
empty(the_carrier(skc4)),
inference(res,[status(thm),theory(equality)],[389,842]),
[iquote('0:Res:389.1,842.0')] ).
cnf(846,plain,
$false,
inference(mrr,[status(thm)],[843,144]),
[iquote('0:MRR:843.0,144.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU325+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n017.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 : Sun Jun 19 09:22:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.49
% 0.18/0.49 SPASS V 3.9
% 0.18/0.49 SPASS beiseite: Proof found.
% 0.18/0.49 % SZS status Theorem
% 0.18/0.49 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.49 SPASS derived 730 clauses, backtracked 0 clauses, performed 0 splits and kept 548 clauses.
% 0.18/0.49 SPASS allocated 98129 KBytes.
% 0.18/0.49 SPASS spent 0:00:00.14 on the problem.
% 0.18/0.49 0:00:00.04 for the input.
% 0.18/0.49 0:00:00.04 for the FLOTTER CNF translation.
% 0.18/0.49 0:00:00.01 for inferences.
% 0.18/0.49 0:00:00.00 for the backtracking.
% 0.18/0.49 0:00:00.04 for the reduction.
% 0.18/0.49
% 0.18/0.49
% 0.18/0.49 Here is a proof with depth 5, length 32 :
% 0.18/0.49 % SZS output start Refutation
% See solution above
% 0.18/0.49 Formulae used in the proof : t5_tops_2 fc6_membered rc2_subset_1 existence_m1_subset_1 t6_boole d3_pre_topc fc2_pre_topc t2_subset dt_k5_setfam_1 redefinition_k5_setfam_1 t5_subset d8_pre_topc
% 0.18/0.49
%------------------------------------------------------------------------------