TSTP Solution File: SET588+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET588+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 : n009.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:38 EDT 2023
% Result : Theorem 4.66s 2.14s
% Output : CNFRefutation 4.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 31 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 51 ( 21 ~; 25 |; 1 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 54 (; 54 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > difference > #nlpp > #skF_2 > #skF_3 > #skF_4 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(difference,type,
difference: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_43,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
tff(f_35,axiom,
! [B,C,D] :
( member(D,difference(B,C))
<=> ( member(D,B)
& ~ member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
tff(f_52,negated_conjecture,
~ ! [B,C,D] :
( subset(B,C)
=> subset(difference(B,D),difference(C,D)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_difference_subset1) ).
tff(c_12,plain,
! [B_4,C_5] :
( member('#skF_1'(B_4,C_5),B_4)
| subset(B_4,C_5) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_34,plain,
! [D_18,B_19,C_20] :
( member(D_18,B_19)
| ~ member(D_18,difference(B_19,C_20)) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_80,plain,
! [B_30,C_31,C_32] :
( member('#skF_1'(difference(B_30,C_31),C_32),B_30)
| subset(difference(B_30,C_31),C_32) ),
inference(resolution,[status(thm)],[c_12,c_34]) ).
tff(c_10,plain,
! [B_4,C_5] :
( ~ member('#skF_1'(B_4,C_5),C_5)
| subset(B_4,C_5) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_97,plain,
! [B_30,C_31] : subset(difference(B_30,C_31),B_30),
inference(resolution,[status(thm)],[c_80,c_10]) ).
tff(c_18,plain,
subset('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_40,plain,
! [D_21,C_22,B_23] :
( member(D_21,C_22)
| ~ member(D_21,B_23)
| ~ subset(B_23,C_22) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_61,plain,
! [B_27,C_28,C_29] :
( member('#skF_1'(B_27,C_28),C_29)
| ~ subset(B_27,C_29)
| subset(B_27,C_28) ),
inference(resolution,[status(thm)],[c_12,c_40]) ).
tff(c_8,plain,
! [D_8,C_5,B_4] :
( member(D_8,C_5)
| ~ member(D_8,B_4)
| ~ subset(B_4,C_5) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_173,plain,
! [B_58,C_59,C_60,C_61] :
( member('#skF_1'(B_58,C_59),C_60)
| ~ subset(C_61,C_60)
| ~ subset(B_58,C_61)
| subset(B_58,C_59) ),
inference(resolution,[status(thm)],[c_61,c_8]) ).
tff(c_185,plain,
! [B_58,C_59] :
( member('#skF_1'(B_58,C_59),'#skF_3')
| ~ subset(B_58,'#skF_2')
| subset(B_58,C_59) ),
inference(resolution,[status(thm)],[c_18,c_173]) ).
tff(c_44,plain,
! [D_24,B_25,C_26] :
( member(D_24,difference(B_25,C_26))
| member(D_24,C_26)
| ~ member(D_24,B_25) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_281,plain,
! [B_71,B_72,C_73] :
( subset(B_71,difference(B_72,C_73))
| member('#skF_1'(B_71,difference(B_72,C_73)),C_73)
| ~ member('#skF_1'(B_71,difference(B_72,C_73)),B_72) ),
inference(resolution,[status(thm)],[c_44,c_10]) ).
tff(c_1422,plain,
! [B_162,C_163] :
( member('#skF_1'(B_162,difference('#skF_3',C_163)),C_163)
| ~ subset(B_162,'#skF_2')
| subset(B_162,difference('#skF_3',C_163)) ),
inference(resolution,[status(thm)],[c_185,c_281]) ).
tff(c_21,plain,
! [B_14,C_15] :
( member('#skF_1'(B_14,C_15),B_14)
| subset(B_14,C_15) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_4,plain,
! [D_3,C_2,B_1] :
( ~ member(D_3,C_2)
| ~ member(D_3,difference(B_1,C_2)) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_26,plain,
! [B_1,C_2,C_15] :
( ~ member('#skF_1'(difference(B_1,C_2),C_15),C_2)
| subset(difference(B_1,C_2),C_15) ),
inference(resolution,[status(thm)],[c_21,c_4]) ).
tff(c_1893,plain,
! [B_194,C_195] :
( ~ subset(difference(B_194,C_195),'#skF_2')
| subset(difference(B_194,C_195),difference('#skF_3',C_195)) ),
inference(resolution,[status(thm)],[c_1422,c_26]) ).
tff(c_16,plain,
~ subset(difference('#skF_2','#skF_4'),difference('#skF_3','#skF_4')),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_1915,plain,
~ subset(difference('#skF_2','#skF_4'),'#skF_2'),
inference(resolution,[status(thm)],[c_1893,c_16]) ).
tff(c_1930,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_97,c_1915]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET588+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.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 16:09:38 EDT 2023
% 0.12/0.34 % CPUTime :
% 4.66/2.14 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.66/2.15
% 4.66/2.15 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.66/2.18
% 4.66/2.18 Inference rules
% 4.66/2.18 ----------------------
% 4.66/2.18 #Ref : 0
% 4.66/2.18 #Sup : 422
% 4.66/2.18 #Fact : 0
% 4.66/2.18 #Define : 0
% 4.66/2.18 #Split : 0
% 4.66/2.18 #Chain : 0
% 4.66/2.18 #Close : 0
% 4.66/2.18
% 4.66/2.18 Ordering : KBO
% 4.66/2.18
% 4.66/2.18 Simplification rules
% 4.66/2.18 ----------------------
% 4.66/2.18 #Subsume : 77
% 4.66/2.18 #Demod : 179
% 4.66/2.18 #Tautology : 157
% 4.66/2.18 #SimpNegUnit : 0
% 4.66/2.18 #BackRed : 0
% 4.66/2.18
% 4.66/2.18 #Partial instantiations: 0
% 4.66/2.18 #Strategies tried : 1
% 4.66/2.18
% 4.66/2.18 Timing (in seconds)
% 4.66/2.18 ----------------------
% 4.66/2.18 Preprocessing : 0.42
% 4.66/2.18 Parsing : 0.24
% 4.66/2.18 CNF conversion : 0.03
% 4.66/2.18 Main loop : 0.71
% 4.66/2.19 Inferencing : 0.28
% 4.66/2.19 Reduction : 0.19
% 4.66/2.19 Demodulation : 0.14
% 4.66/2.19 BG Simplification : 0.03
% 4.66/2.19 Subsumption : 0.17
% 4.66/2.19 Abstraction : 0.03
% 4.66/2.19 MUC search : 0.00
% 4.66/2.19 Cooper : 0.00
% 4.66/2.19 Total : 1.18
% 4.66/2.19 Index Insertion : 0.00
% 4.66/2.19 Index Deletion : 0.00
% 4.66/2.19 Index Matching : 0.00
% 4.66/2.19 BG Taut test : 0.00
%------------------------------------------------------------------------------