TSTP Solution File: TOP004-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : TOP004-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n031.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 Aug 22 11:18:40 EDT 2023
% Result : Unsatisfiable 3.56s 1.75s
% Output : CNFRefutation 3.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 61
% Syntax : Number of formulae : 64 ( 5 unt; 59 typ; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 144 ( 56 >; 88 *; 0 +; 0 <<)
% Number of predicates : 23 ( 22 usr; 1 prp; 0-4 aty)
% Number of functors : 37 ( 37 usr; 3 con; 0-5 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ separation > neighborhood > limit_point > open_covering > open > finer > connected_set > compact_set > closed > topological_space > subset_sets > subset_collections > hausdorff > equal_sets > eq_p > element_of_set > element_of_collection > disjoint_s > connected_space > compact_space > basis > finite > f6 > f15 > f18 > f17 > f16 > f14 > f13 > f12 > subspace_topology > interior > f23 > f10 > closure > boundary > union_of_sets > relative_complement_sets > intersection_of_sets > f9 > f8 > f7 > f5 > f4 > f3 > f24 > f22 > f21 > f20 > f2 > f19 > f11 > f1 > #nlpp > union_of_members > top_of_basis > intersection_of_members > f > empty_set > cx
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f11,type,
f11: ( $i * $i ) > $i ).
tff(f5,type,
f5: ( $i * $i ) > $i ).
tff(subset_sets,type,
subset_sets: ( $i * $i ) > $o ).
tff(subspace_topology,type,
subspace_topology: ( $i * $i * $i ) > $i ).
tff(f15,type,
f15: ( $i * $i * $i * $i * $i ) > $i ).
tff(basis,type,
basis: ( $i * $i ) > $o ).
tff(f22,type,
f22: ( $i * $i ) > $i ).
tff(f19,type,
f19: ( $i * $i ) > $i ).
tff(limit_point,type,
limit_point: ( $i * $i * $i * $i ) > $o ).
tff(separation,type,
separation: ( $i * $i * $i * $i ) > $o ).
tff(disjoint_s,type,
disjoint_s: ( $i * $i ) > $o ).
tff(element_of_collection,type,
element_of_collection: ( $i * $i ) > $o ).
tff(f23,type,
f23: ( $i * $i * $i ) > $i ).
tff(relative_complement_sets,type,
relative_complement_sets: ( $i * $i ) > $i ).
tff(closure,type,
closure: ( $i * $i * $i ) > $i ).
tff(union_of_members,type,
union_of_members: $i > $i ).
tff(f,type,
f: $i ).
tff(hausdorff,type,
hausdorff: ( $i * $i ) > $o ).
tff(subset_collections,type,
subset_collections: ( $i * $i ) > $o ).
tff(f16,type,
f16: ( $i * $i * $i * $i ) > $i ).
tff(f6,type,
f6: ( $i * $i * $i * $i * $i ) > $i ).
tff(f9,type,
f9: ( $i * $i ) > $i ).
tff(f24,type,
f24: ( $i * $i ) > $i ).
tff(f12,type,
f12: ( $i * $i * $i * $i ) > $i ).
tff(finite,type,
finite: $i > $o ).
tff(connected_space,type,
connected_space: ( $i * $i ) > $o ).
tff(compact_set,type,
compact_set: ( $i * $i * $i ) > $o ).
tff(interior,type,
interior: ( $i * $i * $i ) > $i ).
tff(element_of_set,type,
element_of_set: ( $i * $i ) > $o ).
tff(union_of_sets,type,
union_of_sets: ( $i * $i ) > $i ).
tff(f17,type,
f17: ( $i * $i * $i * $i ) > $i ).
tff(neighborhood,type,
neighborhood: ( $i * $i * $i * $i ) > $o ).
tff(f7,type,
f7: ( $i * $i ) > $i ).
tff(eq_p,type,
eq_p: ( $i * $i ) > $o ).
tff(open,type,
open: ( $i * $i * $i ) > $o ).
tff(topological_space,type,
topological_space: ( $i * $i ) > $o ).
tff(f18,type,
f18: ( $i * $i * $i * $i ) > $i ).
tff(cx,type,
cx: $i ).
tff(top_of_basis,type,
top_of_basis: $i > $i ).
tff(intersection_of_sets,type,
intersection_of_sets: ( $i * $i ) > $i ).
tff(f8,type,
f8: ( $i * $i ) > $i ).
tff(empty_set,type,
empty_set: $i ).
tff(f14,type,
f14: ( $i * $i * $i * $i ) > $i ).
tff(equal_sets,type,
equal_sets: ( $i * $i ) > $o ).
tff(f4,type,
f4: ( $i * $i ) > $i ).
tff(intersection_of_members,type,
intersection_of_members: $i > $i ).
tff(boundary,type,
boundary: ( $i * $i * $i ) > $i ).
tff(open_covering,type,
open_covering: ( $i * $i * $i ) > $o ).
tff(finer,type,
finer: ( $i * $i * $i ) > $o ).
tff(f2,type,
f2: ( $i * $i ) > $i ).
tff(compact_space,type,
compact_space: ( $i * $i ) > $o ).
tff(f3,type,
f3: ( $i * $i ) > $i ).
tff(f10,type,
f10: ( $i * $i * $i ) > $i ).
tff(f21,type,
f21: ( $i * $i ) > $i ).
tff(f13,type,
f13: ( $i * $i * $i * $i ) > $i ).
tff(closed,type,
closed: ( $i * $i * $i ) > $o ).
tff(connected_set,type,
connected_set: ( $i * $i * $i ) > $o ).
tff(f20,type,
f20: ( $i * $i ) > $i ).
tff(f1,type,
f1: ( $i * $i ) > $i ).
tff(f_951,axiom,
! [V] : element_of_collection(V,top_of_basis(f)),
file(unknown,unknown) ).
tff(f_954,axiom,
! [U,V] : ~ element_of_collection(intersection_of_sets(U,V),top_of_basis(f)),
file(unknown,unknown) ).
tff(c_224,plain,
! [V_359] : element_of_collection(V_359,top_of_basis(f)),
inference(cnfTransformation,[status(thm)],[f_951]) ).
tff(c_226,plain,
! [U_360,V_361] : ~ element_of_collection(intersection_of_sets(U_360,V_361),top_of_basis(f)),
inference(cnfTransformation,[status(thm)],[f_954]) ).
tff(c_228,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_224,c_226]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : TOP004-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.15 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.36 % Computer : n031.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 18:11:59 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.56/1.75 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.56/1.75
% 3.56/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.77/1.79
% 3.77/1.79 Inference rules
% 3.77/1.79 ----------------------
% 3.77/1.79 #Ref : 0
% 3.77/1.79 #Sup : 0
% 3.77/1.79 #Fact : 0
% 3.77/1.79 #Define : 0
% 3.77/1.79 #Split : 0
% 3.77/1.79 #Chain : 0
% 3.77/1.79 #Close : 0
% 3.77/1.79
% 3.77/1.79 Ordering : KBO
% 3.77/1.79
% 3.77/1.79 Simplification rules
% 3.77/1.79 ----------------------
% 3.77/1.79 #Subsume : 112
% 3.77/1.79 #Demod : 1
% 3.77/1.79 #Tautology : 0
% 3.77/1.79 #SimpNegUnit : 0
% 3.77/1.79 #BackRed : 0
% 3.77/1.79
% 3.77/1.79 #Partial instantiations: 0
% 3.77/1.79 #Strategies tried : 1
% 3.77/1.79
% 3.77/1.79 Timing (in seconds)
% 3.77/1.79 ----------------------
% 3.77/1.80 Preprocessing : 0.72
% 3.77/1.80 Parsing : 0.41
% 3.77/1.80 CNF conversion : 0.05
% 3.77/1.80 Main loop : 0.06
% 3.77/1.80 Inferencing : 0.00
% 3.77/1.80 Reduction : 0.03
% 3.77/1.80 Demodulation : 0.02
% 3.77/1.80 BG Simplification : 0.04
% 3.77/1.80 Subsumption : 0.03
% 3.77/1.80 Abstraction : 0.01
% 3.77/1.80 MUC search : 0.00
% 3.77/1.80 Cooper : 0.00
% 3.77/1.80 Total : 0.84
% 3.77/1.80 Index Insertion : 0.00
% 3.77/1.80 Index Deletion : 0.00
% 3.77/1.80 Index Matching : 0.00
% 3.77/1.80 BG Taut test : 0.00
%------------------------------------------------------------------------------