TSTP Solution File: SET173+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET173+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/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 : n014.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:08 EDT 2023
% Result : Theorem 7.00s 2.77s
% Output : CNFRefutation 7.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 41 ( 13 unt; 9 typ; 0 def)
% Number of atoms : 61 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 49 ( 20 ~; 22 |; 2 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 7 >; 7 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 71 (; 71 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > union > intersection > #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('#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('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_50,axiom,
! [B,C] : ( union(B,C) = union(C,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_union) ).
tff(f_61,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
tff(f_33,axiom,
! [B,C,D] :
( member(D,union(B,C))
<=> ( member(D,B)
| member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
tff(f_53,axiom,
! [B,C] : ( intersection(B,C) = intersection(C,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).
tff(f_40,axiom,
! [B,C,D] :
( member(D,intersection(B,C))
<=> ( member(D,B)
& member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
tff(f_47,axiom,
! [B,C] :
( ( B = C )
<=> ( subset(B,C)
& subset(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
tff(f_76,negated_conjecture,
~ ! [B,C] : ( intersection(B,union(B,C)) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_absorbtion_for_intersection) ).
tff(c_20,plain,
! [C_10,B_9] : ( union(C_10,B_9) = union(B_9,C_10) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_28,plain,
! [B_13,C_14] :
( member('#skF_1'(B_13,C_14),B_13)
| subset(B_13,C_14) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_165,plain,
! [D_44,C_45,B_46] :
( ~ member(D_44,C_45)
| member(D_44,union(B_46,C_45)) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_26,plain,
! [B_13,C_14] :
( ~ member('#skF_1'(B_13,C_14),C_14)
| subset(B_13,C_14) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_410,plain,
! [B_78,B_79,C_80] :
( subset(B_78,union(B_79,C_80))
| ~ member('#skF_1'(B_78,union(B_79,C_80)),C_80) ),
inference(resolution,[status(thm)],[c_165,c_26]) ).
tff(c_442,plain,
! [B_81,B_82] : subset(B_81,union(B_82,B_81)),
inference(resolution,[status(thm)],[c_28,c_410]) ).
tff(c_453,plain,
! [C_10,B_9] : subset(C_10,union(C_10,B_9)),
inference(superposition,[status(thm),theory(equality)],[c_20,c_442]) ).
tff(c_22,plain,
! [C_12,B_11] : ( intersection(C_12,B_11) = intersection(B_11,C_12) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_134,plain,
! [D_37,B_38,C_39] :
( member(D_37,B_38)
| ~ member(D_37,intersection(B_38,C_39)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_517,plain,
! [B_91,C_92,C_93] :
( member('#skF_1'(intersection(B_91,C_92),C_93),B_91)
| subset(intersection(B_91,C_92),C_93) ),
inference(resolution,[status(thm)],[c_28,c_134]) ).
tff(c_557,plain,
! [B_94,C_95] : subset(intersection(B_94,C_95),B_94),
inference(resolution,[status(thm)],[c_517,c_26]) ).
tff(c_562,plain,
! [C_12,B_11] : subset(intersection(C_12,B_11),B_11),
inference(superposition,[status(thm),theory(equality)],[c_22,c_557]) ).
tff(c_177,plain,
! [D_47,C_48,B_49] :
( member(D_47,C_48)
| ~ member(D_47,B_49)
| ~ subset(B_49,C_48) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_185,plain,
! [B_13,C_14,C_48] :
( member('#skF_1'(B_13,C_14),C_48)
| ~ subset(B_13,C_48)
| subset(B_13,C_14) ),
inference(resolution,[status(thm)],[c_28,c_177]) ).
tff(c_187,plain,
! [D_50,B_51,C_52] :
( member(D_50,intersection(B_51,C_52))
| ~ member(D_50,C_52)
| ~ member(D_50,B_51) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_3752,plain,
! [B_337,B_338,C_339] :
( subset(B_337,intersection(B_338,C_339))
| ~ member('#skF_1'(B_337,intersection(B_338,C_339)),C_339)
| ~ member('#skF_1'(B_337,intersection(B_338,C_339)),B_338) ),
inference(resolution,[status(thm)],[c_187,c_26]) ).
tff(c_3849,plain,
! [B_340,B_341] :
( ~ member('#skF_1'(B_340,intersection(B_341,B_340)),B_341)
| subset(B_340,intersection(B_341,B_340)) ),
inference(resolution,[status(thm)],[c_28,c_3752]) ).
tff(c_4365,plain,
! [B_346,C_347] :
( ~ subset(B_346,C_347)
| subset(B_346,intersection(C_347,B_346)) ),
inference(resolution,[status(thm)],[c_185,c_3849]) ).
tff(c_14,plain,
! [C_8,B_7] :
( ( C_8 = B_7 )
| ~ subset(C_8,B_7)
| ~ subset(B_7,C_8) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_4439,plain,
! [C_347,B_346] :
( ( intersection(C_347,B_346) = B_346 )
| ~ subset(intersection(C_347,B_346),B_346)
| ~ subset(B_346,C_347) ),
inference(resolution,[status(thm)],[c_4365,c_14]) ).
tff(c_4657,plain,
! [C_351,B_352] :
( ( intersection(C_351,B_352) = B_352 )
| ~ subset(B_352,C_351) ),
inference(demodulation,[status(thm),theory(equality)],[c_562,c_4439]) ).
tff(c_4708,plain,
! [C_353,B_354] : ( intersection(union(C_353,B_354),C_353) = C_353 ),
inference(resolution,[status(thm)],[c_453,c_4657]) ).
tff(c_4854,plain,
! [C_353,B_354] : ( intersection(C_353,union(C_353,B_354)) = C_353 ),
inference(superposition,[status(thm),theory(equality)],[c_4708,c_22]) ).
tff(c_44,plain,
intersection('#skF_4',union('#skF_4','#skF_5')) != '#skF_4',
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_5122,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4854,c_44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET173+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % 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.13/0.35 % Computer : n014.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:59:03 EDT 2023
% 0.13/0.35 % CPUTime :
% 7.00/2.77 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.00/2.77
% 7.00/2.77 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.39/2.80
% 7.39/2.80 Inference rules
% 7.39/2.80 ----------------------
% 7.39/2.80 #Ref : 0
% 7.39/2.80 #Sup : 1259
% 7.39/2.80 #Fact : 2
% 7.39/2.80 #Define : 0
% 7.39/2.80 #Split : 0
% 7.39/2.80 #Chain : 0
% 7.39/2.80 #Close : 0
% 7.39/2.80
% 7.39/2.80 Ordering : KBO
% 7.39/2.80
% 7.39/2.80 Simplification rules
% 7.39/2.80 ----------------------
% 7.39/2.80 #Subsume : 261
% 7.39/2.80 #Demod : 224
% 7.39/2.80 #Tautology : 138
% 7.39/2.80 #SimpNegUnit : 0
% 7.39/2.80 #BackRed : 2
% 7.39/2.80
% 7.39/2.80 #Partial instantiations: 0
% 7.39/2.80 #Strategies tried : 1
% 7.39/2.80
% 7.39/2.80 Timing (in seconds)
% 7.39/2.80 ----------------------
% 7.39/2.81 Preprocessing : 0.47
% 7.39/2.81 Parsing : 0.25
% 7.39/2.81 CNF conversion : 0.04
% 7.39/2.81 Main loop : 1.28
% 7.39/2.81 Inferencing : 0.40
% 7.39/2.81 Reduction : 0.38
% 7.39/2.81 Demodulation : 0.30
% 7.39/2.81 BG Simplification : 0.04
% 7.39/2.81 Subsumption : 0.35
% 7.39/2.81 Abstraction : 0.04
% 7.39/2.81 MUC search : 0.00
% 7.39/2.81 Cooper : 0.00
% 7.39/2.81 Total : 1.80
% 7.39/2.81 Index Insertion : 0.00
% 7.39/2.81 Index Deletion : 0.00
% 7.39/2.81 Index Matching : 0.00
% 7.39/2.81 BG Taut test : 0.00
%------------------------------------------------------------------------------