TSTP Solution File: SEU328+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU328+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:18 EDT 2022
% Result : Theorem 0.38s 0.60s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 27 ( 15 unt; 3 nHn; 27 RR)
% Number of literals : 44 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(15,axiom,
~ equal(skc3,empty_set),
file('SEU328+1.p',unknown),
[] ).
cnf(16,axiom,
equal(cast_to_subset(u),u),
file('SEU328+1.p',unknown),
[] ).
cnf(19,axiom,
element(skc3,powerset(powerset(skc4))),
file('SEU328+1.p',unknown),
[] ).
cnf(29,axiom,
element(cast_to_subset(u),powerset(u)),
file('SEU328+1.p',unknown),
[] ).
cnf(89,axiom,
~ equal(union_of_subsets(skc4,complements_of_subsets(skc4,skc3)),subset_complement(skc4,meet_of_subsets(skc4,skc3))),
file('SEU328+1.p',unknown),
[] ).
cnf(90,axiom,
( ~ element(u,powerset(v))
| equal(set_difference(v,u),subset_complement(v,u)) ),
file('SEU328+1.p',unknown),
[] ).
cnf(92,axiom,
( ~ element(u,powerset(powerset(v)))
| element(meet_of_subsets(v,u),powerset(v)) ),
file('SEU328+1.p',unknown),
[] ).
cnf(94,axiom,
( ~ element(u,powerset(powerset(v)))
| equal(union_of_subsets(v,u),union(u)) ),
file('SEU328+1.p',unknown),
[] ).
cnf(95,axiom,
( ~ element(u,powerset(powerset(v)))
| equal(meet_of_subsets(v,u),set_meet(u)) ),
file('SEU328+1.p',unknown),
[] ).
cnf(98,axiom,
( ~ element(u,powerset(powerset(v)))
| element(complements_of_subsets(v,u),powerset(powerset(v))) ),
file('SEU328+1.p',unknown),
[] ).
cnf(101,axiom,
( ~ element(u,powerset(v))
| ~ element(w,powerset(v))
| equal(subset_difference(v,w,u),set_difference(w,u)) ),
file('SEU328+1.p',unknown),
[] ).
cnf(102,axiom,
( ~ element(u,powerset(powerset(v)))
| equal(subset_difference(v,cast_to_subset(v),meet_of_subsets(v,u)),union_of_subsets(v,complements_of_subsets(v,u)))
| equal(u,empty_set) ),
file('SEU328+1.p',unknown),
[] ).
cnf(103,plain,
element(u,powerset(u)),
inference(rew,[status(thm),theory(equality)],[16,29]),
[iquote('0:Rew:16.0,29.0')] ).
cnf(104,plain,
( ~ element(u,powerset(powerset(v)))
| element(set_meet(u),powerset(v)) ),
inference(rew,[status(thm),theory(equality)],[95,92]),
[iquote('0:Rew:95.1,92.1')] ).
cnf(107,plain,
( ~ element(u,powerset(powerset(v)))
| equal(u,empty_set)
| equal(subset_difference(v,v,set_meet(u)),union_of_subsets(v,complements_of_subsets(v,u))) ),
inference(rew,[status(thm),theory(equality)],[16,102,95]),
[iquote('0:Rew:16.0,102.1,95.1,102.1')] ).
cnf(153,plain,
( equal(subset_difference(skc4,skc4,set_meet(skc3)),union_of_subsets(skc4,complements_of_subsets(skc4,skc3)))
| equal(skc3,empty_set) ),
inference(res,[status(thm),theory(equality)],[19,107]),
[iquote('0:Res:19.0,107.0')] ).
cnf(154,plain,
element(complements_of_subsets(skc4,skc3),powerset(powerset(skc4))),
inference(res,[status(thm),theory(equality)],[19,98]),
[iquote('0:Res:19.0,98.0')] ).
cnf(157,plain,
element(set_meet(skc3),powerset(skc4)),
inference(res,[status(thm),theory(equality)],[19,104]),
[iquote('0:Res:19.0,104.0')] ).
cnf(159,plain,
equal(meet_of_subsets(skc4,skc3),set_meet(skc3)),
inference(res,[status(thm),theory(equality)],[19,95]),
[iquote('0:Res:19.0,95.0')] ).
cnf(162,plain,
~ equal(union_of_subsets(skc4,complements_of_subsets(skc4,skc3)),subset_complement(skc4,set_meet(skc3))),
inference(rew,[status(thm),theory(equality)],[159,89]),
[iquote('0:Rew:159.0,89.0')] ).
cnf(164,plain,
equal(subset_difference(skc4,skc4,set_meet(skc3)),union_of_subsets(skc4,complements_of_subsets(skc4,skc3))),
inference(mrr,[status(thm)],[153,15]),
[iquote('0:MRR:153.1,15.0')] ).
cnf(1033,plain,
equal(union_of_subsets(skc4,complements_of_subsets(skc4,skc3)),union(complements_of_subsets(skc4,skc3))),
inference(res,[status(thm),theory(equality)],[154,94]),
[iquote('0:Res:154.0,94.0')] ).
cnf(1041,plain,
~ equal(subset_complement(skc4,set_meet(skc3)),union(complements_of_subsets(skc4,skc3))),
inference(rew,[status(thm),theory(equality)],[1033,162]),
[iquote('0:Rew:1033.0,162.0')] ).
cnf(1042,plain,
equal(subset_difference(skc4,skc4,set_meet(skc3)),union(complements_of_subsets(skc4,skc3))),
inference(rew,[status(thm),theory(equality)],[1033,164]),
[iquote('0:Rew:1033.0,164.0')] ).
cnf(2638,plain,
( ~ element(set_meet(skc3),powerset(skc4))
| ~ element(skc4,powerset(skc4))
| equal(set_difference(skc4,set_meet(skc3)),union(complements_of_subsets(skc4,skc3))) ),
inference(spr,[status(thm),theory(equality)],[1042,101]),
[iquote('0:SpR:1042.0,101.2')] ).
cnf(2641,plain,
( ~ element(set_meet(skc3),powerset(skc4))
| ~ element(skc4,powerset(skc4))
| equal(subset_complement(skc4,set_meet(skc3)),union(complements_of_subsets(skc4,skc3))) ),
inference(rew,[status(thm),theory(equality)],[90,2638]),
[iquote('0:Rew:90.1,2638.2')] ).
cnf(2642,plain,
$false,
inference(mrr,[status(thm)],[2641,157,103,1041]),
[iquote('0:MRR:2641.0,2641.1,2641.2,157.0,103.0,1041.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU328+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 17:43:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.38/0.60
% 0.38/0.60 SPASS V 3.9
% 0.38/0.60 SPASS beiseite: Proof found.
% 0.38/0.60 % SZS status Theorem
% 0.38/0.60 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.38/0.60 SPASS derived 2422 clauses, backtracked 168 clauses, performed 2 splits and kept 1212 clauses.
% 0.38/0.60 SPASS allocated 99027 KBytes.
% 0.38/0.60 SPASS spent 0:00:00.25 on the problem.
% 0.38/0.60 0:00:00.03 for the input.
% 0.38/0.60 0:00:00.03 for the FLOTTER CNF translation.
% 0.38/0.60 0:00:00.02 for inferences.
% 0.38/0.60 0:00:00.00 for the backtracking.
% 0.38/0.60 0:00:00.12 for the reduction.
% 0.38/0.60
% 0.38/0.60
% 0.38/0.60 Here is a proof with depth 2, length 27 :
% 0.38/0.60 % SZS output start Refutation
% See solution above
% 0.38/0.60 Formulae used in the proof : t12_tops_2 d4_subset_1 dt_k2_subset_1 d5_subset_1 dt_k6_setfam_1 redefinition_k5_setfam_1 redefinition_k6_setfam_1 dt_k7_setfam_1 redefinition_k6_subset_1 t48_setfam_1
% 0.38/0.60
%------------------------------------------------------------------------------