%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU372+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:53:03 PM UTC 2026
% Result : Theorem 48.13s 7.25s
% Output : Refutation 48.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 21
% Syntax : Number of formulae : 195 ( 23 unt; 5 def)
% Number of atoms : 818 ( 15 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 1093 ( 470 ~; 470 |; 102 &)
% ( 15 <=>; 34 =>; 0 <=; 2 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 342 ( 315 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( top_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> ! [X2] :
( element(X2,powerset(the_carrier(X0)))
=> ( X2 = topstr_closure(X0,X1)
<=> ! [X3] :
( in(X3,the_carrier(X0))
=> ( in(X3,X2)
<=> ! [X4] :
( element(X4,powerset(the_carrier(X0)))
=> ~ ( open_subset(X4,X0)
& in(X3,X4)
& disjoint(X1,X4) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d13_pre_topc) ).
fof(f6,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& topological_space(X0)
& top_str(X0) )
=> ! [X1] :
( element(X1,the_carrier(X0))
=> ! [X2] :
( element(X2,powerset(the_carrier(X0)))
=> ( point_neighbourhood(X2,X0,X1)
<=> in(X1,interior(X0,X2)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_connsp_2) ).
fof(f7,axiom,
! [X0,X1] :
( ( top_str(X0)
& element(X1,powerset(the_carrier(X0))) )
=> element(interior(X0,X1),powerset(the_carrier(X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_tops_1) ).
fof(f10,axiom,
! [X0,X1] :
( ( top_str(X0)
& element(X1,powerset(the_carrier(X0))) )
=> element(topstr_closure(X0,X1),powerset(the_carrier(X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k6_pre_topc) ).
fof(f11,axiom,
! [X0] :
( top_str(X0)
=> one_sorted_str(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l1_pre_topc) ).
fof(f13,axiom,
! [X0,X1] :
( ( ~ empty_carrier(X0)
& topological_space(X0)
& top_str(X0)
& element(X1,the_carrier(X0)) )
=> ! [X2] :
( point_neighbourhood(X2,X0,X1)
=> element(X2,powerset(the_carrier(X0))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m1_connsp_2) ).
fof(f21,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ~ empty(the_carrier(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_struct_0) ).
fof(f37,axiom,
! [X0,X1] :
( disjoint(X0,X1)
=> disjoint(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(f39,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f40,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(f41,axiom,
! [X0] :
( top_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> subset(interior(X0,X1),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t44_tops_1) ).
fof(f42,axiom,
! [X0,X1,X2] :
( ( in(X0,X1)
& element(X1,powerset(X2)) )
=> element(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
fof(f43,axiom,
! [X0] :
( ( topological_space(X0)
& top_str(X0) )
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> open_subset(interior(X0,X1),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t51_tops_1) ).
fof(f44,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& topological_space(X0)
& top_str(X0) )
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> ! [X2] :
( element(X2,the_carrier(X0))
=> ( ( open_subset(X1,X0)
& in(X2,X1) )
=> point_neighbourhood(X1,X0,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_connsp_2) ).
fof(f46,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& disjoint(X1,X2) )
=> disjoint(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t63_xboole_1) ).
fof(f48,conjecture,
! [X0] :
( ( ~ empty_carrier(X0)
& topological_space(X0)
& top_str(X0) )
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> ! [X2] :
( element(X2,the_carrier(X0))
=> ( in(X2,topstr_closure(X0,X1))
<=> ! [X3] :
( point_neighbourhood(X3,X0,X2)
=> ~ disjoint(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_yellow_6) ).
fof(f49,negated_conjecture,
~ ! [X0] :
( ( ~ empty_carrier(X0)
& topological_space(X0)
& top_str(X0) )
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> ! [X2] :
( element(X2,the_carrier(X0))
=> ( in(X2,topstr_closure(X0,X1))
<=> ! [X3] :
( point_neighbourhood(X3,X0,X2)
=> ~ disjoint(X3,X1) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f64,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( X2 = topstr_closure(X0,X1)
<=> ! [X3] :
( ( in(X3,X2)
<=> ! [X4] :
( ~ open_subset(X4,X0)
| ~ in(X3,X4)
| ~ disjoint(X1,X4)
| ~ element(X4,powerset(the_carrier(X0))) ) )
| ~ in(X3,the_carrier(X0)) ) )
| ~ element(X2,powerset(the_carrier(X0))) )
| ~ element(X1,powerset(the_carrier(X0))) )
| ~ top_str(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f65,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( X2 = topstr_closure(X0,X1)
<=> ! [X3] :
( ( in(X3,X2)
<=> ! [X4] :
( ~ open_subset(X4,X0)
| ~ in(X3,X4)
| ~ disjoint(X1,X4)
| ~ element(X4,powerset(the_carrier(X0))) ) )
| ~ in(X3,the_carrier(X0)) ) )
| ~ element(X2,powerset(the_carrier(X0))) )
| ~ element(X1,powerset(the_carrier(X0))) )
| ~ top_str(X0) ),
inference(flattening,[],[f64]) ).
fof(f66,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( point_neighbourhood(X2,X0,X1)
<=> in(X1,interior(X0,X2)) )
| ~ element(X2,powerset(the_carrier(X0))) )
| ~ element(X1,the_carrier(X0)) )
| empty_carrier(X0)
| ~ topological_space(X0)
| ~ top_str(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f67,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( point_neighbourhood(X2,X0,X1)
<=> in(X1,interior(X0,X2)) )
| ~ element(X2,powerset(the_carrier(X0))) )
| ~ element(X1,the_carrier(X0)) )
| empty_carrier(X0)
| ~ topological_space(X0)
| ~ top_str(X0) ),
inference(flattening,[],[f66]) ).
fof(f68,plain,
! [X0,X1] :
( element(interior(X0,X1),powerset(the_carrier(X0)))
| ~ top_str(X0)
| ~ element(X1,powerset(the_carrier(X0))) ),
inference(ennf_transformation,[],[f7]) ).
fof(f69,plain,
! [X0,X1] :
( element(interior(X0,X1),powerset(the_carrier(X0)))
| ~ top_str(X0)
| ~ element(X1,powerset(the_carrier(X0))) ),
inference(flattening,[],[f68]) ).
fof(f70,plain,
! [X0,X1] :
( element(topstr_closure(X0,X1),powerset(the_carrier(X0)))
| ~ top_str(X0)
| ~ element(X1,powerset(the_carrier(X0))) ),
inference(ennf_transformation,[],[f10]) ).
fof(f71,plain,
! [X0,X1] :
( element(topstr_closure(X0,X1),powerset(the_carrier(X0)))
| ~ top_str(X0)
| ~ element(X1,powerset(the_carrier(X0))) ),
inference(flattening,[],[f70]) ).
fof(f72,plain,
! [X0] :
( one_sorted_str(X0)
| ~ top_str(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f73,plain,
! [X0,X1] :
( ! [X2] :
( element(X2,powerset(the_carrier(X0)))
| ~ point_neighbourhood(X2,X0,X1) )
| empty_carrier(X0)
| ~ topological_space(X0)
| ~ top_str(X0)
| ~ element(X1,the_carrier(X0)) ),
inference(ennf_transformation,[],[f13]) ).
fof(f74,plain,
! [X0,X1] :
( ! [X2] :
( element(X2,powerset(the_carrier(X0)))
| ~ point_neighbourhood(X2,X0,X1) )
| empty_carrier(X0)
| ~ topological_space(X0)
| ~ top_str(X0)
| ~ element(X1,the_carrier(X0)) ),
inference(flattening,[],[f73]) ).
fof(f77,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f78,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(flattening,[],[f77]) ).
fof(f82,plain,
! [X0,X1] :
( disjoint(X1,X0)
| ~ disjoint(X0,X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f84,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f39]) ).
fof(f85,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f84]) ).
fof(f86,plain,
! [X0] :
( ! [X1] :
( subset(interior(X0,X1),X1)
| ~ element(X1,powerset(the_carrier(X0))) )
| ~ top_str(X0) ),
inference(ennf_transformation,[],[f41]) ).
fof(f87,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(ennf_transformation,[],[f42]) ).
fof(f88,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(flattening,[],[f87]) ).
fof(f89,plain,
! [X0] :
( ! [X1] :
( open_subset(interior(X0,X1),X0)
| ~ element(X1,powerset(the_carrier(X0))) )
| ~ topological_space(X0)
| ~ top_str(X0) ),
inference(ennf_transformation,[],[f43]) ).
fof(f90,plain,
! [X0] :
( ! [X1] :
( open_subset(interior(X0,X1),X0)
| ~ element(X1,powerset(the_carrier(X0))) )
| ~ topological_space(X0)
| ~ top_str(X0) ),
inference(flattening,[],[f89]) ).
fof(f91,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( point_neighbourhood(X1,X0,X2)
| ~ open_subset(X1,X0)
| ~ in(X2,X1)
| ~ element(X2,the_carrier(X0)) )
| ~ element(X1,powerset(the_carrier(X0))) )
| empty_carrier(X0)
| ~ topological_space(X0)
| ~ top_str(X0) ),
inference(ennf_transformation,[],[f44]) ).
fof(f92,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( point_neighbourhood(X1,X0,X2)
| ~ open_subset(X1,X0)
| ~ in(X2,X1)
| ~ element(X2,the_carrier(X0)) )
| ~ element(X1,powerset(the_carrier(X0))) )
| empty_carrier(X0)
| ~ topological_space(X0)
| ~ top_str(X0) ),
inference(flattening,[],[f91]) ).
fof(f94,plain,
! [X0,X1,X2] :
( disjoint(X0,X2)
| ~ subset(X0,X1)
| ~ disjoint(X1,X2) ),
inference(ennf_transformation,[],[f46]) ).
fof(f95,plain,
! [X0,X1,X2] :
( disjoint(X0,X2)
| ~ subset(X0,X1)
| ~ disjoint(X1,X2) ),
inference(flattening,[],[f94]) ).
fof(f97,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ( in(X2,topstr_closure(X0,X1))
<~> ! [X3] :
( ~ disjoint(X3,X1)
| ~ point_neighbourhood(X3,X0,X2) ) )
& element(X2,the_carrier(X0)) )
& element(X1,powerset(the_carrier(X0))) )
& ~ empty_carrier(X0)
& topological_space(X0)
& top_str(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ( in(X2,topstr_closure(X0,X1))
<~> ! [X3] :
( ~ disjoint(X3,X1)
| ~ point_neighbourhood(X3,X0,X2) ) )
& element(X2,the_carrier(X0)) )
& element(X1,powerset(the_carrier(X0))) )
& ~ empty_carrier(X0)
& topological_space(X0)
& top_str(X0) ),
inference(flattening,[],[f97]) ).
fof(f101,definition,
! [X0,X1,X2] :
( sP0(X0,X1,X2)
<=> ! [X3] :
( ( in(X3,X2)
<=> ! [X4] :
( ~ open_subset(X4,X0)
| ~ in(X3,X4)
| ~ disjoint(X1,X4)
| ~ element(X4,powerset(the_carrier(X0))) ) )
| ~ in(X3,the_carrier(X0)) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f102,definition,
! [X2,X1,X0] :
( ( X2 = topstr_closure(X0,X1)
<=> sP0(X0,X1,X2) )
| ~ sP1(X2,X1,X0) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( sP1(X2,X1,X0)
| ~ element(X2,powerset(the_carrier(X0))) )
| ~ element(X1,powerset(the_carrier(X0))) )
| ~ top_str(X0) ),
inference(definition_folding,[],[f65,f102,f101]) ).
fof(f104,plain,
! [X2,X1,X0] :
( ( ( X2 = topstr_closure(X0,X1)
| ~ sP0(X0,X1,X2) )
& ( sP0(X0,X1,X2)
| topstr_closure(X0,X1) != X2 ) )
| ~ sP1(X2,X1,X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f105,plain,
! [X0,X1,X2] :
( ( ( topstr_closure(X2,X1) = X0
| ~ sP0(X2,X1,X0) )
& ( sP0(X2,X1,X0)
| topstr_closure(X2,X1) != X0 ) )
| ~ sP1(X0,X1,X2) ),
inference(rectify,[],[f104]) ).
fof(f106,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ? [X3] :
( ( ? [X4] :
( open_subset(X4,X0)
& in(X3,X4)
& disjoint(X1,X4)
& element(X4,powerset(the_carrier(X0))) )
| ~ in(X3,X2) )
& ( ! [X4] :
( ~ open_subset(X4,X0)
| ~ in(X3,X4)
| ~ disjoint(X1,X4)
| ~ element(X4,powerset(the_carrier(X0))) )
| in(X3,X2) )
& in(X3,the_carrier(X0)) ) )
& ( ! [X3] :
( ( ( in(X3,X2)
| ? [X4] :
( open_subset(X4,X0)
& in(X3,X4)
& disjoint(X1,X4)
& element(X4,powerset(the_carrier(X0))) ) )
& ( ! [X4] :
( ~ open_subset(X4,X0)
| ~ in(X3,X4)
| ~ disjoint(X1,X4)
| ~ element(X4,powerset(the_carrier(X0))) )
| ~ in(X3,X2) ) )
| ~ in(X3,the_carrier(X0)) )
| ~ sP0(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f101]) ).
fof(f107,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ? [X3] :
( ( ? [X4] :
( open_subset(X4,X0)
& in(X3,X4)
& disjoint(X1,X4)
& element(X4,powerset(the_carrier(X0))) )
| ~ in(X3,X2) )
& ( ! [X4] :
( ~ open_subset(X4,X0)
| ~ in(X3,X4)
| ~ disjoint(X1,X4)
| ~ element(X4,powerset(the_carrier(X0))) )
| in(X3,X2) )
& in(X3,the_carrier(X0)) ) )
& ( ! [X3] :
( ( ( in(X3,X2)
| ? [X4] :
( open_subset(X4,X0)
& in(X3,X4)
& disjoint(X1,X4)
& element(X4,powerset(the_carrier(X0))) ) )
& ( ! [X4] :
( ~ open_subset(X4,X0)
| ~ in(X3,X4)
| ~ disjoint(X1,X4)
| ~ element(X4,powerset(the_carrier(X0))) )
| ~ in(X3,X2) ) )
| ~ in(X3,the_carrier(X0)) )
| ~ sP0(X0,X1,X2) ) ),
inference(flattening,[],[f106]) ).
fof(f108,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ? [X3] :
( ( ? [X4] :
( open_subset(X4,X0)
& in(X3,X4)
& disjoint(X1,X4)
& element(X4,powerset(the_carrier(X0))) )
| ~ in(X3,X2) )
& ( ! [X5] :
( ~ open_subset(X5,X0)
| ~ in(X3,X5)
| ~ disjoint(X1,X5)
| ~ element(X5,powerset(the_carrier(X0))) )
| in(X3,X2) )
& in(X3,the_carrier(X0)) ) )
& ( ! [X6] :
( ( ( in(X6,X2)
| ? [X7] :
( open_subset(X7,X0)
& in(X6,X7)
& disjoint(X1,X7)
& element(X7,powerset(the_carrier(X0))) ) )
& ( ! [X8] :
( ~ open_subset(X8,X0)
| ~ in(X6,X8)
| ~ disjoint(X1,X8)
| ~ element(X8,powerset(the_carrier(X0))) )
| ~ in(X6,X2) ) )
| ~ in(X6,the_carrier(X0)) )
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f107]) ).
fof(f109,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ( ( ( open_subset(sK3(X0,X1,X2),X0)
& in(sK2(X0,X1,X2),sK3(X0,X1,X2))
& disjoint(X1,sK3(X0,X1,X2))
& element(sK3(X0,X1,X2),powerset(the_carrier(X0))) )
| ~ in(sK2(X0,X1,X2),X2) )
& ( ! [X5] :
( ~ open_subset(X5,X0)
| ~ in(sK2(X0,X1,X2),X5)
| ~ disjoint(X1,X5)
| ~ element(X5,powerset(the_carrier(X0))) )
| in(sK2(X0,X1,X2),X2) )
& in(sK2(X0,X1,X2),the_carrier(X0)) ) )
& ( ! [X6] :
( ( ( in(X6,X2)
| ( open_subset(sK4(X0,X1,X6),X0)
& in(X6,sK4(X0,X1,X6))
& disjoint(X1,sK4(X0,X1,X6))
& element(sK4(X0,X1,X6),powerset(the_carrier(X0))) ) )
& ( ! [X8] :
( ~ open_subset(X8,X0)
| ~ in(X6,X8)
| ~ disjoint(X1,X8)
| ~ element(X8,powerset(the_carrier(X0))) )
| ~ in(X6,X2) ) )
| ~ in(X6,the_carrier(X0)) )
| ~ sP0(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X3,sK2(X0,X1,X2)),skolemize(X4,sK3(X0,X1,X2)),skolemize(X7,sK4(X0,X1,X6))],[f108]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( point_neighbourhood(X2,X0,X1)
| ~ in(X1,interior(X0,X2)) )
& ( in(X1,interior(X0,X2))
| ~ point_neighbourhood(X2,X0,X1) ) )
| ~ element(X2,powerset(the_carrier(X0))) )
| ~ element(X1,the_carrier(X0)) )
| empty_carrier(X0)
| ~ topological_space(X0)
| ~ top_str(X0) ),
inference(nnf_transformation,[],[f67]) ).
fof(f127,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f40]) ).
fof(f128,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ( ? [X3] :
( disjoint(X3,X1)
& point_neighbourhood(X3,X0,X2) )
| ~ in(X2,topstr_closure(X0,X1)) )
& ( ! [X3] :
( ~ disjoint(X3,X1)
| ~ point_neighbourhood(X3,X0,X2) )
| in(X2,topstr_closure(X0,X1)) )
& element(X2,the_carrier(X0)) )
& element(X1,powerset(the_carrier(X0))) )
& ~ empty_carrier(X0)
& topological_space(X0)
& top_str(X0) ),
inference(nnf_transformation,[],[f98]) ).
fof(f129,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ( ? [X3] :
( disjoint(X3,X1)
& point_neighbourhood(X3,X0,X2) )
| ~ in(X2,topstr_closure(X0,X1)) )
& ( ! [X3] :
( ~ disjoint(X3,X1)
| ~ point_neighbourhood(X3,X0,X2) )
| in(X2,topstr_closure(X0,X1)) )
& element(X2,the_carrier(X0)) )
& element(X1,powerset(the_carrier(X0))) )
& ~ empty_carrier(X0)
& topological_space(X0)
& top_str(X0) ),
inference(flattening,[],[f128]) ).
fof(f130,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ( ? [X3] :
( disjoint(X3,X1)
& point_neighbourhood(X3,X0,X2) )
| ~ in(X2,topstr_closure(X0,X1)) )
& ( ! [X4] :
( ~ disjoint(X4,X1)
| ~ point_neighbourhood(X4,X0,X2) )
| in(X2,topstr_closure(X0,X1)) )
& element(X2,the_carrier(X0)) )
& element(X1,powerset(the_carrier(X0))) )
& ~ empty_carrier(X0)
& topological_space(X0)
& top_str(X0) ),
inference(rectify,[],[f129]) ).
fof(f131,plain,
( ( ( disjoint(sK24,sK22)
& point_neighbourhood(sK24,sK21,sK23) )
| ~ in(sK23,topstr_closure(sK21,sK22)) )
& ( ! [X4] :
( ~ disjoint(X4,sK22)
| ~ point_neighbourhood(X4,sK21,sK23) )
| in(sK23,topstr_closure(sK21,sK22)) )
& element(sK23,the_carrier(sK21))
& element(sK22,powerset(the_carrier(sK21)))
& ~ empty_carrier(sK21)
& topological_space(sK21)
& top_str(sK21) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21,sK22,sK23,sK24]),skolemize(X0,sK21),skolemize(X1,sK22),skolemize(X2,sK23),skolemize(X3,sK24)],[f130]) ).
fof(f137,plain,
! [X2,X0,X1] :
( sP0(X2,X1,X0)
| topstr_closure(X2,X1) != X0
| ~ sP1(X0,X1,X2) ),
inference(cnf_transformation,[],[f105]) ).
fof(f139,plain,
! [X2,X0,X1,X8,X6] :
( ~ element(X8,powerset(the_carrier(X0)))
| ~ in(X6,X8)
| ~ disjoint(X1,X8)
| ~ open_subset(X8,X0)
| ~ in(X6,X2)
| ~ in(X6,the_carrier(X0))
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f109]) ).
fof(f140,plain,
! [X2,X0,X1,X6] :
( ~ sP0(X0,X1,X2)
| element(sK4(X0,X1,X6),powerset(the_carrier(X0)))
| ~ in(X6,the_carrier(X0))
| in(X6,X2) ),
inference(cnf_transformation,[],[f109]) ).
fof(f141,plain,
! [X2,X0,X1,X6] :
( ~ sP0(X0,X1,X2)
| disjoint(X1,sK4(X0,X1,X6))
| ~ in(X6,the_carrier(X0))
| in(X6,X2) ),
inference(cnf_transformation,[],[f109]) ).
fof(f142,plain,
! [X2,X0,X1,X6] :
( ~ sP0(X0,X1,X2)
| in(X6,sK4(X0,X1,X6))
| ~ in(X6,the_carrier(X0))
| in(X6,X2) ),
inference(cnf_transformation,[],[f109]) ).
fof(f143,plain,
! [X2,X0,X1,X6] :
( ~ sP0(X0,X1,X2)
| open_subset(sK4(X0,X1,X6),X0)
| ~ in(X6,the_carrier(X0))
| in(X6,X2) ),
inference(cnf_transformation,[],[f109]) ).
fof(f150,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(the_carrier(X0)))
| sP1(X2,X1,X0)
| ~ element(X1,powerset(the_carrier(X0)))
| ~ top_str(X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f151,plain,
! [X2,X0,X1] :
( in(X1,interior(X0,X2))
| ~ point_neighbourhood(X2,X0,X1)
| ~ element(X2,powerset(the_carrier(X0)))
| ~ element(X1,the_carrier(X0))
| empty_carrier(X0)
| ~ topological_space(X0)
| ~ top_str(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f153,plain,
! [X0,X1] :
( element(interior(X0,X1),powerset(the_carrier(X0)))
| ~ top_str(X0)
| ~ element(X1,powerset(the_carrier(X0))) ),
inference(cnf_transformation,[],[f69]) ).
fof(f154,plain,
! [X0,X1] :
( element(topstr_closure(X0,X1),powerset(the_carrier(X0)))
| ~ top_str(X0)
| ~ element(X1,powerset(the_carrier(X0))) ),
inference(cnf_transformation,[],[f71]) ).
fof(f155,plain,
! [X0] :
( ~ top_str(X0)
| one_sorted_str(X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f156,plain,
! [X2,X0,X1] :
( ~ point_neighbourhood(X2,X0,X1)
| element(X2,powerset(the_carrier(X0)))
| empty_carrier(X0)
| ~ topological_space(X0)
| ~ top_str(X0)
| ~ element(X1,the_carrier(X0)) ),
inference(cnf_transformation,[],[f74]) ).
fof(f163,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f192,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| disjoint(X1,X0) ),
inference(cnf_transformation,[],[f82]) ).
fof(f194,plain,
! [X0,X1] :
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f85]) ).
fof(f195,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
fof(f196,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f127]) ).
fof(f197,plain,
! [X0,X1] :
( ~ element(X1,powerset(the_carrier(X0)))
| subset(interior(X0,X1),X1)
| ~ top_str(X0) ),
inference(cnf_transformation,[],[f86]) ).
fof(f198,plain,
! [X2,X0,X1] :
( ~ element(X1,powerset(X2))
| ~ in(X0,X1)
| element(X0,X2) ),
inference(cnf_transformation,[],[f88]) ).
fof(f199,plain,
! [X0,X1] :
( ~ element(X1,powerset(the_carrier(X0)))
| open_subset(interior(X0,X1),X0)
| ~ topological_space(X0)
| ~ top_str(X0) ),
inference(cnf_transformation,[],[f90]) ).
fof(f200,plain,
! [X2,X0,X1] :
( ~ element(X1,powerset(the_carrier(X0)))
| ~ open_subset(X1,X0)
| ~ in(X2,X1)
| ~ element(X2,the_carrier(X0))
| point_neighbourhood(X1,X0,X2)
| empty_carrier(X0)
| ~ topological_space(X0)
| ~ top_str(X0) ),
inference(cnf_transformation,[],[f92]) ).
fof(f202,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| disjoint(X0,X2)
| ~ disjoint(X1,X2) ),
inference(cnf_transformation,[],[f95]) ).
fof(f204,plain,
top_str(sK21),
inference(cnf_transformation,[],[f131]) ).
fof(f205,plain,
topological_space(sK21),
inference(cnf_transformation,[],[f131]) ).
fof(f206,plain,
~ empty_carrier(sK21),
inference(cnf_transformation,[],[f131]) ).
fof(f207,plain,
element(sK22,powerset(the_carrier(sK21))),
inference(cnf_transformation,[],[f131]) ).
fof(f208,plain,
element(sK23,the_carrier(sK21)),
inference(cnf_transformation,[],[f131]) ).
fof(f209,plain,
! [X4] :
( ~ disjoint(X4,sK22)
| ~ point_neighbourhood(X4,sK21,sK23)
| in(sK23,topstr_closure(sK21,sK22)) ),
inference(cnf_transformation,[],[f131]) ).
fof(f210,plain,
( point_neighbourhood(sK24,sK21,sK23)
| ~ in(sK23,topstr_closure(sK21,sK22)) ),
inference(cnf_transformation,[],[f131]) ).
fof(f211,plain,
( disjoint(sK24,sK22)
| ~ in(sK23,topstr_closure(sK21,sK22)) ),
inference(cnf_transformation,[],[f131]) ).
fof(f214,plain,
! [X2,X1] :
( ~ sP1(topstr_closure(X2,X1),X1,X2)
| sP0(X2,X1,topstr_closure(X2,X1)) ),
inference(equality_resolution,[],[f137]) ).
fof(f215,definition,
sF25 = topstr_closure(sK21,sK22),
introduced(definition,[new_symbols(definition,[sF25])],[function_definition]) ).
fof(f216,plain,
topstr_closure(sK21,sK22) = sF25,
inference(reorient_equations,[],[f215]) ).
fof(f217,plain,
( ~ in(sK23,sF25)
| disjoint(sK24,sK22) ),
inference(definition_folding,[],[f211,f216]) ).
fof(f218,plain,
( point_neighbourhood(sK24,sK21,sK23)
| ~ in(sK23,sF25) ),
inference(definition_folding,[],[f210,f216]) ).
fof(f219,plain,
! [X4] :
( ~ point_neighbourhood(X4,sK21,sK23)
| ~ disjoint(X4,sK22)
| in(sK23,sF25) ),
inference(definition_folding,[],[f209,f216]) ).
fof(f220,definition,
sF26 = the_carrier(sK21),
introduced(definition,[new_symbols(definition,[sF26])],[function_definition]) ).
fof(f221,plain,
the_carrier(sK21) = sF26,
inference(reorient_equations,[],[f220]) ).
fof(f222,plain,
element(sK23,sF26),
inference(definition_folding,[],[f208,f221]) ).
fof(f223,definition,
sF27 = powerset(sF26),
introduced(definition,[new_symbols(definition,[sF27])],[function_definition]) ).
fof(f224,plain,
powerset(sF26) = sF27,
inference(reorient_equations,[],[f223]) ).
fof(f225,plain,
element(sK22,sF27),
inference(definition_folding,[],[f207,f224,f221]) ).
fof(f226,plain,
! [X2,X0,X1] :
( in(X1,interior(X0,X2))
| ~ point_neighbourhood(X2,X0,X1)
| ~ element(X1,the_carrier(X0))
| empty_carrier(X0)
| ~ topological_space(X0)
| ~ top_str(X0) ),
inference(forward_subsumption_resolution,[],[f151,f156]) ).
fof(f236,plain,
one_sorted_str(sK21),
inference(resolution,[],[f155,f204]) ).
fof(f256,plain,
( ~ empty(sF26)
| empty_carrier(sK21)
| ~ one_sorted_str(sK21) ),
inference(superposition,[],[f163,f221]) ).
fof(f257,plain,
( ~ empty(sF26)
| ~ one_sorted_str(sK21) ),
inference(forward_subsumption_resolution,[],[f256,f206]) ).
fof(f258,plain,
~ empty(sF26),
inference(forward_subsumption_resolution,[],[f257,f236]) ).
fof(f265,plain,
! [X0] :
( ~ element(X0,sF27)
| subset(X0,sF26) ),
inference(superposition,[],[f195,f224]) ).
fof(f286,plain,
( in(sK23,sF26)
| empty(sF26) ),
inference(resolution,[],[f194,f222]) ).
fof(f287,plain,
in(sK23,sF26),
inference(forward_subsumption_resolution,[],[f286,f258]) ).
fof(f323,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| element(X0,X2)
| ~ in(X0,X1) ),
inference(resolution,[],[f198,f196]) ).
fof(f346,plain,
! [X0] :
( ~ element(X0,powerset(sF26))
| subset(interior(sK21,X0),X0)
| ~ top_str(sK21) ),
inference(superposition,[],[f197,f221]) ).
fof(f347,plain,
! [X0] :
( ~ element(X0,powerset(sF26))
| subset(interior(sK21,X0),X0) ),
inference(forward_subsumption_resolution,[],[f346,f204]) ).
fof(f350,plain,
! [X0] :
( subset(interior(sK21,X0),X0)
| ~ element(X0,sF27) ),
inference(forward_demodulation,[],[f347,f224]) ).
fof(f360,plain,
! [X0] :
( element(interior(sK21,X0),powerset(sF26))
| ~ top_str(sK21)
| ~ element(X0,powerset(sF26)) ),
inference(superposition,[],[f153,f221]) ).
fof(f362,plain,
! [X0] :
( element(interior(sK21,X0),powerset(sF26))
| ~ element(X0,powerset(sF26)) ),
inference(forward_subsumption_resolution,[],[f360,f204]) ).
fof(f364,plain,
! [X0] :
( element(interior(sK21,X0),sF27)
| ~ element(X0,powerset(sF26)) ),
inference(forward_demodulation,[],[f362,f224]) ).
fof(f365,plain,
! [X0] :
( element(interior(sK21,X0),sF27)
| ~ element(X0,sF27) ),
inference(forward_demodulation,[],[f364,f224]) ).
fof(f366,plain,
! [X0,X1] :
( disjoint(interior(sK21,X0),X1)
| ~ element(X0,sF27)
| ~ disjoint(X0,X1) ),
inference(resolution,[],[f350,f202]) ).
fof(f372,plain,
( element(sF25,powerset(the_carrier(sK21)))
| ~ top_str(sK21)
| ~ element(sK22,powerset(the_carrier(sK21))) ),
inference(superposition,[],[f154,f216]) ).
fof(f373,plain,
! [X0] :
( element(topstr_closure(sK21,X0),powerset(sF26))
| ~ top_str(sK21)
| ~ element(X0,powerset(sF26)) ),
inference(superposition,[],[f154,f221]) ).
fof(f375,plain,
! [X0] :
( element(topstr_closure(sK21,X0),powerset(sF26))
| ~ element(X0,powerset(sF26)) ),
inference(forward_subsumption_resolution,[],[f373,f204]) ).
fof(f376,plain,
( element(sF25,powerset(the_carrier(sK21)))
| ~ element(sK22,powerset(the_carrier(sK21))) ),
inference(forward_subsumption_resolution,[],[f372,f204]) ).
fof(f378,plain,
! [X0] :
( element(topstr_closure(sK21,X0),sF27)
| ~ element(X0,powerset(sF26)) ),
inference(forward_demodulation,[],[f375,f224]) ).
fof(f379,plain,
( element(sF25,powerset(sF26))
| ~ element(sK22,powerset(the_carrier(sK21))) ),
inference(forward_demodulation,[],[f376,f221]) ).
fof(f380,plain,
! [X0] :
( element(topstr_closure(sK21,X0),sF27)
| ~ element(X0,sF27) ),
inference(forward_demodulation,[],[f378,f224]) ).
fof(f381,plain,
( element(sF25,sF27)
| ~ element(sK22,powerset(the_carrier(sK21))) ),
inference(forward_demodulation,[],[f379,f224]) ).
fof(f382,plain,
( ~ element(sK22,powerset(sF26))
| element(sF25,sF27) ),
inference(forward_demodulation,[],[f381,f221]) ).
fof(f383,plain,
( ~ element(sK22,sF27)
| element(sF25,sF27) ),
inference(forward_demodulation,[],[f382,f224]) ).
fof(f384,plain,
element(sF25,sF27),
inference(forward_subsumption_resolution,[],[f383,f225]) ).
fof(f395,plain,
! [X0] :
( ~ element(X0,powerset(sF26))
| open_subset(interior(sK21,X0),sK21)
| ~ topological_space(sK21)
| ~ top_str(sK21) ),
inference(superposition,[],[f199,f221]) ).
fof(f398,plain,
! [X0] :
( ~ element(X0,powerset(sF26))
| open_subset(interior(sK21,X0),sK21)
| ~ top_str(sK21) ),
inference(forward_subsumption_resolution,[],[f395,f205]) ).
fof(f401,plain,
! [X0] :
( ~ element(X0,powerset(sF26))
| open_subset(interior(sK21,X0),sK21) ),
inference(forward_subsumption_resolution,[],[f398,f204]) ).
fof(f402,plain,
! [X0] :
( open_subset(interior(sK21,X0),sK21)
| ~ element(X0,sF27) ),
inference(forward_demodulation,[],[f401,f224]) ).
fof(f420,plain,
! [X0,X1] :
( ~ element(X0,powerset(sF26))
| sP1(X0,X1,sK21)
| ~ element(X1,powerset(sF26))
| ~ top_str(sK21) ),
inference(superposition,[],[f150,f221]) ).
fof(f423,plain,
! [X0,X1] :
( ~ element(X0,powerset(sF26))
| sP1(X0,X1,sK21)
| ~ element(X1,powerset(sF26)) ),
inference(forward_subsumption_resolution,[],[f420,f204]) ).
fof(f426,plain,
! [X0,X1] :
( ~ element(X0,sF27)
| sP1(X0,X1,sK21)
| ~ element(X1,powerset(sF26)) ),
inference(forward_demodulation,[],[f423,f224]) ).
fof(f427,plain,
! [X0,X1] :
( sP1(X0,X1,sK21)
| ~ element(X0,sF27)
| ~ element(X1,sF27) ),
inference(forward_demodulation,[],[f426,f224]) ).
fof(f450,plain,
! [X0] :
( ~ element(topstr_closure(sK21,X0),sF27)
| ~ element(X0,sF27)
| sP0(sK21,X0,topstr_closure(sK21,X0)) ),
inference(resolution,[],[f427,f214]) ).
fof(f452,plain,
! [X0] :
( sP0(sK21,X0,topstr_closure(sK21,X0))
| ~ element(X0,sF27) ),
inference(forward_subsumption_resolution,[],[f450,f380]) ).
fof(f453,plain,
( element(sK24,powerset(the_carrier(sK21)))
| empty_carrier(sK21)
| ~ topological_space(sK21)
| ~ top_str(sK21)
| ~ element(sK23,the_carrier(sK21))
| ~ in(sK23,sF25) ),
inference(resolution,[],[f156,f218]) ).
fof(f456,plain,
( element(sK24,powerset(the_carrier(sK21)))
| ~ topological_space(sK21)
| ~ top_str(sK21)
| ~ element(sK23,the_carrier(sK21))
| ~ in(sK23,sF25) ),
inference(forward_subsumption_resolution,[],[f453,f206]) ).
fof(f457,plain,
( element(sK24,powerset(the_carrier(sK21)))
| ~ top_str(sK21)
| ~ element(sK23,the_carrier(sK21))
| ~ in(sK23,sF25) ),
inference(forward_subsumption_resolution,[],[f456,f205]) ).
fof(f458,plain,
( element(sK24,powerset(the_carrier(sK21)))
| ~ element(sK23,the_carrier(sK21))
| ~ in(sK23,sF25) ),
inference(forward_subsumption_resolution,[],[f457,f204]) ).
fof(f459,plain,
( element(sK24,powerset(sF26))
| ~ element(sK23,the_carrier(sK21))
| ~ in(sK23,sF25) ),
inference(forward_demodulation,[],[f458,f221]) ).
fof(f460,plain,
( element(sK24,sF27)
| ~ element(sK23,the_carrier(sK21))
| ~ in(sK23,sF25) ),
inference(forward_demodulation,[],[f459,f224]) ).
fof(f461,plain,
( ~ element(sK23,sF26)
| element(sK24,sF27)
| ~ in(sK23,sF25) ),
inference(forward_demodulation,[],[f460,f221]) ).
fof(f462,plain,
( ~ in(sK23,sF25)
| element(sK24,sF27) ),
inference(forward_subsumption_resolution,[],[f461,f222]) ).
fof(f478,plain,
( sP0(sK21,sK22,sF25)
| ~ element(sK22,sF27) ),
inference(superposition,[],[f452,f216]) ).
fof(f479,plain,
sP0(sK21,sK22,sF25),
inference(forward_subsumption_resolution,[],[f478,f225]) ).
fof(f505,plain,
! [X0] :
( element(sK4(sK21,sK22,X0),powerset(the_carrier(sK21)))
| ~ in(X0,the_carrier(sK21))
| in(X0,sF25) ),
inference(resolution,[],[f479,f140]) ).
fof(f506,plain,
! [X0] :
( open_subset(sK4(sK21,sK22,X0),sK21)
| ~ in(X0,the_carrier(sK21))
| in(X0,sF25) ),
inference(resolution,[],[f479,f143]) ).
fof(f507,plain,
! [X0] :
( in(X0,sK4(sK21,sK22,X0))
| ~ in(X0,the_carrier(sK21))
| in(X0,sF25) ),
inference(resolution,[],[f479,f142]) ).
fof(f508,plain,
! [X0] :
( disjoint(sK22,sK4(sK21,sK22,X0))
| ~ in(X0,the_carrier(sK21))
| in(X0,sF25) ),
inference(resolution,[],[f479,f141]) ).
fof(f509,plain,
! [X0] :
( disjoint(sK22,sK4(sK21,sK22,X0))
| ~ in(X0,sF26)
| in(X0,sF25) ),
inference(forward_demodulation,[],[f508,f221]) ).
fof(f510,plain,
! [X0] :
( in(X0,sK4(sK21,sK22,X0))
| ~ in(X0,sF26)
| in(X0,sF25) ),
inference(forward_demodulation,[],[f507,f221]) ).
fof(f511,plain,
! [X0] :
( open_subset(sK4(sK21,sK22,X0),sK21)
| ~ in(X0,sF26)
| in(X0,sF25) ),
inference(forward_demodulation,[],[f506,f221]) ).
fof(f512,plain,
! [X0] :
( element(sK4(sK21,sK22,X0),powerset(sF26))
| ~ in(X0,the_carrier(sK21))
| in(X0,sF25) ),
inference(forward_demodulation,[],[f505,f221]) ).
fof(f513,plain,
! [X0] :
( element(sK4(sK21,sK22,X0),sF27)
| ~ in(X0,the_carrier(sK21))
| in(X0,sF25) ),
inference(forward_demodulation,[],[f512,f224]) ).
fof(f514,plain,
! [X0] :
( element(sK4(sK21,sK22,X0),sF27)
| ~ in(X0,sF26)
| in(X0,sF25) ),
inference(forward_demodulation,[],[f513,f221]) ).
fof(f523,plain,
! [X2,X3,X0,X1] :
( ~ element(X0,powerset(sF26))
| ~ in(X1,X0)
| ~ disjoint(X2,X0)
| ~ open_subset(X0,sK21)
| ~ in(X1,X3)
| ~ in(X1,sF26)
| ~ sP0(sK21,X2,X3) ),
inference(superposition,[],[f139,f221]) ).
fof(f524,plain,
! [X2,X3,X0,X1] :
( ~ sP0(sK21,X2,X3)
| ~ in(X1,X0)
| ~ disjoint(X2,X0)
| ~ open_subset(X0,sK21)
| ~ in(X1,X3)
| ~ in(X1,sF26)
| ~ element(X0,sF27) ),
inference(forward_demodulation,[],[f523,f224]) ).
fof(f543,plain,
! [X0,X1] :
( ~ element(X0,powerset(sF26))
| ~ open_subset(X0,sK21)
| ~ in(X1,X0)
| ~ element(X1,sF26)
| point_neighbourhood(X0,sK21,X1)
| empty_carrier(sK21)
| ~ topological_space(sK21)
| ~ top_str(sK21) ),
inference(superposition,[],[f200,f221]) ).
fof(f547,plain,
! [X0,X1] :
( ~ element(X0,powerset(sF26))
| ~ open_subset(X0,sK21)
| ~ in(X1,X0)
| ~ element(X1,sF26)
| point_neighbourhood(X0,sK21,X1)
| ~ topological_space(sK21)
| ~ top_str(sK21) ),
inference(forward_subsumption_resolution,[],[f543,f206]) ).
fof(f556,plain,
! [X0,X1] :
( ~ element(X0,powerset(sF26))
| ~ open_subset(X0,sK21)
| ~ in(X1,X0)
| ~ element(X1,sF26)
| point_neighbourhood(X0,sK21,X1)
| ~ top_str(sK21) ),
inference(forward_subsumption_resolution,[],[f547,f205]) ).
fof(f560,plain,
! [X0,X1] :
( ~ element(X0,powerset(sF26))
| ~ open_subset(X0,sK21)
| ~ in(X1,X0)
| ~ element(X1,sF26)
| point_neighbourhood(X0,sK21,X1) ),
inference(forward_subsumption_resolution,[],[f556,f204]) ).
fof(f562,plain,
! [X0,X1] :
( ~ element(X0,powerset(sF26))
| ~ open_subset(X0,sK21)
| ~ in(X1,X0)
| point_neighbourhood(X0,sK21,X1) ),
inference(forward_subsumption_resolution,[],[f560,f198]) ).
fof(f564,plain,
! [X0,X1] :
( point_neighbourhood(X0,sK21,X1)
| ~ open_subset(X0,sK21)
| ~ in(X1,X0)
| ~ element(X0,sF27) ),
inference(forward_demodulation,[],[f562,f224]) ).
fof(f570,plain,
! [X0,X1] :
( disjoint(X1,interior(sK21,X0))
| ~ disjoint(X0,X1)
| ~ element(X0,sF27) ),
inference(resolution,[],[f366,f192]) ).
fof(f571,plain,
! [X0] :
( ~ disjoint(X0,sK22)
| ~ in(sK23,X0)
| ~ element(X0,sF27)
| ~ open_subset(X0,sK21)
| in(sK23,sF25) ),
inference(resolution,[],[f564,f219]) ).
fof(f585,plain,
! [X0] :
( disjoint(sK4(sK21,sK22,X0),sK22)
| in(X0,sF25)
| ~ in(X0,sF26) ),
inference(resolution,[],[f509,f192]) ).
fof(f594,plain,
subset(sF25,sF26),
inference(resolution,[],[f265,f384]) ).
fof(f669,plain,
! [X0] :
( ~ in(X0,sF25)
| element(X0,sF26) ),
inference(resolution,[],[f323,f594]) ).
fof(f1144,plain,
! [X0,X1] :
( ~ disjoint(sK22,X1)
| ~ in(X0,X1)
| ~ open_subset(X1,sK21)
| ~ in(X0,sF25)
| ~ in(X0,sF26)
| ~ element(X1,sF27) ),
inference(resolution,[],[f524,f479]) ).
fof(f3971,plain,
! [X0] :
( in(X0,sF25)
| ~ in(X0,sF26)
| ~ in(sK23,sK4(sK21,sK22,X0))
| ~ element(sK4(sK21,sK22,X0),sF27)
| ~ open_subset(sK4(sK21,sK22,X0),sK21)
| in(sK23,sF25) ),
inference(resolution,[],[f585,f571]) ).
fof(f3973,plain,
! [X0] :
( in(X0,sF25)
| ~ in(X0,sF26)
| ~ in(sK23,sK4(sK21,sK22,X0))
| ~ open_subset(sK4(sK21,sK22,X0),sK21)
| in(sK23,sF25) ),
inference(forward_subsumption_resolution,[],[f3971,f514]) ).
fof(f3974,plain,
! [X0] :
( ~ in(sK23,sK4(sK21,sK22,X0))
| ~ in(X0,sF26)
| in(X0,sF25)
| in(sK23,sF25) ),
inference(forward_subsumption_resolution,[],[f3973,f511]) ).
fof(f18939,plain,
( ~ in(sK23,sF26)
| in(sK23,sF25)
| in(sK23,sF25)
| ~ in(sK23,sF26)
| in(sK23,sF25) ),
inference(resolution,[],[f3974,f510]) ).
fof(f18944,plain,
( ~ in(sK23,sF26)
| in(sK23,sF25) ),
inference(duplicate_literal_removal,[],[f18939]) ).
fof(f18947,plain,
in(sK23,sF25),
inference(forward_subsumption_resolution,[],[f18944,f287]) ).
fof(f18967,plain,
disjoint(sK24,sK22),
inference(resolution,[],[f18947,f217]) ).
fof(f20152,plain,
! [X0,X1] :
( ~ in(X0,interior(sK21,X1))
| ~ open_subset(interior(sK21,X1),sK21)
| ~ in(X0,sF25)
| ~ in(X0,sF26)
| ~ element(interior(sK21,X1),sF27)
| ~ disjoint(X1,sK22)
| ~ element(X1,sF27) ),
inference(resolution,[],[f1144,f570]) ).
fof(f20200,plain,
! [X0,X1] :
( ~ in(X0,interior(sK21,X1))
| ~ in(X0,sF25)
| ~ in(X0,sF26)
| ~ element(interior(sK21,X1),sF27)
| ~ disjoint(X1,sK22)
| ~ element(X1,sF27) ),
inference(forward_subsumption_resolution,[],[f20152,f402]) ).
fof(f20229,plain,
! [X0,X1] :
( ~ in(X0,interior(sK21,X1))
| ~ in(X0,sF25)
| ~ in(X0,sF26)
| ~ disjoint(X1,sK22)
| ~ element(X1,sF27) ),
inference(forward_subsumption_resolution,[],[f20200,f365]) ).
fof(f41770,plain,
! [X0,X1] :
( ~ in(X0,sF25)
| ~ in(X0,sF26)
| ~ disjoint(X1,sK22)
| ~ element(X1,sF27)
| ~ point_neighbourhood(X1,sK21,X0)
| ~ element(X0,the_carrier(sK21))
| empty_carrier(sK21)
| ~ topological_space(sK21)
| ~ top_str(sK21) ),
inference(resolution,[],[f20229,f226]) ).
fof(f41799,plain,
! [X0,X1] :
( ~ in(X0,sF25)
| ~ in(X0,sF26)
| ~ disjoint(X1,sK22)
| ~ element(X1,sF27)
| ~ point_neighbourhood(X1,sK21,X0)
| ~ element(X0,the_carrier(sK21))
| ~ topological_space(sK21)
| ~ top_str(sK21) ),
inference(forward_subsumption_resolution,[],[f41770,f206]) ).
fof(f41805,plain,
! [X0,X1] :
( ~ in(X0,sF25)
| ~ in(X0,sF26)
| ~ disjoint(X1,sK22)
| ~ element(X1,sF27)
| ~ point_neighbourhood(X1,sK21,X0)
| ~ element(X0,the_carrier(sK21))
| ~ top_str(sK21) ),
inference(forward_subsumption_resolution,[],[f41799,f205]) ).
fof(f41806,plain,
! [X0,X1] :
( ~ in(X0,sF25)
| ~ in(X0,sF26)
| ~ disjoint(X1,sK22)
| ~ element(X1,sF27)
| ~ point_neighbourhood(X1,sK21,X0)
| ~ element(X0,the_carrier(sK21)) ),
inference(forward_subsumption_resolution,[],[f41805,f204]) ).
fof(f41807,plain,
! [X0,X1] :
( ~ element(X0,sF26)
| ~ in(X0,sF25)
| ~ in(X0,sF26)
| ~ disjoint(X1,sK22)
| ~ element(X1,sF27)
| ~ point_neighbourhood(X1,sK21,X0) ),
inference(forward_demodulation,[],[f41806,f221]) ).
fof(f41808,plain,
! [X0,X1] :
( ~ point_neighbourhood(X1,sK21,X0)
| ~ in(X0,sF26)
| ~ disjoint(X1,sK22)
| ~ element(X1,sF27)
| ~ in(X0,sF25) ),
inference(forward_subsumption_resolution,[],[f41807,f669]) ).
fof(f42094,plain,
( ~ in(sK23,sF26)
| ~ disjoint(sK24,sK22)
| ~ element(sK24,sF27)
| ~ in(sK23,sF25)
| ~ in(sK23,sF25) ),
inference(resolution,[],[f41808,f218]) ).
fof(f42105,plain,
( ~ in(sK23,sF26)
| ~ disjoint(sK24,sK22)
| ~ element(sK24,sF27)
| ~ in(sK23,sF25) ),
inference(duplicate_literal_removal,[],[f42094]) ).
fof(f42115,plain,
( ~ in(sK23,sF26)
| ~ disjoint(sK24,sK22)
| ~ in(sK23,sF25) ),
inference(forward_subsumption_resolution,[],[f42105,f462]) ).
fof(f42160,plain,
( ~ disjoint(sK24,sK22)
| ~ in(sK23,sF25) ),
inference(forward_subsumption_resolution,[],[f42115,f287]) ).
fof(f42176,plain,
~ in(sK23,sF25),
inference(forward_subsumption_resolution,[],[f42160,f18967]) ).
fof(f42183,plain,
$false,
inference(forward_subsumption_resolution,[],[f42176,f18947]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU372+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.35 % Computer : n001.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Mon Sep 28 05:04:47 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 Running first-order model finding
% 0.13/0.38 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.35/4.45 % (34244)Will run a generic schedule for satisfiability detection.
% 28.35/4.45 % (34251)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2118391156:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 28.35/4.45 % (34250)% WARNING: option uhcvi not known.
% 28.35/4.45 % (34249)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1424072318_2999 on theBenchmark for (2999ds/0Mi)
% 28.35/4.45 % (34250)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1618000802:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 28.35/4.45 % (34252)dis+10_1_sil=32000:sp=arity:random_seed=94057994:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 28.35/4.45 % (34253)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=913179682:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 28.35/4.45 % (34254)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=966601501:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 28.35/4.45 % (34255)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3061754994:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 28.35/4.45 % TRYING [1]
% 28.35/4.45 % TRYING [2]
% 28.35/4.45 % TRYING [3]
% 28.35/4.45 % TRYING [4]
% 28.35/4.45 % TRYING [5]
% 28.35/4.45 % TRYING [6]
% 28.35/4.45 % (34252)Instruction limit reached!
% 28.35/4.45 % (34252)------------------------------
% 28.35/4.45 % (34252)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.35/4.45 % (34252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.35/4.45 % (34252)CaDiCaL version: 2.1.3
% 28.35/4.45 % (34252)Termination reason: Instruction limit
% 28.35/4.45 % (34252)Termination phase: Saturation
% 28.35/4.45 % (34252)Time elapsed: 0.072 s
% 28.35/4.45 % (34252)Peak memory usage: 12 MB
% 28.35/4.45 % (34252)Instructions burned: 104 (million)
% 28.35/4.45 % (34253)Instruction limit reached!
% 28.35/4.45 % (34253)------------------------------
% 28.35/4.45 % (34253)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.35/4.45 % (34253)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.35/4.45 % (34253)CaDiCaL version: 2.1.3
% 28.35/4.45 % (34253)Termination reason: Instruction limit
% 28.35/4.45 % (34253)Termination phase: Saturation
% 28.35/4.45 % (34253)Time elapsed: 0.074 s
% 28.35/4.45 % (34253)Peak memory usage: 12 MB
% 28.35/4.45 % (34253)Instructions burned: 117 (million)
% 28.35/4.45 % (34254)Instruction limit reached!
% 28.35/4.45 % (34254)------------------------------
% 28.35/4.45 % (34254)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.35/4.45 % (34254)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.35/4.45 % (34254)CaDiCaL version: 2.1.3
% 28.35/4.45 % (34254)Termination reason: Instruction limit
% 28.35/4.45 % (34254)Termination phase: Saturation
% 28.35/4.45 % (34254)Time elapsed: 0.090 s
% 28.35/4.45 % (34254)Peak memory usage: 13 MB
% 28.35/4.45 % (34254)Instructions burned: 131 (million)
% 28.35/4.45 % (34263)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1676627558:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 28.35/4.45 % (34264)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2313945549:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 28.35/4.45 % TRYING [1]
% 28.35/4.45 % TRYING [2]
% 28.35/4.45 % TRYING [3]
% 28.35/4.45 % TRYING [4]
% 28.35/4.45 % (34255)Instruction limit reached!
% 28.35/4.45 % (34255)------------------------------
% 28.35/4.45 % (34255)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.35/4.45 % (34255)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.35/4.45 % (34255)CaDiCaL version: 2.1.3
% 28.35/4.45 % (34255)Termination reason: Instruction limit
% 28.35/4.45 % (34255)Termination phase: Saturation
% 28.35/4.45 % (34255)Time elapsed: 0.109 s
% 28.35/4.45 % (34255)Peak memory usage: 14 MB
% 28.35/4.45 % (34255)Instructions burned: 163 (million)
% 28.35/4.45 % (34265)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1637610333:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 28.35/4.45 % TRYING [5]
% 28.35/4.45 % (34269)ott-21_1_sil=16000:fs=off:random_seed=1140465367:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 28.35/4.45 % TRYING [7]
% 28.35/4.45 % TRYING [6]
% 28.35/4.45 % (34264)Instruction limit reached!
% 28.35/4.45 % (34264)------------------------------
% 28.35/4.45 % (34264)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.35/4.45 % (34264)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34264)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34264)Termination reason: Instruction limit
% 48.13/7.25 % (34264)Termination phase: Saturation
% 48.13/7.25 % (34264)Time elapsed: 0.084 s
% 48.13/7.25 % (34264)Peak memory usage: 13 MB
% 48.13/7.25 % (34264)Instructions burned: 131 (million)
% 48.13/7.25 % (34271)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1475786523:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 48.13/7.25 % (34269)Instruction limit reached!
% 48.13/7.25 % (34269)------------------------------
% 48.13/7.25 % (34269)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34269)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34269)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34269)Termination reason: Instruction limit
% 48.13/7.25 % (34269)Termination phase: Saturation
% 48.13/7.25 % (34269)Time elapsed: 0.096 s
% 48.13/7.25 % (34269)Peak memory usage: 13 MB
% 48.13/7.25 % (34269)Instructions burned: 182 (million)
% 48.13/7.25 % TRYING [7]
% 48.13/7.25 % (34273)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1983146104:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 48.13/7.25 % TRYING [1]
% 48.13/7.25 % TRYING [2]
% 48.13/7.25 % TRYING [3]
% 48.13/7.25 % TRYING [4]
% 48.13/7.25 % TRYING [5]
% 48.13/7.25 % (34263)Instruction limit reached!
% 48.13/7.25 % (34263)------------------------------
% 48.13/7.25 % (34263)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34263)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34263)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34263)Termination reason: Instruction limit
% 48.13/7.25 % (34263)Termination phase: Finite model building SAT solving
% 48.13/7.25 % (34263)Time elapsed: 0.292 s
% 48.13/7.25 % (34263)Peak memory usage: 28 MB
% 48.13/7.25 % (34263)Instructions burned: 714 (million)
% 48.13/7.25 % (34265)Instruction limit reached!
% 48.13/7.25 % (34265)------------------------------
% 48.13/7.25 % (34265)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34265)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34265)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34265)Termination reason: Instruction limit
% 48.13/7.25 % (34265)Termination phase: Saturation
% 48.13/7.25 % (34265)Time elapsed: 0.278 s
% 48.13/7.25 % (34265)Peak memory usage: 14 MB
% 48.13/7.25 % (34265)Instructions burned: 685 (million)
% 48.13/7.25 % (34275)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1155830508:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 48.13/7.25 % (34276)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=814485563:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 48.13/7.25 % TRYING [6]
% 48.13/7.25 % TRYING [8]
% 48.13/7.25 % TRYING [14]
% 48.13/7.25 % (34271)Instruction limit reached!
% 48.13/7.25 % (34271)------------------------------
% 48.13/7.25 % (34271)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34271)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34271)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34271)Termination reason: Instruction limit
% 48.13/7.25 % (34271)Termination phase: Saturation
% 48.13/7.25 % (34271)Time elapsed: 0.334 s
% 48.13/7.25 % (34271)Peak memory usage: 14 MB
% 48.13/7.25 % (34271)Instructions burned: 478 (million)
% 48.13/7.25 % (34279)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=1924144777:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 48.13/7.25 % (34273)Instruction limit reached!
% 48.13/7.25 % (34273)------------------------------
% 48.13/7.25 % (34273)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34273)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34273)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34273)Termination reason: Instruction limit
% 48.13/7.25 % (34273)Termination phase: Finite model building SAT solving
% 48.13/7.25 % (34273)Time elapsed: 0.314 s
% 48.13/7.25 % (34273)Peak memory usage: 19 MB
% 48.13/7.25 % (34273)Instructions burned: 866 (million)
% 48.13/7.25 % (34281)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3981524853:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 48.13/7.25 % (34276)Instruction limit reached!
% 48.13/7.25 % (34276)------------------------------
% 48.13/7.25 % (34276)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34276)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34276)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34276)Termination reason: Instruction limit
% 48.13/7.25 % (34276)Termination phase: Finite model building constraint generation
% 48.13/7.25 % (34276)Time elapsed: 0.357 s
% 48.13/7.25 % (34276)Peak memory usage: 71 MB
% 48.13/7.25 % (34276)Instructions burned: 891 (million)
% 48.13/7.25 % (34283)fmb+10_1_sil=64000:random_seed=2708726089:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 48.13/7.25 % TRYING [1]
% 48.13/7.25 % TRYING [2]
% 48.13/7.25 % TRYING [3]
% 48.13/7.25 % TRYING [4]
% 48.13/7.25 % TRYING [5]
% 48.13/7.25 % TRYING [6]
% 48.13/7.25 % (34279)Instruction limit reached!
% 48.13/7.25 % (34279)------------------------------
% 48.13/7.25 % (34279)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34279)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34279)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34279)Termination reason: Instruction limit
% 48.13/7.25 % (34279)Termination phase: Saturation
% 48.13/7.25 % (34279)Time elapsed: 0.395 s
% 48.13/7.25 % (34279)Peak memory usage: 19 MB
% 48.13/7.25 % (34279)Instructions burned: 692 (million)
% 48.13/7.25 % (34285)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2133611348:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 48.13/7.25 % TRYING [20]
% 48.13/7.25 % TRYING [7]
% 48.13/7.25 % (34281)Instruction limit reached!
% 48.13/7.25 % (34281)------------------------------
% 48.13/7.25 % (34281)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34281)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34281)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34281)Termination reason: Instruction limit
% 48.13/7.25 % (34281)Termination phase: Saturation
% 48.13/7.25 % (34281)Time elapsed: 0.520 s
% 48.13/7.25 % (34281)Peak memory usage: 18 MB
% 48.13/7.25 % (34281)Instructions burned: 880 (million)
% 48.13/7.25 % (34287)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=4101282264:fmbsr=1.7:i=920_2988 on theBenchmark for (2988ds/920Mi)
% 48.13/7.25 % TRYING [8]
% 48.13/7.25 % (34275)Instruction limit reached!
% 48.13/7.25 % (34275)------------------------------
% 48.13/7.25 % (34275)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34275)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34275)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34275)Termination reason: Instruction limit
% 48.13/7.25 % (34275)Termination phase: Saturation
% 48.13/7.25 % (34275)Time elapsed: 0.734 s
% 48.13/7.25 % (34275)Peak memory usage: 24 MB
% 48.13/7.25 % (34275)Instructions burned: 1180 (million)
% 48.13/7.25 % (34289)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=1625824602:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 48.13/7.25 % TRYING [8]
% 48.13/7.25 % (34287)Instruction limit reached!
% 48.13/7.25 % (34287)------------------------------
% 48.13/7.25 % (34287)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34287)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34287)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34287)Termination reason: Instruction limit
% 48.13/7.25 % (34287)Termination phase: Finite model building SAT solving
% 48.13/7.25 % (34287)Time elapsed: 0.457 s
% 48.13/7.25 % (34287)Peak memory usage: 45 MB
% 48.13/7.25 % (34287)Instructions burned: 921 (million)
% 48.13/7.25 % (34291)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=618723634:i=1472:ins=7:fdi=8:gsp=on_2983 on theBenchmark for (2983ds/1472Mi)
% 48.13/7.25 % (34291)Instruction limit reached!
% 48.13/7.25 % (34291)------------------------------
% 48.13/7.25 % (34291)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34291)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34291)Termination reason: Instruction limit
% 48.13/7.25 % (34291)Termination phase: Saturation
% 48.13/7.25 % (34291)Time elapsed: 0.823 s
% 48.13/7.25 % (34291)Peak memory usage: 27 MB
% 48.13/7.25 % (34291)Instructions burned: 1473 (million)
% 48.13/7.25 % (34293)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=630412862:i=6324_2975 on theBenchmark for (2975ds/6324Mi)
% 48.13/7.25 % TRYING [77]
% 48.13/7.25 % (34289)Instruction limit reached!
% 48.13/7.25 % (34289)------------------------------
% 48.13/7.25 % (34289)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34289)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34289)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34289)Termination reason: Instruction limit
% 48.13/7.25 % (34289)Termination phase: Saturation
% 48.13/7.25 % (34289)Time elapsed: 2.858 s
% 48.13/7.25 % (34289)Peak memory usage: 22 MB
% 48.13/7.25 % (34289)Instructions burned: 5132 (million)
% 48.13/7.25 % (34295)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=3303308623:fmbsr=2.30978:i=2174_2959 on theBenchmark for (2959ds/2174Mi)
% 48.13/7.25 % TRYING [16]
% 48.13/7.25 % (34293)Instruction limit reached!
% 48.13/7.25 % (34293)------------------------------
% 48.13/7.25 % (34293)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34293)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34293)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34293)Termination reason: Instruction limit
% 48.13/7.25 % (34293)Termination phase: Finite model building constraint generation
% 48.13/7.25 % (34293)Time elapsed: 2.181 s
% 48.13/7.25 % (34293)Peak memory usage: 412 MB
% 48.13/7.25 % (34293)Instructions burned: 6326 (million)
% 48.13/7.25 % (34297)ott-2_1_sil=16000:newcnf=on:random_seed=3534091496:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2952 on theBenchmark for (2952ds/869Mi)
% 48.13/7.25 % (34295)Instruction limit reached!
% 48.13/7.25 % (34295)------------------------------
% 48.13/7.25 % (34295)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34295)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34295)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34295)Termination reason: Instruction limit
% 48.13/7.25 % (34295)Termination phase: Finite model building constraint generation
% 48.13/7.25 % (34295)Time elapsed: 0.746 s
% 48.13/7.25 % (34295)Peak memory usage: 140 MB
% 48.13/7.25 % (34295)Instructions burned: 2175 (million)
% 48.13/7.25 % (34299)ott+10_1_sil=32000:tgt=ground:random_seed=4054632142:i=5114:av=off_2951 on theBenchmark for (2951ds/5114Mi)
% 48.13/7.25 % TRYING [9]
% 48.13/7.25 % (34297)Instruction limit reached!
% 48.13/7.25 % (34297)------------------------------
% 48.13/7.25 % (34297)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34297)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34297)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34297)Termination reason: Instruction limit
% 48.13/7.25 % (34297)Termination phase: Saturation
% 48.13/7.25 % (34297)Time elapsed: 0.545 s
% 48.13/7.25 % (34297)Peak memory usage: 17 MB
% 48.13/7.25 % (34297)Instructions burned: 870 (million)
% 48.13/7.25 % (34301)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=2085851877:i=54282_2947 on theBenchmark for (2947ds/54282Mi)
% 48.13/7.25 % TRYING [1]
% 48.13/7.25 % TRYING [2]
% 48.13/7.25 % TRYING [3]
% 48.13/7.25 % TRYING [4]
% 48.13/7.25 % TRYING [5]
% 48.13/7.25 % TRYING [6]
% 48.13/7.25 % TRYING [7]
% 48.13/7.25 % TRYING [8]
% 48.13/7.25 % (34285)Instruction limit reached!
% 48.13/7.25 % (34285)------------------------------
% 48.13/7.25 % (34285)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.25 % (34285)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.25 % (34285)CaDiCaL version: 2.1.3
% 48.13/7.25 % (34285)Termination reason: Instruction limit
% 48.13/7.25 % (34285)Termination phase: Finite model building SAT solving
% 48.13/7.25 % (34285)Time elapsed: 5.634 s
% 48.13/7.25 % (34285)Peak memory usage: 653 MB
% 48.13/7.25 % (34285)Instructions burned: 9516 (million)
% 48.13/7.25 % (34303)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=2921109839:i=3512:aac=none_2932 on theBenchmark for (2932ds/3512Mi)
% 48.13/7.25 % (34299) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-34244-34299"...
% 48.13/7.25 % (34299)...printing done.
% 48.13/7.25 % (34299)Refutation found. Thanks to Tanya!
% 48.13/7.25 % SZS status Theorem for theBenchmark
% 48.13/7.25 % SZS output start Proof for theBenchmark
% See solution above
% 48.13/7.26 % (34299)------------------------------
% 48.13/7.26 % (34299)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.13/7.26 % (34299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.13/7.26 % (34299)CaDiCaL version: 2.1.3
% 48.13/7.26 % (34299)Termination reason: Refutation
% 48.13/7.26 % (34299)Time elapsed: 1.982 s
% 48.13/7.26 % (34299)Peak memory usage: 33 MB
% 48.13/7.26 % (34299)Instructions burned: 3185 (million)
% 48.13/7.26 % (34244)Success in time 6.864 s
% 48.13/7.26 % Vampire exiting
%------------------------------------------------------------------------------