TSTP Solution File: SEU391+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU391+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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:52 EDT 2022
% Result : Theorem 0.77s 0.93s
% Output : Refutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 26 ( 8 unt; 12 nHn; 26 RR)
% Number of literals : 85 ( 0 equ; 42 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
one_sorted_str(skc18),
file('SEU391+1.p',unknown),
[] ).
cnf(85,axiom,
~ empty_carrier(skc19),
file('SEU391+1.p',unknown),
[] ).
cnf(86,axiom,
~ empty_carrier(skc18),
file('SEU391+1.p',unknown),
[] ).
cnf(87,axiom,
net_str(skc19,skc18),
file('SEU391+1.p',unknown),
[] ).
cnf(216,axiom,
( is_eventually_in(skc18,skc19,skc20)
| in(skc20,filter_of_net_str(skc18,skc19)) ),
file('SEU391+1.p',unknown),
[] ).
cnf(239,axiom,
( element(skc20,powerset(the_carrier(skc18)))
| in(skc20,filter_of_net_str(skc18,skc19)) ),
file('SEU391+1.p',unknown),
[] ).
cnf(283,axiom,
( ~ in(skc20,filter_of_net_str(skc18,skc19))
| ~ is_eventually_in(skc18,skc19,skc20)
| ~ element(skc20,powerset(the_carrier(skc18))) ),
file('SEU391+1.p',unknown),
[] ).
cnf(284,axiom,
( ~ one_sorted_str(u)
| ~ net_str(v,u)
| empty_carrier(v)
| empty_carrier(u)
| equal(a_2_1_yellow19(u,v),filter_of_net_str(u,v)) ),
file('SEU391+1.p',unknown),
[] ).
cnf(287,axiom,
( ~ one_sorted_str(u)
| ~ net_str(v,u)
| ~ in(w,a_2_1_yellow19(u,v))
| is_eventually_in(u,v,w)
| empty_carrier(u)
| empty_carrier(v) ),
file('SEU391+1.p',unknown),
[] ).
cnf(293,axiom,
( ~ one_sorted_str(u)
| ~ net_str(v,u)
| ~ in(w,a_2_1_yellow19(u,v))
| element(w,powerset(the_carrier(u)))
| empty_carrier(u)
| empty_carrier(v) ),
file('SEU391+1.p',unknown),
[] ).
cnf(298,axiom,
( ~ one_sorted_str(u)
| ~ is_eventually_in(u,v,w)
| ~ net_str(v,u)
| ~ element(w,powerset(the_carrier(u)))
| in(w,a_2_1_yellow19(u,v))
| empty_carrier(u)
| empty_carrier(v) ),
file('SEU391+1.p',unknown),
[] ).
cnf(299,plain,
( ~ one_sorted_str(u)
| ~ net_str(v,u)
| ~ in(w,filter_of_net_str(u,v))
| empty_carrier(v)
| empty_carrier(u)
| is_eventually_in(u,v,w) ),
inference(rew,[status(thm),theory(equality)],[284,287]),
[iquote('0:Rew:284.4,287.2')] ).
cnf(300,plain,
( ~ one_sorted_str(u)
| ~ net_str(v,u)
| ~ in(w,filter_of_net_str(u,v))
| empty_carrier(v)
| empty_carrier(u)
| element(w,powerset(the_carrier(u))) ),
inference(rew,[status(thm),theory(equality)],[284,293]),
[iquote('0:Rew:284.4,293.2')] ).
cnf(304,plain,
( ~ one_sorted_str(u)
| ~ net_str(v,u)
| ~ element(w,powerset(the_carrier(u)))
| ~ is_eventually_in(u,v,w)
| empty_carrier(v)
| empty_carrier(u)
| in(w,filter_of_net_str(u,v)) ),
inference(rew,[status(thm),theory(equality)],[284,298]),
[iquote('0:Rew:284.4,298.4')] ).
cnf(318,plain,
( ~ one_sorted_str(skc18)
| ~ is_eventually_in(skc18,skc19,u)
| ~ element(u,powerset(the_carrier(skc18)))
| in(u,filter_of_net_str(skc18,skc19))
| empty_carrier(skc18)
| empty_carrier(skc19) ),
inference(res,[status(thm),theory(equality)],[87,304]),
[iquote('0:Res:87.0,304.2')] ).
cnf(319,plain,
( ~ one_sorted_str(skc18)
| ~ in(u,filter_of_net_str(skc18,skc19))
| element(u,powerset(the_carrier(skc18)))
| empty_carrier(skc18)
| empty_carrier(skc19) ),
inference(res,[status(thm),theory(equality)],[87,300]),
[iquote('0:Res:87.0,300.1')] ).
cnf(320,plain,
( ~ one_sorted_str(skc18)
| ~ in(u,filter_of_net_str(skc18,skc19))
| is_eventually_in(skc18,skc19,u)
| empty_carrier(skc18)
| empty_carrier(skc19) ),
inference(res,[status(thm),theory(equality)],[87,299]),
[iquote('0:Res:87.0,299.1')] ).
cnf(447,plain,
( ~ in(u,filter_of_net_str(skc18,skc19))
| is_eventually_in(skc18,skc19,u) ),
inference(mrr,[status(thm)],[320,1,86,85]),
[iquote('0:MRR:320.0,320.3,320.4,1.0,86.0,85.0')] ).
cnf(448,plain,
is_eventually_in(skc18,skc19,skc20),
inference(mrr,[status(thm)],[216,447]),
[iquote('0:MRR:216.1,447.0')] ).
cnf(449,plain,
( ~ in(skc20,filter_of_net_str(skc18,skc19))
| ~ element(skc20,powerset(the_carrier(skc18))) ),
inference(mrr,[status(thm)],[283,447]),
[iquote('0:MRR:283.1,447.1')] ).
cnf(452,plain,
( ~ in(u,filter_of_net_str(skc18,skc19))
| element(u,powerset(the_carrier(skc18))) ),
inference(mrr,[status(thm)],[319,1,86,85]),
[iquote('0:MRR:319.0,319.3,319.4,1.0,86.0,85.0')] ).
cnf(453,plain,
element(skc20,powerset(the_carrier(skc18))),
inference(mrr,[status(thm)],[239,452]),
[iquote('0:MRR:239.1,452.0')] ).
cnf(454,plain,
~ in(skc20,filter_of_net_str(skc18,skc19)),
inference(mrr,[status(thm)],[449,452]),
[iquote('0:MRR:449.1,452.1')] ).
cnf(456,plain,
( ~ element(u,powerset(the_carrier(skc18)))
| ~ is_eventually_in(skc18,skc19,u)
| in(u,filter_of_net_str(skc18,skc19)) ),
inference(mrr,[status(thm)],[318,1,86,85]),
[iquote('0:MRR:318.0,318.4,318.5,1.0,86.0,85.0')] ).
cnf(3792,plain,
( ~ is_eventually_in(skc18,skc19,skc20)
| in(skc20,filter_of_net_str(skc18,skc19)) ),
inference(res,[status(thm),theory(equality)],[453,456]),
[iquote('0:Res:453.0,456.0')] ).
cnf(3812,plain,
$false,
inference(mrr,[status(thm)],[3792,448,454]),
[iquote('0:MRR:3792.0,3792.1,448.0,454.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU391+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n019.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 : Mon Jun 20 01:39:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.77/0.93
% 0.77/0.93 SPASS V 3.9
% 0.77/0.93 SPASS beiseite: Proof found.
% 0.77/0.93 % SZS status Theorem
% 0.77/0.93 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.77/0.93 SPASS derived 3061 clauses, backtracked 0 clauses, performed 0 splits and kept 1879 clauses.
% 0.77/0.93 SPASS allocated 101241 KBytes.
% 0.77/0.93 SPASS spent 0:00:00.57 on the problem.
% 0.77/0.93 0:00:00.04 for the input.
% 0.77/0.93 0:00:00.05 for the FLOTTER CNF translation.
% 0.77/0.93 0:00:00.05 for inferences.
% 0.77/0.93 0:00:00.00 for the backtracking.
% 0.77/0.93 0:00:00.35 for the reduction.
% 0.77/0.93
% 0.77/0.93
% 0.77/0.93 Here is a proof with depth 2, length 26 :
% 0.77/0.93 % SZS output start Refutation
% See solution above
% 0.77/0.93 Formulae used in the proof : t11_yellow19 d3_yellow19 fraenkel_a_2_1_yellow19
% 0.77/0.93
%------------------------------------------------------------------------------