TSTP Solution File: SET175+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET175+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 : n011.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 138.92s 113.86s
% Output : CNFRefutation 138.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 43 ( 10 unt; 9 typ; 0 def)
% Number of atoms : 74 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 65 ( 25 ~; 33 |; 2 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 80 (; 80 !; 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_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_64,axiom,
! [B] : subset(B,B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_of_subset) ).
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_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] : ( union(B,intersection(B,C)) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_absorbtion_for_union) ).
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_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_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_554,plain,
! [B_91,C_92] : subset(intersection(B_91,C_92),B_91),
inference(resolution,[status(thm)],[c_517,c_26]) ).
tff(c_30,plain,
! [B_18] : subset(B_18,B_18),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_210,plain,
! [D_53,C_54,B_55] :
( member(D_53,C_54)
| member(D_53,B_55)
| ~ member(D_53,union(B_55,C_54)) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_4494,plain,
! [B_348,C_349,C_350] :
( member('#skF_1'(union(B_348,C_349),C_350),C_349)
| member('#skF_1'(union(B_348,C_349),C_350),B_348)
| subset(union(B_348,C_349),C_350) ),
inference(resolution,[status(thm)],[c_28,c_210]) ).
tff(c_24,plain,
! [D_17,C_14,B_13] :
( member(D_17,C_14)
| ~ member(D_17,B_13)
| ~ subset(B_13,C_14) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_4635,plain,
! [B_348,C_349,C_350,C_14] :
( member('#skF_1'(union(B_348,C_349),C_350),C_14)
| ~ subset(C_349,C_14)
| member('#skF_1'(union(B_348,C_349),C_350),B_348)
| subset(union(B_348,C_349),C_350) ),
inference(resolution,[status(thm)],[c_4494,c_24]) ).
tff(c_459496,plain,
! [C_2680,C_2681,C_2682] :
( ~ subset(C_2680,C_2681)
| subset(union(C_2681,C_2680),C_2682)
| member('#skF_1'(union(C_2681,C_2680),C_2682),C_2681) ),
inference(factorization,[status(thm),theory(equality)],[c_4635]) ).
tff(c_459731,plain,
! [C_2683,C_2684] :
( ~ subset(C_2683,C_2684)
| subset(union(C_2684,C_2683),C_2684) ),
inference(resolution,[status(thm)],[c_459496,c_26]) ).
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_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_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_481,plain,
! [B_85,C_86,B_87] :
( ~ subset(B_85,C_86)
| subset(B_85,union(B_87,C_86)) ),
inference(resolution,[status(thm)],[c_185,c_410]) ).
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_1462,plain,
! [B_172,C_173,B_174] :
( ( union(B_172,C_173) = B_174 )
| ~ subset(union(B_172,C_173),B_174)
| ~ subset(B_174,C_173) ),
inference(resolution,[status(thm)],[c_481,c_14]) ).
tff(c_1481,plain,
! [B_9,C_10,B_174] :
( ( union(B_9,C_10) = B_174 )
| ~ subset(union(C_10,B_9),B_174)
| ~ subset(B_174,C_10) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_1462]) ).
tff(c_459950,plain,
! [C_2683,C_2684] :
( ( union(C_2683,C_2684) = C_2684 )
| ~ subset(C_2684,C_2684)
| ~ subset(C_2683,C_2684) ),
inference(resolution,[status(thm)],[c_459731,c_1481]) ).
tff(c_460149,plain,
! [C_2685,C_2686] :
( ( union(C_2685,C_2686) = C_2686 )
| ~ subset(C_2685,C_2686) ),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_459950]) ).
tff(c_468414,plain,
! [B_2691,C_2692] : ( union(intersection(B_2691,C_2692),B_2691) = B_2691 ),
inference(resolution,[status(thm)],[c_554,c_460149]) ).
tff(c_471308,plain,
! [B_9,C_2692] : ( union(B_9,intersection(B_9,C_2692)) = B_9 ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_468414]) ).
tff(c_44,plain,
union('#skF_4',intersection('#skF_4','#skF_5')) != '#skF_4',
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_472698,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_471308,c_44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET175+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 : n011.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:32:21 EDT 2023
% 0.13/0.35 % CPUTime :
% 138.92/113.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 138.92/113.86
% 138.92/113.86 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 138.92/113.90
% 138.92/113.90 Inference rules
% 138.92/113.90 ----------------------
% 138.92/113.90 #Ref : 0
% 138.92/113.90 #Sup : 123522
% 138.92/113.90 #Fact : 126
% 138.92/113.90 #Define : 0
% 138.92/113.90 #Split : 0
% 138.92/113.90 #Chain : 0
% 138.92/113.90 #Close : 0
% 138.92/113.90
% 138.92/113.90 Ordering : KBO
% 138.92/113.90
% 138.92/113.90 Simplification rules
% 138.92/113.90 ----------------------
% 138.92/113.90 #Subsume : 18587
% 138.92/113.90 #Demod : 108109
% 138.92/113.90 #Tautology : 43467
% 138.92/113.90 #SimpNegUnit : 0
% 138.92/113.90 #BackRed : 4
% 138.92/113.90
% 138.92/113.90 #Partial instantiations: 0
% 138.92/113.90 #Strategies tried : 1
% 138.92/113.90
% 138.92/113.90 Timing (in seconds)
% 138.92/113.90 ----------------------
% 138.92/113.90 Preprocessing : 0.47
% 138.92/113.90 Parsing : 0.24
% 138.92/113.90 CNF conversion : 0.04
% 138.92/113.90 Main loop : 112.36
% 138.92/113.90 Inferencing : 6.60
% 138.92/113.90 Reduction : 58.78
% 138.92/113.90 Demodulation : 54.93
% 138.92/113.90 BG Simplification : 0.65
% 138.92/113.90 Subsumption : 37.39
% 138.92/113.90 Abstraction : 0.97
% 138.92/113.90 MUC search : 0.00
% 138.92/113.90 Cooper : 0.00
% 138.92/113.90 Total : 112.89
% 139.11/113.90 Index Insertion : 0.00
% 139.11/113.90 Index Deletion : 0.00
% 139.11/113.90 Index Matching : 0.00
% 139.11/113.90 BG Taut test : 0.00
%------------------------------------------------------------------------------