TSTP Solution File: TOP011-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : TOP011-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n015.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 : 300s
% DateTime : Tue Apr 30 18:25:15 EDT 2024
% Result : Satisfiable 0.13s 0.38s
% Output : FiniteModel 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : TOP011-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Apr 30 02:23:17 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % (30413)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.38 % (30419)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.13/0.38 % (30415)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.38 % (30418)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.13/0.38 % (30420)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.13/0.38 % (30417)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.13/0.38 % (30416)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.13/0.38 % (30414)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.13/0.38 TRYING [1]
% 0.13/0.38 Finite Model Found!
% 0.13/0.38 % SZS status Satisfiable for theBenchmark
% 0.13/0.38 % (30420)First to succeed.
% 0.13/0.39 TRYING [1,1,1,1,1,1,1,1,1,1,1]
% 0.20/0.39 % SZS output start FiniteModel for theBenchmark
% 0.20/0.39 tff(declare_$i,type,$i:$tType).
% 0.20/0.39 tff(declare_$i1,type,empty_set:$i).
% 0.20/0.39 tff(finite_domain,axiom,
% 0.20/0.39 ! [X:$i] : (
% 0.20/0.39 X = empty_set
% 0.20/0.39 ) ).
% 0.20/0.39
% 0.20/0.39 tff(declare_bool,type,$o:$tType).
% 0.20/0.39 tff(declare_bool1,type,fmb_bool_1:$o).
% 0.20/0.39 tff(finite_domain,axiom,
% 0.20/0.39 ! [X:$o] : (
% 0.20/0.39 X = fmb_bool_1
% 0.20/0.39 ) ).
% 0.20/0.39
% 0.20/0.39 tff(declare_cu,type,cu:$i).
% 0.20/0.39 tff(cu_definition,axiom,cu = empty_set).
% 0.20/0.39 tff(declare_f,type,f:$i).
% 0.20/0.39 tff(f_definition,axiom,f = empty_set).
% 0.20/0.39 tff(declare_g,type,g:$i).
% 0.20/0.39 tff(g_definition,axiom,g = empty_set).
% 0.20/0.39 tff(declare_union_of_members,type,union_of_members: $i > $i).
% 0.20/0.39 tff(function_union_of_members,axiom,
% 0.20/0.39 union_of_members(empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f1,type,f1: $i * $i > $i).
% 0.20/0.39 tff(function_f1,axiom,
% 0.20/0.39 f1(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_intersection_of_members,type,intersection_of_members: $i > $i).
% 0.20/0.39 tff(function_intersection_of_members,axiom,
% 0.20/0.39 intersection_of_members(empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f2,type,f2: $i * $i > $i).
% 0.20/0.39 tff(function_f2,axiom,
% 0.20/0.39 f2(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_intersection_of_sets,type,intersection_of_sets: $i * $i > $i).
% 0.20/0.39 tff(function_intersection_of_sets,axiom,
% 0.20/0.39 intersection_of_sets(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f3,type,f3: $i * $i > $i).
% 0.20/0.39 tff(function_f3,axiom,
% 0.20/0.39 f3(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f5,type,f5: $i * $i > $i).
% 0.20/0.39 tff(function_f5,axiom,
% 0.20/0.39 f5(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f4,type,f4: $i * $i > $i).
% 0.20/0.39 tff(function_f4,axiom,
% 0.20/0.39 f4(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_relative_complement_sets,type,relative_complement_sets: $i * $i > $i).
% 0.20/0.39 tff(function_relative_complement_sets,axiom,
% 0.20/0.39 relative_complement_sets(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f6,type,f6: $i * $i * $i * $i * $i > $i).
% 0.20/0.39 tff(function_f6,axiom,
% 0.20/0.39 f6(empty_set,empty_set,empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f7,type,f7: $i * $i > $i).
% 0.20/0.39 tff(function_f7,axiom,
% 0.20/0.39 f7(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f8,type,f8: $i * $i > $i).
% 0.20/0.39 tff(function_f8,axiom,
% 0.20/0.39 f8(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f9,type,f9: $i * $i > $i).
% 0.20/0.39 tff(function_f9,axiom,
% 0.20/0.39 f9(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_top_of_basis,type,top_of_basis: $i > $i).
% 0.20/0.39 tff(function_top_of_basis,axiom,
% 0.20/0.39 top_of_basis(empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f10,type,f10: $i * $i * $i > $i).
% 0.20/0.39 tff(function_f10,axiom,
% 0.20/0.39 f10(empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f11,type,f11: $i * $i > $i).
% 0.20/0.39 tff(function_f11,axiom,
% 0.20/0.39 f11(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_subspace_topology,type,subspace_topology: $i * $i * $i > $i).
% 0.20/0.39 tff(function_subspace_topology,axiom,
% 0.20/0.39 subspace_topology(empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f12,type,f12: $i * $i * $i * $i > $i).
% 0.20/0.39 tff(function_f12,axiom,
% 0.20/0.39 f12(empty_set,empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_interior,type,interior: $i * $i * $i > $i).
% 0.20/0.39 tff(function_interior,axiom,
% 0.20/0.39 interior(empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f13,type,f13: $i * $i * $i * $i > $i).
% 0.20/0.39 tff(function_f13,axiom,
% 0.20/0.39 f13(empty_set,empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_closure,type,closure: $i * $i * $i > $i).
% 0.20/0.39 tff(function_closure,axiom,
% 0.20/0.39 closure(empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f14,type,f14: $i * $i * $i * $i > $i).
% 0.20/0.39 tff(function_f14,axiom,
% 0.20/0.39 f14(empty_set,empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f15,type,f15: $i * $i * $i * $i * $i > $i).
% 0.20/0.39 tff(function_f15,axiom,
% 0.20/0.39 f15(empty_set,empty_set,empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f16,type,f16: $i * $i * $i * $i > $i).
% 0.20/0.39 tff(function_f16,axiom,
% 0.20/0.39 f16(empty_set,empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_boundary,type,boundary: $i * $i * $i > $i).
% 0.20/0.39 tff(function_boundary,axiom,
% 0.20/0.39 boundary(empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f17,type,f17: $i * $i * $i * $i > $i).
% 0.20/0.39 tff(function_f17,axiom,
% 0.20/0.39 f17(empty_set,empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f18,type,f18: $i * $i * $i * $i > $i).
% 0.20/0.39 tff(function_f18,axiom,
% 0.20/0.39 f18(empty_set,empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f19,type,f19: $i * $i > $i).
% 0.20/0.39 tff(function_f19,axiom,
% 0.20/0.39 f19(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f20,type,f20: $i * $i > $i).
% 0.20/0.39 tff(function_f20,axiom,
% 0.20/0.39 f20(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_union_of_sets,type,union_of_sets: $i * $i > $i).
% 0.20/0.39 tff(function_union_of_sets,axiom,
% 0.20/0.39 union_of_sets(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f21,type,f21: $i * $i > $i).
% 0.20/0.39 tff(function_f21,axiom,
% 0.20/0.39 f21(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f22,type,f22: $i * $i > $i).
% 0.20/0.39 tff(function_f22,axiom,
% 0.20/0.39 f22(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f23,type,f23: $i * $i * $i > $i).
% 0.20/0.39 tff(function_f23,axiom,
% 0.20/0.39 f23(empty_set,empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_f24,type,f24: $i * $i > $i).
% 0.20/0.39 tff(function_f24,axiom,
% 0.20/0.39 f24(empty_set,empty_set) = empty_set
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_element_of_set,type,element_of_set: $i * $i > $o ).
% 0.20/0.39 tff(predicate_element_of_set,axiom,
% 0.20/0.39 element_of_set(empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_element_of_collection,type,element_of_collection: $i * $i > $o ).
% 0.20/0.39 tff(predicate_element_of_collection,axiom,
% 0.20/0.39 element_of_collection(empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_topological_space,type,topological_space: $i * $i > $o ).
% 0.20/0.39 tff(predicate_topological_space,axiom,
% 0.20/0.39 topological_space(empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_equal_sets,type,equal_sets: $i * $i > $o ).
% 0.20/0.39 tff(predicate_equal_sets,axiom,
% 0.20/0.39 equal_sets(empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_subset_collections,type,subset_collections: $i * $i > $o ).
% 0.20/0.39 tff(predicate_subset_collections,axiom,
% 0.20/0.39 ~subset_collections(empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_open,type,open: $i * $i * $i > $o ).
% 0.20/0.39 tff(predicate_open,axiom,
% 0.20/0.39 open(empty_set,empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_closed,type,closed: $i * $i * $i > $o ).
% 0.20/0.39 tff(predicate_closed,axiom,
% 0.20/0.39 ~closed(empty_set,empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_finer,type,finer: $i * $i * $i > $o ).
% 0.20/0.39 tff(predicate_finer,axiom,
% 0.20/0.39 finer(empty_set,empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_basis,type,basis: $i * $i > $o ).
% 0.20/0.39 tff(predicate_basis,axiom,
% 0.20/0.39 ~basis(empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_subset_sets,type,subset_sets: $i * $i > $o ).
% 0.20/0.39 tff(predicate_subset_sets,axiom,
% 0.20/0.39 ~subset_sets(empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_neighborhood,type,neighborhood: $i * $i * $i * $i > $o ).
% 0.20/0.39 tff(predicate_neighborhood,axiom,
% 0.20/0.39 ~neighborhood(empty_set,empty_set,empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_limit_point,type,limit_point: $i * $i * $i * $i > $o ).
% 0.20/0.39 tff(predicate_limit_point,axiom,
% 0.20/0.39 ~limit_point(empty_set,empty_set,empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_eq_p,type,eq_p: $i * $i > $o ).
% 0.20/0.39 tff(predicate_eq_p,axiom,
% 0.20/0.39 ~eq_p(empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_hausdorff,type,hausdorff: $i * $i > $o ).
% 0.20/0.39 tff(predicate_hausdorff,axiom,
% 0.20/0.39 hausdorff(empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_disjoint_s,type,disjoint_s: $i * $i > $o ).
% 0.20/0.39 tff(predicate_disjoint_s,axiom,
% 0.20/0.39 ~disjoint_s(empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_separation,type,separation: $i * $i * $i * $i > $o ).
% 0.20/0.39 tff(predicate_separation,axiom,
% 0.20/0.39 ~separation(empty_set,empty_set,empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_connected_space,type,connected_space: $i * $i > $o ).
% 0.20/0.39 tff(predicate_connected_space,axiom,
% 0.20/0.39 connected_space(empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_connected_set,type,connected_set: $i * $i * $i > $o ).
% 0.20/0.39 tff(predicate_connected_set,axiom,
% 0.20/0.39 connected_set(empty_set,empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_open_covering,type,open_covering: $i * $i * $i > $o ).
% 0.20/0.39 tff(predicate_open_covering,axiom,
% 0.20/0.39 ~open_covering(empty_set,empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_compact_space,type,compact_space: $i * $i > $o ).
% 0.20/0.39 tff(predicate_compact_space,axiom,
% 0.20/0.39 ~compact_space(empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_finite,type,finite: $i > $o ).
% 0.20/0.39 tff(predicate_finite,axiom,
% 0.20/0.39 ~finite(empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 tff(declare_compact_set,type,compact_set: $i * $i * $i > $o ).
% 0.20/0.39 tff(predicate_compact_set,axiom,
% 0.20/0.39 ~compact_set(empty_set,empty_set,empty_set)
% 0.20/0.39
% 0.20/0.39 ).
% 0.20/0.39
% 0.20/0.39 % SZS output end FiniteModel for theBenchmark
% 0.20/0.39 % (30420)------------------------------
% 0.20/0.39 % (30420)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.20/0.39 % (30420)Termination reason: Satisfiable
% 0.20/0.39
% 0.20/0.39 % (30420)Memory used [KB]: 1098
% 0.20/0.39 % (30420)Time elapsed: 0.009 s
% 0.20/0.39 % (30420)Instructions burned: 17 (million)
% 0.20/0.39 % (30420)------------------------------
% 0.20/0.39 % (30420)------------------------------
% 0.20/0.39 % (30413)Success in time 0.027 s
%------------------------------------------------------------------------------