TSTP Solution File: SET639+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET639+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:47 EDT 2023
% Result : Theorem 3.25s 1.86s
% Output : CNFRefutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of formulae : 23 ( 9 unt; 11 typ; 0 def)
% Number of atoms : 16 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 1 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 8 >; 6 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > empty > intersection > #nlpp > empty_set > #skF_2 > #skF_3 > #skF_5 > #skF_6 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
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_6',type,
'#skF_6': $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_86,negated_conjecture,
~ ! [B,C] :
( ( subset(B,C)
& ( intersection(C,B) = empty_set ) )
=> ( B = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th121) ).
tff(f_60,axiom,
! [B,C] : ( intersection(B,C) = intersection(C,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).
tff(f_31,axiom,
! [B,C] :
( subset(B,C)
=> ( intersection(B,C) = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_intersection) ).
tff(c_44,plain,
empty_set != '#skF_5',
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_24,plain,
! [C_15,B_14] : ( intersection(C_15,B_14) = intersection(B_14,C_15) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_48,plain,
subset('#skF_5','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_101,plain,
! [B_33,C_34] :
( ( intersection(B_33,C_34) = B_33 )
| ~ subset(B_33,C_34) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_108,plain,
intersection('#skF_5','#skF_6') = '#skF_5',
inference(resolution,[status(thm)],[c_48,c_101]) ).
tff(c_123,plain,
intersection('#skF_6','#skF_5') = '#skF_5',
inference(superposition,[status(thm),theory(equality)],[c_24,c_108]) ).
tff(c_46,plain,
intersection('#skF_6','#skF_5') = empty_set,
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_135,plain,
empty_set = '#skF_5',
inference(demodulation,[status(thm),theory(equality)],[c_123,c_46]) ).
tff(c_137,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_44,c_135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET639+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 : n009.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:09:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.25/1.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.25/1.86
% 3.25/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.48/1.88
% 3.48/1.88 Inference rules
% 3.48/1.88 ----------------------
% 3.48/1.88 #Ref : 0
% 3.48/1.88 #Sup : 22
% 3.48/1.88 #Fact : 0
% 3.48/1.88 #Define : 0
% 3.48/1.88 #Split : 0
% 3.48/1.88 #Chain : 0
% 3.48/1.88 #Close : 0
% 3.48/1.88
% 3.48/1.88 Ordering : KBO
% 3.48/1.88
% 3.48/1.88 Simplification rules
% 3.48/1.88 ----------------------
% 3.48/1.88 #Subsume : 0
% 3.48/1.88 #Demod : 3
% 3.48/1.88 #Tautology : 19
% 3.48/1.88 #SimpNegUnit : 1
% 3.48/1.88 #BackRed : 1
% 3.48/1.89
% 3.48/1.89 #Partial instantiations: 0
% 3.48/1.89 #Strategies tried : 1
% 3.48/1.89
% 3.48/1.89 Timing (in seconds)
% 3.48/1.89 ----------------------
% 3.48/1.89 Preprocessing : 0.53
% 3.48/1.89 Parsing : 0.26
% 3.48/1.89 CNF conversion : 0.04
% 3.48/1.89 Main loop : 0.19
% 3.48/1.89 Inferencing : 0.06
% 3.48/1.89 Reduction : 0.06
% 3.48/1.89 Demodulation : 0.04
% 3.48/1.89 BG Simplification : 0.02
% 3.48/1.89 Subsumption : 0.04
% 3.48/1.89 Abstraction : 0.01
% 3.48/1.89 MUC search : 0.00
% 3.48/1.89 Cooper : 0.00
% 3.48/1.89 Total : 0.76
% 3.48/1.89 Index Insertion : 0.00
% 3.48/1.89 Index Deletion : 0.00
% 3.48/1.89 Index Matching : 0.00
% 3.48/1.89 BG Taut test : 0.00
%------------------------------------------------------------------------------