TSTP Solution File: SEU125+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU125+1 : TPTP v8.1.2. Released v3.3.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 : n017.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:57:40 EDT 2023
% Result : Theorem 22.76s 11.94s
% Output : CNFRefutation 23.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of formulae : 60 ( 15 unt; 13 typ; 0 def)
% Number of atoms : 99 ( 23 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 82 ( 30 ~; 46 |; 1 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 7 >; 8 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 102 (; 102 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > set_union2 > #nlpp > empty_set > #skF_1 > #skF_7 > #skF_3 > #skF_5 > #skF_6 > #skF_2 > #skF_8 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(f_33,axiom,
! [A,B] : ( set_union2(A,B) = set_union2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
tff(f_98,negated_conjecture,
~ ! [A,B,C] :
( ( subset(A,B)
& subset(C,B) )
=> subset(set_union2(A,C),B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_xboole_1) ).
tff(f_42,axiom,
! [A,B,C] :
( ( C = set_union2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
| in(D,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
tff(f_49,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_65,axiom,
! [A,B] : ( set_union2(A,A) = A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_k2_xboole_0) ).
tff(c_4,plain,
! [B_4,A_3] : ( set_union2(B_4,A_3) = set_union2(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_56,plain,
~ subset(set_union2('#skF_6','#skF_8'),'#skF_7'),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_61,plain,
~ subset(set_union2('#skF_8','#skF_6'),'#skF_7'),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_56]) ).
tff(c_58,plain,
subset('#skF_8','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_1049,plain,
! [A_145,B_146,C_147] :
( in('#skF_1'(A_145,B_146,C_147),B_146)
| in('#skF_1'(A_145,B_146,C_147),A_145)
| in('#skF_2'(A_145,B_146,C_147),C_147)
| ( set_union2(A_145,B_146) = C_147 ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_20,plain,
! [A_5,B_6,C_7] :
( ~ in('#skF_1'(A_5,B_6,C_7),C_7)
| in('#skF_2'(A_5,B_6,C_7),C_7)
| ( set_union2(A_5,B_6) = C_7 ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_3204,plain,
! [A_302,B_303] :
( in('#skF_1'(A_302,B_303,B_303),A_302)
| in('#skF_2'(A_302,B_303,B_303),B_303)
| ( set_union2(A_302,B_303) = B_303 ) ),
inference(resolution,[status(thm)],[c_1049,c_20]) ).
tff(c_881,plain,
! [A_138,B_139,C_140] :
( in('#skF_1'(A_138,B_139,C_140),B_139)
| in('#skF_1'(A_138,B_139,C_140),A_138)
| ~ in('#skF_2'(A_138,B_139,C_140),B_139)
| ( set_union2(A_138,B_139) = C_140 ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_12,plain,
! [A_5,B_6,C_7] :
( ~ in('#skF_1'(A_5,B_6,C_7),C_7)
| ~ in('#skF_2'(A_5,B_6,C_7),B_6)
| ( set_union2(A_5,B_6) = C_7 ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_952,plain,
! [A_138,B_139] :
( in('#skF_1'(A_138,B_139,B_139),A_138)
| ~ in('#skF_2'(A_138,B_139,B_139),B_139)
| ( set_union2(A_138,B_139) = B_139 ) ),
inference(resolution,[status(thm)],[c_881,c_12]) ).
tff(c_3293,plain,
! [A_304,B_305] :
( in('#skF_1'(A_304,B_305,B_305),A_304)
| ( set_union2(A_304,B_305) = B_305 ) ),
inference(resolution,[status(thm)],[c_3204,c_952]) ).
tff(c_24,plain,
! [C_15,B_12,A_11] :
( in(C_15,B_12)
| ~ in(C_15,A_11)
| ~ subset(A_11,B_12) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_3341,plain,
! [A_304,B_305,B_12] :
( in('#skF_1'(A_304,B_305,B_305),B_12)
| ~ subset(A_304,B_12)
| ( set_union2(A_304,B_305) = B_305 ) ),
inference(resolution,[status(thm)],[c_3293,c_24]) ).
tff(c_40,plain,
! [A_20] : ( set_union2(A_20,A_20) = A_20 ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_10,plain,
! [D_10,A_5,B_6] :
( ~ in(D_10,A_5)
| in(D_10,set_union2(A_5,B_6)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_561,plain,
! [A_107,B_108,C_109] :
( ~ in('#skF_1'(A_107,B_108,C_109),C_109)
| in('#skF_2'(A_107,B_108,C_109),C_109)
| ( set_union2(A_107,B_108) = C_109 ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_21176,plain,
! [A_682,B_683,A_684,B_685] :
( in('#skF_2'(A_682,B_683,set_union2(A_684,B_685)),set_union2(A_684,B_685))
| ( set_union2(A_684,B_685) = set_union2(A_682,B_683) )
| ~ in('#skF_1'(A_682,B_683,set_union2(A_684,B_685)),A_684) ),
inference(resolution,[status(thm)],[c_10,c_561]) ).
tff(c_467,plain,
! [A_85,B_86,C_87] :
( ~ in('#skF_1'(A_85,B_86,C_87),C_87)
| ~ in('#skF_2'(A_85,B_86,C_87),B_86)
| ( set_union2(A_85,B_86) = C_87 ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_474,plain,
! [A_85,B_86,A_5,B_6] :
( ~ in('#skF_2'(A_85,B_86,set_union2(A_5,B_6)),B_86)
| ( set_union2(A_85,B_86) = set_union2(A_5,B_6) )
| ~ in('#skF_1'(A_85,B_86,set_union2(A_5,B_6)),A_5) ),
inference(resolution,[status(thm)],[c_10,c_467]) ).
tff(c_81747,plain,
! [A_1193,A_1194,B_1195] :
( ( set_union2(A_1193,set_union2(A_1194,B_1195)) = set_union2(A_1194,B_1195) )
| ~ in('#skF_1'(A_1193,set_union2(A_1194,B_1195),set_union2(A_1194,B_1195)),A_1194) ),
inference(resolution,[status(thm)],[c_21176,c_474]) ).
tff(c_81964,plain,
! [A_1193,A_20] :
( ( set_union2(A_1193,set_union2(A_20,A_20)) = set_union2(A_20,A_20) )
| ~ in('#skF_1'(A_1193,A_20,set_union2(A_20,A_20)),A_20) ),
inference(superposition,[status(thm),theory(equality)],[c_40,c_81747]) ).
tff(c_82336,plain,
! [A_1208,A_1209] :
( ( set_union2(A_1208,A_1209) = A_1209 )
| ~ in('#skF_1'(A_1208,A_1209,A_1209),A_1209) ),
inference(demodulation,[status(thm),theory(equality)],[c_40,c_40,c_40,c_81964]) ).
tff(c_82606,plain,
! [A_1210,B_1211] :
( ~ subset(A_1210,B_1211)
| ( set_union2(A_1210,B_1211) = B_1211 ) ),
inference(resolution,[status(thm)],[c_3341,c_82336]) ).
tff(c_82830,plain,
set_union2('#skF_8','#skF_7') = '#skF_7',
inference(resolution,[status(thm)],[c_58,c_82606]) ).
tff(c_60,plain,
subset('#skF_6','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_82827,plain,
set_union2('#skF_6','#skF_7') = '#skF_7',
inference(resolution,[status(thm)],[c_60,c_82606]) ).
tff(c_28,plain,
! [A_11,B_12] :
( in('#skF_3'(A_11,B_12),A_11)
| subset(A_11,B_12) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_435,plain,
! [D_82,B_83,A_84] :
( in(D_82,B_83)
| in(D_82,A_84)
| ~ in(D_82,set_union2(A_84,B_83)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_5819,plain,
! [A_450,B_451,B_452] :
( in('#skF_3'(set_union2(A_450,B_451),B_452),B_451)
| in('#skF_3'(set_union2(A_450,B_451),B_452),A_450)
| subset(set_union2(A_450,B_451),B_452) ),
inference(resolution,[status(thm)],[c_28,c_435]) ).
tff(c_333,plain,
! [D_65,A_66,B_67] :
( ~ in(D_65,A_66)
| in(D_65,set_union2(A_66,B_67)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_26,plain,
! [A_11,B_12] :
( ~ in('#skF_3'(A_11,B_12),B_12)
| subset(A_11,B_12) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_358,plain,
! [A_11,A_66,B_67] :
( subset(A_11,set_union2(A_66,B_67))
| ~ in('#skF_3'(A_11,set_union2(A_66,B_67)),A_66) ),
inference(resolution,[status(thm)],[c_333,c_26]) ).
tff(c_5985,plain,
! [A_450,B_451,B_67] :
( in('#skF_3'(set_union2(A_450,B_451),set_union2(B_451,B_67)),A_450)
| subset(set_union2(A_450,B_451),set_union2(B_451,B_67)) ),
inference(resolution,[status(thm)],[c_5819,c_358]) ).
tff(c_8,plain,
! [D_10,B_6,A_5] :
( ~ in(D_10,B_6)
| in(D_10,set_union2(A_5,B_6)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_297,plain,
! [A_56,B_57] :
( ~ in('#skF_3'(A_56,B_57),B_57)
| subset(A_56,B_57) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_826,plain,
! [A_135,A_136,B_137] :
( subset(A_135,set_union2(A_136,B_137))
| ~ in('#skF_3'(A_135,set_union2(A_136,B_137)),B_137) ),
inference(resolution,[status(thm)],[c_8,c_297]) ).
tff(c_61482,plain,
! [A_1040,A_1041,A_1042,B_1043] :
( subset(A_1040,set_union2(A_1041,set_union2(A_1042,B_1043)))
| ~ in('#skF_3'(A_1040,set_union2(A_1041,set_union2(A_1042,B_1043))),A_1042) ),
inference(resolution,[status(thm)],[c_10,c_826]) ).
tff(c_61771,plain,
! [A_450,B_451,B_1043] : subset(set_union2(A_450,B_451),set_union2(B_451,set_union2(A_450,B_1043))),
inference(resolution,[status(thm)],[c_5985,c_61482]) ).
tff(c_86312,plain,
! [B_1233] : subset(set_union2('#skF_6',B_1233),set_union2(B_1233,'#skF_7')),
inference(superposition,[status(thm),theory(equality)],[c_82827,c_61771]) ).
tff(c_86361,plain,
subset(set_union2('#skF_6','#skF_8'),'#skF_7'),
inference(superposition,[status(thm),theory(equality)],[c_82830,c_86312]) ).
tff(c_86479,plain,
subset(set_union2('#skF_8','#skF_6'),'#skF_7'),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_86361]) ).
tff(c_86481,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_61,c_86479]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU125+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/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.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 11:21:06 EDT 2023
% 0.13/0.35 % CPUTime :
% 22.76/11.94 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.76/11.95
% 22.76/11.95 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 23.58/11.98
% 23.58/11.98 Inference rules
% 23.58/11.98 ----------------------
% 23.58/11.98 #Ref : 0
% 23.58/11.98 #Sup : 23228
% 23.58/11.98 #Fact : 48
% 23.58/11.98 #Define : 0
% 23.58/11.98 #Split : 12
% 23.58/11.98 #Chain : 0
% 23.58/11.98 #Close : 0
% 23.58/11.98
% 23.58/11.98 Ordering : KBO
% 23.58/11.98
% 23.58/11.98 Simplification rules
% 23.58/11.98 ----------------------
% 23.58/11.98 #Subsume : 12580
% 23.58/11.98 #Demod : 10453
% 23.58/11.98 #Tautology : 3118
% 23.58/11.98 #SimpNegUnit : 204
% 23.58/11.98 #BackRed : 64
% 23.58/11.98
% 23.58/11.98 #Partial instantiations: 0
% 23.58/11.98 #Strategies tried : 1
% 23.58/11.98
% 23.58/11.98 Timing (in seconds)
% 23.58/11.98 ----------------------
% 23.58/11.98 Preprocessing : 0.50
% 23.58/11.98 Parsing : 0.26
% 23.58/11.98 CNF conversion : 0.04
% 23.58/11.98 Main loop : 10.39
% 23.58/11.98 Inferencing : 1.69
% 23.58/11.98 Reduction : 3.00
% 23.58/11.98 Demodulation : 2.43
% 23.58/11.98 BG Simplification : 0.13
% 23.58/11.98 Subsumption : 4.82
% 23.58/11.98 Abstraction : 0.21
% 23.58/11.98 MUC search : 0.00
% 23.58/11.98 Cooper : 0.00
% 23.58/11.99 Total : 10.95
% 23.58/11.99 Index Insertion : 0.00
% 23.58/11.99 Index Deletion : 0.00
% 23.58/11.99 Index Matching : 0.00
% 23.58/11.99 BG Taut test : 0.00
%------------------------------------------------------------------------------