TSTP Solution File: SET183+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET183+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 : n012.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:09 EDT 2023
% Result : Theorem 5.74s 2.50s
% Output : CNFRefutation 6.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 43 ( 13 unt; 8 typ; 0 def)
% Number of atoms : 70 ( 15 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 61 ( 26 ~; 28 |; 2 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 6 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 63 (; 63 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > 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('#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_71,negated_conjecture,
~ ! [B,C] :
( subset(B,C)
=> ( intersection(B,C) = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subset_intersection) ).
tff(f_57,axiom,
! [B] : subset(B,B),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_subset) ).
tff(f_44,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
tff(f_33,axiom,
! [B,C,D] :
( member(D,intersection(B,C))
<=> ( member(D,B)
& member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
tff(f_54,axiom,
! [B,C] : ( intersection(B,C) = intersection(C,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
tff(f_36,axiom,
! [B,C] : subset(intersection(B,C),B),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_is_subset) ).
tff(f_51,axiom,
! [B,C] :
( ( B = C )
<=> ( subset(B,C)
& subset(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
tff(c_38,plain,
intersection('#skF_4','#skF_5') != '#skF_4',
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_24,plain,
! [B_15] : subset(B_15,B_15),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_40,plain,
subset('#skF_4','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_14,plain,
! [B_6,C_7] :
( member('#skF_1'(B_6,C_7),B_6)
| subset(B_6,C_7) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_143,plain,
! [D_40,C_41,B_42] :
( member(D_40,C_41)
| ~ member(D_40,B_42)
| ~ subset(B_42,C_41) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_198,plain,
! [B_54,C_55,C_56] :
( member('#skF_1'(B_54,C_55),C_56)
| ~ subset(B_54,C_56)
| subset(B_54,C_55) ),
inference(resolution,[status(thm)],[c_14,c_143]) ).
tff(c_10,plain,
! [D_10,C_7,B_6] :
( member(D_10,C_7)
| ~ member(D_10,B_6)
| ~ subset(B_6,C_7) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_435,plain,
! [B_89,C_90,C_91,C_92] :
( member('#skF_1'(B_89,C_90),C_91)
| ~ subset(C_92,C_91)
| ~ subset(B_89,C_92)
| subset(B_89,C_90) ),
inference(resolution,[status(thm)],[c_198,c_10]) ).
tff(c_447,plain,
! [B_89,C_90] :
( member('#skF_1'(B_89,C_90),'#skF_5')
| ~ subset(B_89,'#skF_4')
| subset(B_89,C_90) ),
inference(resolution,[status(thm)],[c_40,c_435]) ).
tff(c_161,plain,
! [D_47,B_48,C_49] :
( member(D_47,intersection(B_48,C_49))
| ~ member(D_47,C_49)
| ~ member(D_47,B_48) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_12,plain,
! [B_6,C_7] :
( ~ member('#skF_1'(B_6,C_7),C_7)
| subset(B_6,C_7) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_1718,plain,
! [B_212,B_213,C_214] :
( subset(B_212,intersection(B_213,C_214))
| ~ member('#skF_1'(B_212,intersection(B_213,C_214)),C_214)
| ~ member('#skF_1'(B_212,intersection(B_213,C_214)),B_213) ),
inference(resolution,[status(thm)],[c_161,c_12]) ).
tff(c_1783,plain,
! [B_215,B_216] :
( ~ member('#skF_1'(B_215,intersection(B_216,B_215)),B_216)
| subset(B_215,intersection(B_216,B_215)) ),
inference(resolution,[status(thm)],[c_14,c_1718]) ).
tff(c_2163,plain,
! [B_219] :
( ~ subset(B_219,'#skF_4')
| subset(B_219,intersection('#skF_5',B_219)) ),
inference(resolution,[status(thm)],[c_447,c_1783]) ).
tff(c_45,plain,
! [C_24,B_25] : ( intersection(C_24,B_25) = intersection(B_25,C_24) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_8,plain,
! [B_4,C_5] : subset(intersection(B_4,C_5),B_4),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_97,plain,
! [C_28,B_29] : subset(intersection(C_28,B_29),B_29),
inference(superposition,[status(thm),theory(equality)],[c_45,c_8]) ).
tff(c_16,plain,
! [C_12,B_11] :
( ( C_12 = B_11 )
| ~ subset(C_12,B_11)
| ~ subset(B_11,C_12) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_106,plain,
! [C_28,B_29] :
( ( intersection(C_28,B_29) = B_29 )
| ~ subset(B_29,intersection(C_28,B_29)) ),
inference(resolution,[status(thm)],[c_97,c_16]) ).
tff(c_2449,plain,
! [B_225] :
( ( intersection('#skF_5',B_225) = B_225 )
| ~ subset(B_225,'#skF_4') ),
inference(resolution,[status(thm)],[c_2163,c_106]) ).
tff(c_2474,plain,
intersection('#skF_5','#skF_4') = '#skF_4',
inference(resolution,[status(thm)],[c_24,c_2449]) ).
tff(c_22,plain,
! [C_14,B_13] : ( intersection(C_14,B_13) = intersection(B_13,C_14) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_84,plain,
! [C_26,B_27] :
( ( C_26 = B_27 )
| ~ subset(C_26,B_27)
| ~ subset(B_27,C_26) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_147,plain,
! [B_43,C_44] :
( ( intersection(B_43,C_44) = B_43 )
| ~ subset(B_43,intersection(B_43,C_44)) ),
inference(resolution,[status(thm)],[c_8,c_84]) ).
tff(c_150,plain,
! [B_13,C_14] :
( ( intersection(B_13,C_14) = B_13 )
| ~ subset(B_13,intersection(C_14,B_13)) ),
inference(superposition,[status(thm),theory(equality)],[c_22,c_147]) ).
tff(c_2603,plain,
( ( intersection('#skF_4','#skF_5') = '#skF_4' )
| ~ subset('#skF_4','#skF_4') ),
inference(superposition,[status(thm),theory(equality)],[c_2474,c_150]) ).
tff(c_2673,plain,
intersection('#skF_4','#skF_5') = '#skF_4',
inference(demodulation,[status(thm),theory(equality)],[c_24,c_2603]) ).
tff(c_2675,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_38,c_2673]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET183+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.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 16:40:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 5.74/2.50 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.74/2.50
% 5.74/2.50 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.11/2.53
% 6.11/2.53 Inference rules
% 6.11/2.53 ----------------------
% 6.11/2.53 #Ref : 0
% 6.11/2.53 #Sup : 663
% 6.11/2.53 #Fact : 0
% 6.11/2.53 #Define : 0
% 6.11/2.53 #Split : 1
% 6.11/2.53 #Chain : 0
% 6.11/2.53 #Close : 0
% 6.11/2.53
% 6.11/2.53 Ordering : KBO
% 6.11/2.53
% 6.11/2.53 Simplification rules
% 6.11/2.53 ----------------------
% 6.11/2.53 #Subsume : 184
% 6.11/2.53 #Demod : 151
% 6.11/2.53 #Tautology : 73
% 6.11/2.54 #SimpNegUnit : 3
% 6.11/2.54 #BackRed : 1
% 6.11/2.54
% 6.11/2.54 #Partial instantiations: 0
% 6.11/2.54 #Strategies tried : 1
% 6.11/2.54
% 6.11/2.54 Timing (in seconds)
% 6.11/2.54 ----------------------
% 6.11/2.54 Preprocessing : 0.48
% 6.11/2.54 Parsing : 0.25
% 6.11/2.54 CNF conversion : 0.04
% 6.11/2.54 Main loop : 0.92
% 6.11/2.54 Inferencing : 0.30
% 6.11/2.54 Reduction : 0.27
% 6.11/2.54 Demodulation : 0.20
% 6.11/2.54 BG Simplification : 0.04
% 6.11/2.54 Subsumption : 0.25
% 6.11/2.54 Abstraction : 0.04
% 6.11/2.54 MUC search : 0.00
% 6.11/2.54 Cooper : 0.00
% 6.11/2.54 Total : 1.45
% 6.11/2.54 Index Insertion : 0.00
% 6.11/2.54 Index Deletion : 0.00
% 6.11/2.54 Index Matching : 0.00
% 6.11/2.54 BG Taut test : 0.00
%------------------------------------------------------------------------------