TSTP Solution File: SET628+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET628+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 : n001.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:45 EDT 2023
% Result : Theorem 3.58s 1.91s
% Output : CNFRefutation 3.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of formulae : 60 ( 23 unt; 11 typ; 0 def)
% Number of atoms : 83 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 61 ( 27 ~; 27 |; 1 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 43 (; 42 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ not_equal > member > intersect > empty > #nlpp > empty_set > #skF_4 > #skF_3 > #skF_5 > #skF_6 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(intersect,type,
intersect: ( $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
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_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(not_equal,type,
not_equal: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_52,axiom,
! [B,C] :
( not_equal(B,C)
<=> ( B != C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_equal_defn) ).
tff(f_64,axiom,
! [B] :
( empty(B)
<=> ! [C] : ~ member(C,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_defn) ).
tff(f_34,axiom,
! [B,C] :
( intersect(B,C)
<=> ? [D] :
( member(D,B)
& member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
tff(f_70,negated_conjecture,
~ ! [B] :
( intersect(B,B)
<=> not_equal(B,empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th110) ).
tff(f_38,axiom,
! [B] : ~ member(B,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).
tff(f_46,axiom,
! [B,C] :
( ( B = C )
<=> ! [D] :
( member(D,B)
<=> member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_member_defn) ).
tff(c_22,plain,
! [C_13] : ~ not_equal(C_13,C_13),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_30,plain,
! [B_16] :
( empty(B_16)
| member('#skF_4'(B_16),B_16) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_308,plain,
! [B_76,C_77,D_78] :
( intersect(B_76,C_77)
| ~ member(D_78,C_77)
| ~ member(D_78,B_76) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_319,plain,
! [B_81,B_82] :
( intersect(B_81,B_82)
| ~ member('#skF_4'(B_82),B_81)
| empty(B_82) ),
inference(resolution,[status(thm)],[c_30,c_308]) ).
tff(c_324,plain,
! [B_83] :
( intersect(B_83,B_83)
| empty(B_83) ),
inference(resolution,[status(thm)],[c_30,c_319]) ).
tff(c_130,plain,
! [B_43,C_44,D_45] :
( intersect(B_43,C_44)
| ~ member(D_45,C_44)
| ~ member(D_45,B_43) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_140,plain,
! [B_46,B_47] :
( intersect(B_46,B_47)
| ~ member('#skF_4'(B_47),B_46)
| empty(B_47) ),
inference(resolution,[status(thm)],[c_30,c_130]) ).
tff(c_145,plain,
! [B_48] :
( intersect(B_48,B_48)
| empty(B_48) ),
inference(resolution,[status(thm)],[c_30,c_140]) ).
tff(c_80,plain,
! [B_30,C_31] :
( member('#skF_1'(B_30,C_31),C_31)
| ~ intersect(B_30,C_31) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_24,plain,
! [B_12,C_13] :
( not_equal(B_12,C_13)
| ( C_13 = B_12 ) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_32,plain,
( ~ intersect('#skF_5','#skF_5')
| ~ not_equal('#skF_6',empty_set) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_50,plain,
~ not_equal('#skF_6',empty_set),
inference(splitLeft,[status(thm)],[c_32]) ).
tff(c_54,plain,
empty_set = '#skF_6',
inference(resolution,[status(thm)],[c_24,c_50]) ).
tff(c_8,plain,
! [B_6] : ~ member(B_6,empty_set),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_56,plain,
! [B_6] : ~ member(B_6,'#skF_6'),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_8]) ).
tff(c_88,plain,
! [B_30] : ~ intersect(B_30,'#skF_6'),
inference(resolution,[status(thm)],[c_80,c_56]) ).
tff(c_38,plain,
( not_equal('#skF_5',empty_set)
| intersect('#skF_6','#skF_6') ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_62,plain,
( not_equal('#skF_5','#skF_6')
| intersect('#skF_6','#skF_6') ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_38]) ).
tff(c_63,plain,
intersect('#skF_6','#skF_6'),
inference(splitLeft,[status(thm)],[c_62]) ).
tff(c_91,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_88,c_63]) ).
tff(c_93,plain,
~ intersect('#skF_6','#skF_6'),
inference(splitRight,[status(thm)],[c_62]) ).
tff(c_36,plain,
( ~ intersect('#skF_5','#skF_5')
| intersect('#skF_6','#skF_6') ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_94,plain,
~ intersect('#skF_5','#skF_5'),
inference(negUnitSimplification,[status(thm)],[c_93,c_36]) ).
tff(c_171,plain,
empty('#skF_5'),
inference(resolution,[status(thm)],[c_145,c_94]) ).
tff(c_200,plain,
! [B_61,C_62] :
( member('#skF_2'(B_61,C_62),C_62)
| member('#skF_3'(B_61,C_62),B_61)
| ( C_62 = B_61 ) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_236,plain,
! [C_65] :
( member('#skF_2'('#skF_6',C_65),C_65)
| ( C_65 = '#skF_6' ) ),
inference(resolution,[status(thm)],[c_200,c_56]) ).
tff(c_28,plain,
! [C_19,B_16] :
( ~ member(C_19,B_16)
| ~ empty(B_16) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_254,plain,
! [C_66] :
( ~ empty(C_66)
| ( C_66 = '#skF_6' ) ),
inference(resolution,[status(thm)],[c_236,c_28]) ).
tff(c_261,plain,
'#skF_5' = '#skF_6',
inference(resolution,[status(thm)],[c_171,c_254]) ).
tff(c_92,plain,
not_equal('#skF_5','#skF_6'),
inference(splitRight,[status(thm)],[c_62]) ).
tff(c_266,plain,
not_equal('#skF_6','#skF_6'),
inference(demodulation,[status(thm),theory(equality)],[c_261,c_92]) ).
tff(c_269,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_22,c_266]) ).
tff(c_270,plain,
~ intersect('#skF_5','#skF_5'),
inference(splitRight,[status(thm)],[c_32]) ).
tff(c_350,plain,
empty('#skF_5'),
inference(resolution,[status(thm)],[c_324,c_270]) ).
tff(c_399,plain,
! [B_100,C_101] :
( member('#skF_2'(B_100,C_101),C_101)
| member('#skF_3'(B_100,C_101),B_100)
| ( C_101 = B_100 ) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_428,plain,
! [C_102] :
( member('#skF_2'(empty_set,C_102),C_102)
| ( empty_set = C_102 ) ),
inference(resolution,[status(thm)],[c_399,c_8]) ).
tff(c_446,plain,
! [C_103] :
( ~ empty(C_103)
| ( empty_set = C_103 ) ),
inference(resolution,[status(thm)],[c_428,c_28]) ).
tff(c_453,plain,
empty_set = '#skF_5',
inference(resolution,[status(thm)],[c_350,c_446]) ).
tff(c_271,plain,
not_equal('#skF_6',empty_set),
inference(splitRight,[status(thm)],[c_32]) ).
tff(c_34,plain,
( not_equal('#skF_5',empty_set)
| ~ not_equal('#skF_6',empty_set) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_273,plain,
not_equal('#skF_5',empty_set),
inference(demodulation,[status(thm),theory(equality)],[c_271,c_34]) ).
tff(c_461,plain,
not_equal('#skF_5','#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_453,c_273]) ).
tff(c_466,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_22,c_461]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET628+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.34 % Computer : n001.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % 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 17:26:10 EDT 2023
% 0.20/0.35 % CPUTime :
% 3.58/1.91 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.58/1.92
% 3.58/1.92 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.58/1.95
% 3.58/1.95 Inference rules
% 3.58/1.95 ----------------------
% 3.58/1.95 #Ref : 0
% 3.58/1.95 #Sup : 83
% 3.58/1.95 #Fact : 0
% 3.58/1.95 #Define : 0
% 3.58/1.95 #Split : 2
% 3.58/1.95 #Chain : 0
% 3.58/1.95 #Close : 0
% 3.58/1.95
% 3.58/1.95 Ordering : KBO
% 3.58/1.95
% 3.58/1.95 Simplification rules
% 3.58/1.95 ----------------------
% 3.58/1.95 #Subsume : 20
% 3.58/1.95 #Demod : 31
% 3.58/1.95 #Tautology : 29
% 3.58/1.95 #SimpNegUnit : 4
% 3.58/1.95 #BackRed : 14
% 3.58/1.95
% 3.58/1.95 #Partial instantiations: 0
% 3.58/1.95 #Strategies tried : 1
% 3.58/1.95
% 3.58/1.95 Timing (in seconds)
% 3.58/1.95 ----------------------
% 3.58/1.96 Preprocessing : 0.47
% 3.58/1.96 Parsing : 0.26
% 3.58/1.96 CNF conversion : 0.04
% 3.58/1.96 Main loop : 0.42
% 3.58/1.96 Inferencing : 0.18
% 3.58/1.96 Reduction : 0.09
% 3.58/1.96 Demodulation : 0.05
% 3.58/1.96 BG Simplification : 0.02
% 3.58/1.96 Subsumption : 0.10
% 3.58/1.96 Abstraction : 0.02
% 3.58/1.96 MUC search : 0.00
% 3.58/1.96 Cooper : 0.00
% 3.58/1.96 Total : 0.95
% 3.58/1.96 Index Insertion : 0.00
% 3.58/1.96 Index Deletion : 0.00
% 3.58/1.96 Index Matching : 0.00
% 3.58/1.96 BG Taut test : 0.00
%------------------------------------------------------------------------------