TSTP Solution File: SET009+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET009+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:55:29 EDT 2023
% Result : Theorem 12.45s 4.10s
% Output : CNFRefutation 12.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 27 ( 4 unt; 7 typ; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 37 ( 15 ~; 17 |; 1 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 46 (; 46 !; 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_52,negated_conjecture,
~ ! [B,C,D] :
( subset(B,C)
=> subset(difference(D,C),difference(D,B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subset_difference) ).
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(c_18,plain,
subset('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_52]) ).
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_39,plain,
! [B_19,C_20,C_5] :
( member('#skF_1'(difference(B_19,C_20),C_5),B_19)
| subset(difference(B_19,C_20),C_5) ),
inference(resolution,[status(thm)],[c_12,c_34]) ).
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_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_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_1152,plain,
! [B_145,C_146,C_147] :
( member('#skF_1'(difference(B_145,C_146),difference(B_145,C_147)),C_147)
| subset(difference(B_145,C_146),difference(B_145,C_147)) ),
inference(resolution,[status(thm)],[c_39,c_281]) ).
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_20622,plain,
! [B_660,C_661,C_662,C_663] :
( member('#skF_1'(difference(B_660,C_661),difference(B_660,C_662)),C_663)
| ~ subset(C_662,C_663)
| subset(difference(B_660,C_661),difference(B_660,C_662)) ),
inference(resolution,[status(thm)],[c_1152,c_8]) ).
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_20692,plain,
! [C_664,C_665,B_666] :
( ~ subset(C_664,C_665)
| subset(difference(B_666,C_665),difference(B_666,C_664)) ),
inference(resolution,[status(thm)],[c_20622,c_26]) ).
tff(c_16,plain,
~ subset(difference('#skF_4','#skF_3'),difference('#skF_4','#skF_2')),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_20793,plain,
~ subset('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_20692,c_16]) ).
tff(c_20839,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_18,c_20793]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET009+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/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.17/0.35 % Computer : n009.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 16:58:54 EDT 2023
% 0.17/0.35 % CPUTime :
% 12.45/4.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.45/4.10
% 12.45/4.10 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.53/4.13
% 12.53/4.13 Inference rules
% 12.53/4.13 ----------------------
% 12.53/4.13 #Ref : 0
% 12.53/4.13 #Sup : 4789
% 12.53/4.13 #Fact : 2
% 12.53/4.13 #Define : 0
% 12.53/4.13 #Split : 2
% 12.53/4.13 #Chain : 0
% 12.53/4.13 #Close : 0
% 12.53/4.13
% 12.53/4.13 Ordering : KBO
% 12.53/4.13
% 12.53/4.13 Simplification rules
% 12.53/4.13 ----------------------
% 12.53/4.13 #Subsume : 1041
% 12.53/4.13 #Demod : 2205
% 12.53/4.13 #Tautology : 1804
% 12.53/4.13 #SimpNegUnit : 0
% 12.53/4.13 #BackRed : 0
% 12.53/4.13
% 12.53/4.13 #Partial instantiations: 0
% 12.53/4.13 #Strategies tried : 1
% 12.53/4.13
% 12.53/4.13 Timing (in seconds)
% 12.53/4.13 ----------------------
% 12.53/4.13 Preprocessing : 0.41
% 12.53/4.13 Parsing : 0.22
% 12.53/4.13 CNF conversion : 0.03
% 12.53/4.13 Main loop : 2.68
% 12.53/4.13 Inferencing : 0.66
% 12.53/4.13 Reduction : 0.92
% 12.53/4.13 Demodulation : 0.70
% 12.53/4.14 BG Simplification : 0.05
% 12.53/4.14 Subsumption : 0.90
% 12.53/4.14 Abstraction : 0.06
% 12.53/4.14 MUC search : 0.00
% 12.53/4.14 Cooper : 0.00
% 12.53/4.14 Total : 3.13
% 12.53/4.14 Index Insertion : 0.00
% 12.53/4.14 Index Deletion : 0.00
% 12.53/4.14 Index Matching : 0.00
% 12.53/4.14 BG Taut test : 0.00
%------------------------------------------------------------------------------