TSTP Solution File: SET585+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET585+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 : n027.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:37 EDT 2023
% Result : Theorem 3.26s 1.79s
% Output : CNFRefutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of formulae : 21 ( 8 unt; 10 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 3 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 7 >; 7 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 20 (; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > union > intersection > #nlpp > #skF_3 > #skF_5 > #skF_6 > #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_6',type,
'#skF_6': $i ).
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_39,axiom,
! [B,C] : subset(intersection(B,C),B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_is_subset) ).
tff(f_36,axiom,
! [B,C] : subset(B,union(B,C)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_of_union) ).
tff(f_33,axiom,
! [B,C,D] :
( ( subset(B,C)
& subset(C,D) )
=> subset(B,D) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_subset) ).
tff(f_82,negated_conjecture,
~ ! [B,C,D] : subset(intersection(B,C),union(B,D)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_intersection_subset_of_union) ).
tff(c_6,plain,
! [B_6,C_7] : subset(intersection(B_6,C_7),B_6),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_4,plain,
! [B_4,C_5] : subset(B_4,union(B_4,C_5)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_212,plain,
! [B_61,D_62,C_63] :
( subset(B_61,D_62)
| ~ subset(C_63,D_62)
| ~ subset(B_61,C_63) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_228,plain,
! [B_64,B_65,C_66] :
( subset(B_64,union(B_65,C_66))
| ~ subset(B_64,B_65) ),
inference(resolution,[status(thm)],[c_4,c_212]) ).
tff(c_44,plain,
~ subset(intersection('#skF_4','#skF_5'),union('#skF_4','#skF_6')),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_233,plain,
~ subset(intersection('#skF_4','#skF_5'),'#skF_4'),
inference(resolution,[status(thm)],[c_228,c_44]) ).
tff(c_244,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_233]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET585+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.14/0.33 % Computer : n027.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Thu Aug 3 16:58:54 EDT 2023
% 0.19/0.33 % CPUTime :
% 3.26/1.79 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.26/1.79
% 3.26/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.26/1.81
% 3.26/1.81 Inference rules
% 3.26/1.81 ----------------------
% 3.26/1.81 #Ref : 0
% 3.26/1.81 #Sup : 49
% 3.26/1.81 #Fact : 0
% 3.26/1.81 #Define : 0
% 3.26/1.81 #Split : 0
% 3.26/1.81 #Chain : 0
% 3.26/1.81 #Close : 0
% 3.26/1.81
% 3.26/1.81 Ordering : KBO
% 3.26/1.81
% 3.26/1.81 Simplification rules
% 3.26/1.81 ----------------------
% 3.26/1.81 #Subsume : 8
% 3.26/1.81 #Demod : 8
% 3.26/1.81 #Tautology : 26
% 3.26/1.81 #SimpNegUnit : 0
% 3.26/1.81 #BackRed : 0
% 3.26/1.81
% 3.26/1.81 #Partial instantiations: 0
% 3.26/1.81 #Strategies tried : 1
% 3.26/1.81
% 3.26/1.81 Timing (in seconds)
% 3.26/1.81 ----------------------
% 3.26/1.82 Preprocessing : 0.48
% 3.26/1.82 Parsing : 0.25
% 3.26/1.82 CNF conversion : 0.04
% 3.26/1.82 Main loop : 0.29
% 3.26/1.82 Inferencing : 0.10
% 3.26/1.82 Reduction : 0.09
% 3.26/1.82 Demodulation : 0.08
% 3.26/1.82 BG Simplification : 0.02
% 3.26/1.82 Subsumption : 0.07
% 3.26/1.82 Abstraction : 0.01
% 3.26/1.82 MUC search : 0.00
% 3.26/1.82 Cooper : 0.00
% 3.26/1.82 Total : 0.82
% 3.26/1.82 Index Insertion : 0.00
% 3.26/1.82 Index Deletion : 0.00
% 3.26/1.82 Index Matching : 0.00
% 3.26/1.82 BG Taut test : 0.00
%------------------------------------------------------------------------------