TSTP Solution File: SET619+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET619+3 : TPTP v8.1.2. Released v2.2.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 : n008.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 10:56:43 EDT 2023
% Result : Theorem 19.16s 7.13s
% Output : CNFRefutation 19.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 18
% Syntax : Number of formulae : 34 ( 23 unt; 11 typ; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 9 >; 9 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 44 (; 44 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > union > symmetric_difference > intersection > difference > #nlpp > #skF_3 > #skF_5 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(intersection,type,
intersection: ( $i * $i ) > $i ).
tff(union,type,
union: ( $i * $i ) > $i ).
tff(symmetric_difference,type,
symmetric_difference: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(difference,type,
difference: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_66,axiom,
! [B,C] : ( intersection(B,C) = intersection(C,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
tff(f_39,axiom,
! [B,C] : ( union(intersection(B,C),difference(B,C)) = B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_intersection_difference) ).
tff(f_36,axiom,
! [B,C] : ( union(B,intersection(B,C)) = B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_intersection) ).
tff(f_33,axiom,
! [B,C,D] : ( union(union(B,C),D) = union(B,union(C,D)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_union) ).
tff(f_30,axiom,
! [B,C] : ( symmetric_difference(B,C) = union(difference(B,C),difference(C,B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetric_difference_defn) ).
tff(f_63,axiom,
! [B,C] : ( union(B,C) = union(C,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_union) ).
tff(f_92,negated_conjecture,
~ ! [B,C] : ( union(B,C) = union(symmetric_difference(B,C),intersection(B,C)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th95) ).
tff(c_30,plain,
! [C_21,B_20] : ( intersection(C_21,B_20) = intersection(B_20,C_21) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_214,plain,
! [B_49,C_50] : ( union(intersection(B_49,C_50),difference(B_49,C_50)) = B_49 ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_238,plain,
! [C_21,B_20] : ( union(intersection(C_21,B_20),difference(B_20,C_21)) = B_20 ),
inference(superposition,[status(thm),theory(equality)],[c_30,c_214]) ).
tff(c_6,plain,
! [B_6,C_7] : ( union(B_6,intersection(B_6,C_7)) = B_6 ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_422,plain,
! [B_78,C_79,D_80] : ( union(union(B_78,C_79),D_80) = union(B_78,union(C_79,D_80)) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_622,plain,
! [B_92,C_93,D_94] : ( union(B_92,union(intersection(B_92,C_93),D_94)) = union(B_92,D_94) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_422]) ).
tff(c_659,plain,
! [C_21,B_20] : ( union(C_21,difference(B_20,C_21)) = union(C_21,B_20) ),
inference(superposition,[status(thm),theory(equality)],[c_238,c_622]) ).
tff(c_2,plain,
! [B_1,C_2] : ( union(difference(B_1,C_2),difference(C_2,B_1)) = symmetric_difference(B_1,C_2) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_8,plain,
! [B_8,C_9] : ( union(intersection(B_8,C_9),difference(B_8,C_9)) = B_8 ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_9709,plain,
! [B_274,C_275,D_276] : ( union(intersection(B_274,C_275),union(difference(B_274,C_275),D_276)) = union(B_274,D_276) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_422]) ).
tff(c_9983,plain,
! [B_1,C_2] : ( union(intersection(B_1,C_2),symmetric_difference(B_1,C_2)) = union(B_1,difference(C_2,B_1)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_9709]) ).
tff(c_10049,plain,
! [B_1,C_2] : ( union(intersection(B_1,C_2),symmetric_difference(B_1,C_2)) = union(B_1,C_2) ),
inference(demodulation,[status(thm),theory(equality)],[c_659,c_9983]) ).
tff(c_28,plain,
! [C_19,B_18] : ( union(C_19,B_18) = union(B_18,C_19) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_54,plain,
union(symmetric_difference('#skF_4','#skF_5'),intersection('#skF_4','#skF_5')) != union('#skF_4','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_55,plain,
union(intersection('#skF_4','#skF_5'),symmetric_difference('#skF_4','#skF_5')) != union('#skF_4','#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_28,c_54]) ).
tff(c_38020,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10049,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET619+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.14 % 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.13/0.35 % Computer : n008.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 : Thu Aug 3 16:47:18 EDT 2023
% 0.13/0.35 % CPUTime :
% 19.16/7.13 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 19.16/7.14
% 19.16/7.14 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 19.26/7.16
% 19.26/7.16 Inference rules
% 19.26/7.16 ----------------------
% 19.26/7.16 #Ref : 0
% 19.26/7.16 #Sup : 9913
% 19.26/7.16 #Fact : 6
% 19.26/7.16 #Define : 0
% 19.26/7.16 #Split : 0
% 19.26/7.16 #Chain : 0
% 19.26/7.16 #Close : 0
% 19.26/7.16
% 19.26/7.16 Ordering : KBO
% 19.26/7.16
% 19.26/7.16 Simplification rules
% 19.26/7.16 ----------------------
% 19.26/7.16 #Subsume : 753
% 19.26/7.16 #Demod : 7815
% 19.26/7.16 #Tautology : 3034
% 19.26/7.16 #SimpNegUnit : 0
% 19.26/7.16 #BackRed : 1
% 19.26/7.16
% 19.26/7.16 #Partial instantiations: 0
% 19.26/7.16 #Strategies tried : 1
% 19.26/7.16
% 19.26/7.16 Timing (in seconds)
% 19.26/7.16 ----------------------
% 19.26/7.17 Preprocessing : 0.51
% 19.26/7.17 Parsing : 0.26
% 19.26/7.17 CNF conversion : 0.04
% 19.26/7.17 Main loop : 5.52
% 19.26/7.17 Inferencing : 0.90
% 19.26/7.17 Reduction : 3.14
% 19.26/7.17 Demodulation : 2.84
% 19.26/7.17 BG Simplification : 0.12
% 19.26/7.17 Subsumption : 1.03
% 19.26/7.17 Abstraction : 0.11
% 19.26/7.17 MUC search : 0.00
% 19.26/7.17 Cooper : 0.00
% 19.26/7.17 Total : 6.07
% 19.26/7.17 Index Insertion : 0.00
% 19.26/7.17 Index Deletion : 0.00
% 19.26/7.17 Index Matching : 0.00
% 19.26/7.17 BG Taut test : 0.00
%------------------------------------------------------------------------------