TSTP Solution File: SEU394+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU394+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:54 EDT 2022
% Result : Theorem 0.37s 0.58s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 28 ( 17 unt; 4 nHn; 28 RR)
% Number of literals : 64 ( 0 equ; 38 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
one_sorted_str(skc17),
file('SEU394+1.p',unknown),
[] ).
cnf(6,axiom,
relation_empty_yielding(empty_set),
file('SEU394+1.p',unknown),
[] ).
cnf(7,axiom,
empty(empty_set),
file('SEU394+1.p',unknown),
[] ).
cnf(8,axiom,
relation(empty_set),
file('SEU394+1.p',unknown),
[] ).
cnf(85,axiom,
~ empty(skc18),
file('SEU394+1.p',unknown),
[] ).
cnf(86,axiom,
~ empty_carrier(skc17),
file('SEU394+1.p',unknown),
[] ).
cnf(161,axiom,
filtered_subset(skc18,boole_POSet(cast_as_carrier_subset(skc17))),
file('SEU394+1.p',unknown),
[] ).
cnf(162,axiom,
upper_relstr_subset(skc18,boole_POSet(cast_as_carrier_subset(skc17))),
file('SEU394+1.p',unknown),
[] ).
cnf(214,axiom,
proper_element(skc18,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(skc17))))),
file('SEU394+1.p',unknown),
[] ).
cnf(215,axiom,
element(skc18,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(skc17))))),
file('SEU394+1.p',unknown),
[] ).
cnf(229,axiom,
( ~ empty(u)
| ~ in(v,u) ),
file('SEU394+1.p',unknown),
[] ).
cnf(246,axiom,
( ~ one_sorted_str(u)
| ~ empty(cast_as_carrier_subset(u))
| empty_carrier(u) ),
file('SEU394+1.p',unknown),
[] ).
cnf(256,axiom,
( in(u,v)
| equal(set_difference(v,singleton(u)),v) ),
file('SEU394+1.p',unknown),
[] ).
cnf(258,axiom,
~ equal(filter_of_net_str(skc17,net_of_bool_filter(skc17,cast_as_carrier_subset(skc17),skc18)),skc18),
file('SEU394+1.p',unknown),
[] ).
cnf(344,axiom,
( ~ empty(u)
| ~ upper_relstr_subset(v,boole_POSet(w))
| ~ proper_element(v,powerset(the_carrier(boole_POSet(w))))
| ~ element(v,powerset(the_carrier(boole_POSet(w))))
| ~ in(u,v)
| ~ filtered_subset(v,boole_POSet(w))
| empty(w)
| empty(v) ),
file('SEU394+1.p',unknown),
[] ).
cnf(356,axiom,
( ~ one_sorted_str(u)
| ~ upper_relstr_subset(v,boole_POSet(cast_as_carrier_subset(u)))
| ~ filtered_subset(v,boole_POSet(cast_as_carrier_subset(u)))
| ~ element(v,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(u)))))
| empty(v)
| empty_carrier(u)
| equal(filter_of_net_str(u,net_of_bool_filter(u,cast_as_carrier_subset(u),v)),set_difference(v,singleton(empty_set))) ),
file('SEU394+1.p',unknown),
[] ).
cnf(372,plain,
( ~ empty(u)
| ~ in(u,v)
| ~ filtered_subset(v,boole_POSet(w))
| ~ upper_relstr_subset(v,boole_POSet(w))
| ~ element(v,powerset(the_carrier(boole_POSet(w))))
| ~ proper_element(v,powerset(the_carrier(boole_POSet(w))))
| empty(w) ),
inference(mrr,[status(thm)],[344,229]),
[iquote('0:MRR:344.7,229.0')] ).
cnf(405,plain,
( ~ empty(cast_as_carrier_subset(skc17))
| empty_carrier(skc17) ),
inference(res,[status(thm),theory(equality)],[1,246]),
[iquote('0:Res:1.0,246.0')] ).
cnf(533,plain,
( ~ one_sorted_str(skc17)
| ~ filtered_subset(skc18,boole_POSet(cast_as_carrier_subset(skc17)))
| ~ upper_relstr_subset(skc18,boole_POSet(cast_as_carrier_subset(skc17)))
| empty_carrier(skc17)
| empty(skc18)
| equal(filter_of_net_str(skc17,net_of_bool_filter(skc17,cast_as_carrier_subset(skc17),skc18)),set_difference(skc18,singleton(empty_set))) ),
inference(res,[status(thm),theory(equality)],[215,356]),
[iquote('0:Res:215.0,356.3')] ).
cnf(544,plain,
( ~ empty(u)
| ~ upper_relstr_subset(skc18,boole_POSet(cast_as_carrier_subset(skc17)))
| ~ element(skc18,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(skc17)))))
| ~ in(u,skc18)
| ~ filtered_subset(skc18,boole_POSet(cast_as_carrier_subset(skc17)))
| empty(cast_as_carrier_subset(skc17)) ),
inference(res,[status(thm),theory(equality)],[214,372]),
[iquote('0:Res:214.0,372.2')] ).
cnf(565,plain,
~ empty(cast_as_carrier_subset(skc17)),
inference(mrr,[status(thm)],[405,86]),
[iquote('0:MRR:405.1,86.0')] ).
cnf(579,plain,
( ~ empty(u)
| ~ in(u,skc18) ),
inference(mrr,[status(thm)],[544,162,215,161,565]),
[iquote('0:MRR:544.1,544.2,544.4,544.5,162.0,215.0,161.0,565.0')] ).
cnf(580,plain,
equal(filter_of_net_str(skc17,net_of_bool_filter(skc17,cast_as_carrier_subset(skc17),skc18)),set_difference(skc18,singleton(empty_set))),
inference(mrr,[status(thm)],[533,1,161,162,86,85]),
[iquote('0:MRR:533.0,533.1,533.2,533.3,533.4,1.0,161.0,162.0,86.0,85.0')] ).
cnf(581,plain,
~ equal(set_difference(skc18,singleton(empty_set)),skc18),
inference(rew,[status(thm),theory(equality)],[580,258]),
[iquote('0:Rew:580.0,258.0')] ).
cnf(844,plain,
( ~ equal(skc18,skc18)
| in(empty_set,skc18) ),
inference(spl,[status(thm),theory(equality)],[256,581]),
[iquote('0:SpL:256.1,581.0')] ).
cnf(845,plain,
in(empty_set,skc18),
inference(obv,[status(thm),theory(equality)],[844]),
[iquote('0:Obv:844.0')] ).
cnf(846,plain,
~ empty(empty_set),
inference(res,[status(thm),theory(equality)],[845,579]),
[iquote('0:Res:845.0,579.1')] ).
cnf(849,plain,
$false,
inference(ssi,[status(thm)],[846,6,8,7]),
[iquote('0:SSi:846.0,6.0,8.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU394+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n024.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 18:47:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.37/0.58
% 0.37/0.58 SPASS V 3.9
% 0.37/0.58 SPASS beiseite: Proof found.
% 0.37/0.58 % SZS status Theorem
% 0.37/0.58 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.58 SPASS derived 377 clauses, backtracked 0 clauses, performed 0 splits and kept 518 clauses.
% 0.37/0.58 SPASS allocated 98919 KBytes.
% 0.37/0.58 SPASS spent 0:00:00.24 on the problem.
% 0.37/0.58 0:00:00.04 for the input.
% 0.37/0.58 0:00:00.10 for the FLOTTER CNF translation.
% 0.37/0.58 0:00:00.00 for inferences.
% 0.37/0.58 0:00:00.00 for the backtracking.
% 0.37/0.58 0:00:00.02 for the reduction.
% 0.37/0.58
% 0.37/0.58
% 0.37/0.58 Here is a proof with depth 2, length 28 :
% 0.37/0.58 % SZS output start Refutation
% See solution above
% 0.37/0.58 Formulae used in the proof : t15_yellow19 fc12_relat_1 fc4_relat_1 t7_boole fc2_pre_topc t65_zfmisc_1 t2_yellow19 t14_yellow19
% 0.37/0.58
%------------------------------------------------------------------------------