%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU319+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n009.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:13 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 7 unt; 1 nHn; 18 RR)
% Number of literals : 38 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
top_str(skc4),
file('SEU319+1.p',unknown),
[] ).
cnf(6,axiom,
element(skc5,powerset(the_carrier(skc4))),
file('SEU319+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ top_str(u)
| one_sorted_str(u) ),
file('SEU319+1.p',unknown),
[] ).
cnf(10,axiom,
( closed_subset(skc5,skc4)
| open_subset(subset_complement(the_carrier(skc4),skc5),skc4) ),
file('SEU319+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ closed_subset(skc5,skc4)
| ~ open_subset(subset_complement(the_carrier(skc4),skc5),skc4) ),
file('SEU319+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ one_sorted_str(u)
| ~ element(v,powerset(the_carrier(u)))
| equal(subset_difference(the_carrier(u),cast_as_carrier_subset(u),v),subset_complement(the_carrier(u),v)) ),
file('SEU319+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ top_str(u)
| ~ element(v,powerset(the_carrier(u)))
| ~ open_subset(subset_difference(the_carrier(u),cast_as_carrier_subset(u),v),u)
| closed_subset(v,u) ),
file('SEU319+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ top_str(u)
| ~ closed_subset(v,u)
| ~ element(v,powerset(the_carrier(u)))
| open_subset(subset_difference(the_carrier(u),cast_as_carrier_subset(u),v),u) ),
file('SEU319+1.p',unknown),
[] ).
cnf(23,plain,
one_sorted_str(skc4),
inference(res,[status(thm),theory(equality)],[1,7]),
[iquote('0:Res:1.0,7.0')] ).
cnf(24,plain,
( ~ top_str(skc4)
| ~ closed_subset(skc5,skc4)
| open_subset(subset_difference(the_carrier(skc4),cast_as_carrier_subset(skc4),skc5),skc4) ),
inference(res,[status(thm),theory(equality)],[6,19]),
[iquote('0:Res:6.0,19.2')] ).
cnf(25,plain,
( ~ top_str(skc4)
| ~ open_subset(subset_difference(the_carrier(skc4),cast_as_carrier_subset(skc4),skc5),skc4)
| closed_subset(skc5,skc4) ),
inference(res,[status(thm),theory(equality)],[6,18]),
[iquote('0:Res:6.0,18.2')] ).
cnf(26,plain,
( ~ one_sorted_str(skc4)
| equal(subset_difference(the_carrier(skc4),cast_as_carrier_subset(skc4),skc5),subset_complement(the_carrier(skc4),skc5)) ),
inference(res,[status(thm),theory(equality)],[6,17]),
[iquote('0:Res:6.0,17.1')] ).
cnf(34,plain,
equal(subset_difference(the_carrier(skc4),cast_as_carrier_subset(skc4),skc5),subset_complement(the_carrier(skc4),skc5)),
inference(mrr,[status(thm)],[26,23]),
[iquote('0:MRR:26.0,23.0')] ).
cnf(35,plain,
( ~ top_str(skc4)
| ~ closed_subset(skc5,skc4)
| open_subset(subset_complement(the_carrier(skc4),skc5),skc4) ),
inference(rew,[status(thm),theory(equality)],[34,24]),
[iquote('0:Rew:34.0,24.2')] ).
cnf(36,plain,
open_subset(subset_complement(the_carrier(skc4),skc5),skc4),
inference(mrr,[status(thm)],[35,1,10]),
[iquote('0:MRR:35.0,35.1,1.0,10.0')] ).
cnf(37,plain,
~ closed_subset(skc5,skc4),
inference(mrr,[status(thm)],[12,36]),
[iquote('0:MRR:12.1,36.0')] ).
cnf(38,plain,
( ~ top_str(skc4)
| ~ open_subset(subset_complement(the_carrier(skc4),skc5),skc4)
| closed_subset(skc5,skc4) ),
inference(rew,[status(thm),theory(equality)],[34,25]),
[iquote('0:Rew:34.0,25.1')] ).
cnf(39,plain,
$false,
inference(mrr,[status(thm)],[38,1,36,37]),
[iquote('0:MRR:38.0,38.1,38.2,1.0,36.0,37.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU319+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n009.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 : Mon Jun 20 10:44:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 14 clauses, backtracked 0 clauses, performed 0 splits and kept 29 clauses.
% 0.20/0.44 SPASS allocated 97708 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.44 0:00:00.03 for the input.
% 0.20/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.00 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 1, length 18 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : t29_tops_1 dt_l1_pre_topc t17_pre_topc d6_pre_topc
% 0.20/0.44
%------------------------------------------------------------------------------