TSTP Solution File: SEU361+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU361+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:37 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 28 ( 12 unt; 2 nHn; 28 RR)
% Number of literals : 65 ( 0 equ; 44 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
antisymmetric_relstr(skc8),
file('SEU361+1.p',unknown),
[] ).
cnf(2,axiom,
lower_bounded_relstr(skc8),
file('SEU361+1.p',unknown),
[] ).
cnf(3,axiom,
rel_str(skc8),
file('SEU361+1.p',unknown),
[] ).
cnf(10,axiom,
~ empty_carrier(skc8),
file('SEU361+1.p',unknown),
[] ).
cnf(14,axiom,
element(skc9,the_carrier(skc8)),
file('SEU361+1.p',unknown),
[] ).
cnf(18,axiom,
~ related(skc8,bottom_of_relstr(skc8),skc9),
file('SEU361+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ rel_str(u)
| element(bottom_of_relstr(u),the_carrier(u)) ),
file('SEU361+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ rel_str(u)
| equal(join_on_relstr(u,empty_set),bottom_of_relstr(u)) ),
file('SEU361+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ rel_str(u)
| ~ element(v,the_carrier(u))
| relstr_set_smaller(u,empty_set,v) ),
file('SEU361+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ rel_str(u)
| ~ lower_bounded_relstr(u)
| ~ antisymmetric_relstr(u)
| empty_carrier(u)
| ex_sup_of_relstr_set(u,empty_set) ),
file('SEU361+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ element(u,the_carrier(v))
| ~ skP0(w,x,v)
| ~ relstr_set_smaller(v,x,u)
| related(v,w,u) ),
file('SEU361+1.p',unknown),
[] ).
cnf(40,axiom,
( ~ rel_str(u)
| ~ antisymmetric_relstr(u)
| ~ ex_sup_of_relstr_set(u,v)
| ~ element(w,the_carrier(u))
| ~ equal(w,join_on_relstr(u,v))
| skP0(w,v,u) ),
file('SEU361+1.p',unknown),
[] ).
cnf(45,plain,
( ~ antisymmetric_relstr(skc8)
| ~ lower_bounded_relstr(skc8)
| ex_sup_of_relstr_set(skc8,empty_set)
| empty_carrier(skc8) ),
inference(res,[status(thm),theory(equality)],[3,33]),
[iquote('0:Res:3.0,33.2')] ).
cnf(48,plain,
equal(join_on_relstr(skc8,empty_set),bottom_of_relstr(skc8)),
inference(res,[status(thm),theory(equality)],[3,25]),
[iquote('0:Res:3.0,25.0')] ).
cnf(50,plain,
element(bottom_of_relstr(skc8),the_carrier(skc8)),
inference(res,[status(thm),theory(equality)],[3,24]),
[iquote('0:Res:3.0,24.0')] ).
cnf(54,plain,
( ~ rel_str(skc8)
| ~ equal(u,join_on_relstr(skc8,v))
| ~ ex_sup_of_relstr_set(skc8,v)
| ~ element(u,the_carrier(skc8))
| skP0(u,v,skc8) ),
inference(res,[status(thm),theory(equality)],[1,40]),
[iquote('0:Res:1.0,40.0')] ).
cnf(65,plain,
( ~ rel_str(skc8)
| relstr_set_smaller(skc8,empty_set,skc9) ),
inference(res,[status(thm),theory(equality)],[14,31]),
[iquote('0:Res:14.0,31.1')] ).
cnf(69,plain,
( ~ element(skc9,the_carrier(skc8))
| ~ relstr_set_smaller(skc8,u,skc9)
| ~ skP0(bottom_of_relstr(skc8),u,skc8) ),
inference(res,[status(thm),theory(equality)],[38,18]),
[iquote('0:Res:38.3,18.0')] ).
cnf(71,plain,
relstr_set_smaller(skc8,empty_set,skc9),
inference(mrr,[status(thm)],[65,3]),
[iquote('0:MRR:65.0,3.0')] ).
cnf(74,plain,
ex_sup_of_relstr_set(skc8,empty_set),
inference(mrr,[status(thm)],[45,1,2,10]),
[iquote('0:MRR:45.0,45.1,45.3,1.0,2.0,10.0')] ).
cnf(79,plain,
( ~ relstr_set_smaller(skc8,u,skc9)
| ~ skP0(bottom_of_relstr(skc8),u,skc8) ),
inference(mrr,[status(thm)],[69,14]),
[iquote('0:MRR:69.0,14.0')] ).
cnf(82,plain,
( ~ element(u,the_carrier(skc8))
| ~ equal(u,join_on_relstr(skc8,v))
| ~ ex_sup_of_relstr_set(skc8,v)
| skP0(u,v,skc8) ),
inference(mrr,[status(thm)],[54,3]),
[iquote('0:MRR:54.0,3.0')] ).
cnf(148,plain,
( ~ element(bottom_of_relstr(skc8),the_carrier(skc8))
| ~ equal(join_on_relstr(skc8,u),bottom_of_relstr(skc8))
| ~ ex_sup_of_relstr_set(skc8,u)
| ~ relstr_set_smaller(skc8,u,skc9) ),
inference(res,[status(thm),theory(equality)],[82,79]),
[iquote('0:Res:82.3,79.1')] ).
cnf(153,plain,
( ~ equal(join_on_relstr(skc8,u),bottom_of_relstr(skc8))
| ~ ex_sup_of_relstr_set(skc8,u)
| ~ relstr_set_smaller(skc8,u,skc9) ),
inference(mrr,[status(thm)],[148,50]),
[iquote('0:MRR:148.0,50.0')] ).
cnf(156,plain,
( ~ equal(join_on_relstr(skc8,empty_set),bottom_of_relstr(skc8))
| ~ ex_sup_of_relstr_set(skc8,empty_set) ),
inference(res,[status(thm),theory(equality)],[71,153]),
[iquote('0:Res:71.0,153.2')] ).
cnf(160,plain,
( ~ equal(bottom_of_relstr(skc8),bottom_of_relstr(skc8))
| ~ ex_sup_of_relstr_set(skc8,empty_set) ),
inference(rew,[status(thm),theory(equality)],[48,156]),
[iquote('0:Rew:48.0,156.0')] ).
cnf(161,plain,
~ ex_sup_of_relstr_set(skc8,empty_set),
inference(obv,[status(thm),theory(equality)],[160]),
[iquote('0:Obv:160.0')] ).
cnf(162,plain,
$false,
inference(mrr,[status(thm)],[161,74]),
[iquote('0:MRR:161.0,74.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU361+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n021.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 22:40:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 98 clauses, backtracked 0 clauses, performed 0 splits and kept 85 clauses.
% 0.19/0.44 SPASS allocated 97727 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 3, length 28 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : t44_yellow_0 dt_k3_yellow_0 d11_yellow_0 t6_yellow_0 t42_yellow_0 t30_yellow_0 existence_m1_subset_1
% 0.19/0.44
%------------------------------------------------------------------------------