TSTP Solution File: SEU311+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU311+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:09 EDT 2022
% Result : Theorem 0.53s 0.71s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 26 ( 10 unt; 8 nHn; 26 RR)
% Number of literals : 55 ( 0 equ; 26 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 5 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,
top_str(skc5),
file('SEU311+1.p',unknown),
[] ).
cnf(2,axiom,
topological_space(skc5),
file('SEU311+1.p',unknown),
[] ).
cnf(13,axiom,
~ empty(powerset(u)),
file('SEU311+1.p',unknown),
[] ).
cnf(27,axiom,
element(skf7(u),powerset(the_carrier(skc5))),
file('SEU311+1.p',unknown),
[] ).
cnf(28,axiom,
element(skc6,powerset(powerset(the_carrier(skc5)))),
file('SEU311+1.p',unknown),
[] ).
cnf(31,axiom,
~ in(skf14(u,v),u),
file('SEU311+1.p',unknown),
[] ).
cnf(66,axiom,
( ~ element(u,v)
| empty(v)
| in(u,v) ),
file('SEU311+1.p',unknown),
[] ).
cnf(70,axiom,
( element(u,powerset(v))
| in(skf14(v,u),u) ),
file('SEU311+1.p',unknown),
[] ).
cnf(89,axiom,
( ~ in(u,skf12(v,w))
| in(u,powerset(the_carrier(w))) ),
file('SEU311+1.p',unknown),
[] ).
cnf(90,axiom,
( ~ in(u,skf12(v,w))
| in(set_difference(cast_as_carrier_subset(w),u),v) ),
file('SEU311+1.p',unknown),
[] ).
cnf(91,axiom,
( ~ element(u,powerset(powerset(the_carrier(skc5))))
| in(skf7(u),u)
| in(set_difference(cast_as_carrier_subset(skc5),skf7(u)),skc6) ),
file('SEU311+1.p',unknown),
[] ).
cnf(92,axiom,
( ~ element(u,powerset(powerset(the_carrier(skc5))))
| ~ in(skf7(u),u)
| ~ in(set_difference(cast_as_carrier_subset(skc5),skf7(u)),skc6) ),
file('SEU311+1.p',unknown),
[] ).
cnf(93,axiom,
( ~ topological_space(u)
| ~ top_str(u)
| ~ in(v,powerset(the_carrier(u)))
| ~ element(w,powerset(powerset(the_carrier(u))))
| ~ in(set_difference(cast_as_carrier_subset(u),v),w)
| in(v,skf12(w,u)) ),
file('SEU311+1.p',unknown),
[] ).
cnf(135,plain,
( ~ top_str(skc5)
| ~ topological_space(skc5)
| ~ in(set_difference(cast_as_carrier_subset(skc5),u),skc6)
| ~ in(u,powerset(the_carrier(skc5)))
| in(u,skf12(skc6,skc5)) ),
inference(res,[status(thm),theory(equality)],[28,93]),
[iquote('0:Res:28.0,93.3')] ).
cnf(168,plain,
( in(skf7(u),powerset(the_carrier(skc5)))
| empty(powerset(the_carrier(skc5))) ),
inference(res,[status(thm),theory(equality)],[27,66]),
[iquote('0:Res:27.0,66.0')] ).
cnf(179,plain,
in(skf7(u),powerset(the_carrier(skc5))),
inference(mrr,[status(thm)],[168,13]),
[iquote('0:MRR:168.1,13.0')] ).
cnf(181,plain,
( ~ in(u,powerset(the_carrier(skc5)))
| ~ in(set_difference(cast_as_carrier_subset(skc5),u),skc6)
| in(u,skf12(skc6,skc5)) ),
inference(mrr,[status(thm)],[135,1,2]),
[iquote('0:MRR:135.0,135.1,1.0,2.0')] ).
cnf(896,plain,
( element(skf12(u,v),powerset(w))
| in(skf14(w,skf12(u,v)),powerset(the_carrier(v))) ),
inference(res,[status(thm),theory(equality)],[70,89]),
[iquote('0:Res:70.1,89.0')] ).
cnf(927,plain,
( ~ in(skf7(u),skf12(skc6,skc5))
| ~ element(u,powerset(powerset(the_carrier(skc5))))
| ~ in(skf7(u),u) ),
inference(res,[status(thm),theory(equality)],[90,92]),
[iquote('0:Res:90.1,92.2')] ).
cnf(1628,plain,
element(skf12(u,v),powerset(powerset(the_carrier(v)))),
inference(res,[status(thm),theory(equality)],[896,31]),
[iquote('0:Res:896.1,31.0')] ).
cnf(1664,plain,
( in(skf7(skf12(u,skc5)),skf12(u,skc5))
| in(set_difference(cast_as_carrier_subset(skc5),skf7(skf12(u,skc5))),skc6) ),
inference(res,[status(thm),theory(equality)],[1628,91]),
[iquote('0:Res:1628.0,91.0')] ).
cnf(3379,plain,
( ~ in(skf7(skf12(u,skc5)),powerset(the_carrier(skc5)))
| in(skf7(skf12(u,skc5)),skf12(u,skc5))
| in(skf7(skf12(u,skc5)),skf12(skc6,skc5)) ),
inference(res,[status(thm),theory(equality)],[1664,181]),
[iquote('0:Res:1664.1,181.1')] ).
cnf(3385,plain,
( in(skf7(skf12(u,skc5)),skf12(u,skc5))
| in(skf7(skf12(u,skc5)),skf12(skc6,skc5)) ),
inference(mrr,[status(thm)],[3379,179]),
[iquote('0:MRR:3379.0,179.0')] ).
cnf(3410,plain,
in(skf7(skf12(skc6,skc5)),skf12(skc6,skc5)),
inference(fac,[status(thm)],[3385]),
[iquote('0:Fac:3385.0,3385.1')] ).
cnf(3500,plain,
( ~ element(skf12(skc6,skc5),powerset(powerset(the_carrier(skc5))))
| ~ in(skf7(skf12(skc6,skc5)),skf12(skc6,skc5)) ),
inference(res,[status(thm),theory(equality)],[3410,927]),
[iquote('0:Res:3410.0,927.0')] ).
cnf(3501,plain,
$false,
inference(mrr,[status(thm)],[3500,1628,3410]),
[iquote('0:MRR:3500.0,3500.1,1628.0,3410.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU311+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n017.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 12:05:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.53/0.71
% 0.53/0.71 SPASS V 3.9
% 0.53/0.71 SPASS beiseite: Proof found.
% 0.53/0.71 % SZS status Theorem
% 0.53/0.71 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.53/0.71 SPASS derived 3162 clauses, backtracked 6 clauses, performed 4 splits and kept 1338 clauses.
% 0.53/0.71 SPASS allocated 106009 KBytes.
% 0.53/0.71 SPASS spent 0:00:00.35 on the problem.
% 0.53/0.71 0:00:00.04 for the input.
% 0.53/0.71 0:00:00.04 for the FLOTTER CNF translation.
% 0.53/0.71 0:00:00.04 for inferences.
% 0.53/0.71 0:00:00.00 for the backtracking.
% 0.53/0.71 0:00:00.19 for the reduction.
% 0.53/0.71
% 0.53/0.71
% 0.53/0.71 Here is a proof with depth 6, length 26 :
% 0.53/0.71 % SZS output start Refutation
% See solution above
% 0.53/0.71 Formulae used in the proof : s3_subset_1__e2_37_1_1__pre_topc existence_m1_subset_1 fc1_subset_1 l71_subset_1 antisymmetry_r2_hidden d2_subset_1 s1_xboole_0__e2_37_1_1__pre_topc__1 fc1_xboole_0 t7_boole
% 0.53/0.71
%------------------------------------------------------------------------------