TSTP Solution File: TOP004-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : TOP004-2 : 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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n018.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 2.23s 1.60s
% Output : CNFRefutation 2.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 15
% Syntax : Number of formulae : 18 ( 5 unt; 13 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 : 24 ( 11 >; 13 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-5 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset_sets > equal_sets > element_of_set > element_of_collection > basis > f6 > f10 > intersection_of_sets > f11 > #nlpp > union_of_members > top_of_basis > f > cx
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f11,type,
f11: ( $i * $i ) > $i ).
tff(subset_sets,type,
subset_sets: ( $i * $i ) > $o ).
tff(basis,type,
basis: ( $i * $i ) > $o ).
tff(element_of_collection,type,
element_of_collection: ( $i * $i ) > $o ).
tff(union_of_members,type,
union_of_members: $i > $i ).
tff(f,type,
f: $i ).
tff(f6,type,
f6: ( $i * $i * $i * $i * $i ) > $i ).
tff(element_of_set,type,
element_of_set: ( $i * $i ) > $o ).
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(equal_sets,type,
equal_sets: ( $i * $i ) > $o ).
tff(f10,type,
f10: ( $i * $i * $i ) > $i ).
tff(f_181,axiom,
! [V] : element_of_collection(V,top_of_basis(f)),
file(unknown,unknown) ).
tff(f_184,axiom,
! [U,V] : ~ element_of_collection(intersection_of_sets(U,V),top_of_basis(f)),
file(unknown,unknown) ).
tff(c_40,plain,
! [V_57] : element_of_collection(V_57,top_of_basis(f)),
inference(cnfTransformation,[status(thm)],[f_181]) ).
tff(c_42,plain,
! [U_58,V_59] : ~ element_of_collection(intersection_of_sets(U_58,V_59),top_of_basis(f)),
inference(cnfTransformation,[status(thm)],[f_184]) ).
tff(c_44,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_40,c_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15 % Problem : TOP004-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.16 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.19/0.37 % Computer : n018.cluster.edu
% 0.19/0.37 % Model : x86_64 x86_64
% 0.19/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.37 % Memory : 8042.1875MB
% 0.19/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.37 % CPULimit : 300
% 0.19/0.37 % WCLimit : 300
% 0.19/0.37 % DateTime : Thu Aug 3 17:50:50 EDT 2023
% 0.19/0.38 % CPUTime :
% 2.23/1.60 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.23/1.60
% 2.23/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.91/1.64
% 2.91/1.64 Inference rules
% 2.91/1.64 ----------------------
% 2.91/1.64 #Ref : 0
% 2.91/1.64 #Sup : 0
% 2.91/1.64 #Fact : 0
% 2.91/1.64 #Define : 0
% 2.91/1.64 #Split : 0
% 2.91/1.64 #Chain : 0
% 2.91/1.64 #Close : 0
% 2.91/1.64
% 2.91/1.64 Ordering : KBO
% 2.91/1.64
% 2.91/1.64 Simplification rules
% 2.91/1.64 ----------------------
% 2.91/1.64 #Subsume : 20
% 2.91/1.64 #Demod : 1
% 2.91/1.64 #Tautology : 0
% 2.91/1.64 #SimpNegUnit : 0
% 2.91/1.64 #BackRed : 0
% 2.91/1.64
% 2.91/1.64 #Partial instantiations: 0
% 2.91/1.64 #Strategies tried : 1
% 2.91/1.64
% 2.91/1.64 Timing (in seconds)
% 2.91/1.64 ----------------------
% 2.91/1.64 Preprocessing : 0.49
% 2.91/1.64 Parsing : 0.27
% 2.91/1.64 CNF conversion : 0.03
% 2.91/1.64 Main loop : 0.05
% 2.91/1.64 Inferencing : 0.00
% 2.91/1.64 Reduction : 0.02
% 2.91/1.64 Demodulation : 0.02
% 2.91/1.64 BG Simplification : 0.02
% 2.91/1.64 Subsumption : 0.02
% 2.91/1.64 Abstraction : 0.01
% 2.91/1.64 MUC search : 0.00
% 2.91/1.64 Cooper : 0.00
% 2.91/1.64 Total : 0.59
% 2.91/1.64 Index Insertion : 0.00
% 2.91/1.64 Index Deletion : 0.00
% 2.91/1.64 Index Matching : 0.00
% 2.91/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------