TSTP Solution File: SEU159+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU159+3 : TPTP v8.1.2. Released v3.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 : n008.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:50 EDT 2023
% Result : Theorem 6.95s 2.70s
% Output : CNFRefutation 6.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of formulae : 74 ( 32 unt; 15 typ; 0 def)
% Number of atoms : 99 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 69 ( 29 ~; 34 |; 1 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 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 : 12 ( 12 usr; 8 con; 0-3 aty)
% Number of variables : 42 (; 42 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > unordered_pair > #nlpp > #skF_1 > #skF_11 > #skF_7 > #skF_3 > #skF_10 > #skF_5 > #skF_6 > #skF_2 > #skF_9 > #skF_8 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $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('#skF_9',type,
'#skF_9': $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_63,negated_conjecture,
~ ! [A,B,C] :
( subset(unordered_pair(A,B),C)
<=> ( in(A,C)
& in(B,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1) ).
tff(f_42,axiom,
! [A,B,C] :
( ( C = unordered_pair(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( ( D = A )
| ( D = B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
tff(f_49,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
tff(c_40,plain,
( in('#skF_6','#skF_8')
| ~ in('#skF_10','#skF_11')
| ~ in('#skF_9','#skF_11') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_134,plain,
~ in('#skF_9','#skF_11'),
inference(splitLeft,[status(thm)],[c_40]) ).
tff(c_46,plain,
( in('#skF_6','#skF_8')
| subset(unordered_pair('#skF_9','#skF_10'),'#skF_11') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_120,plain,
subset(unordered_pair('#skF_9','#skF_10'),'#skF_11'),
inference(splitLeft,[status(thm)],[c_46]) ).
tff(c_10,plain,
! [D_10,B_6] : in(D_10,unordered_pair(D_10,B_6)),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_158,plain,
! [C_40,B_41,A_42] :
( in(C_40,B_41)
| ~ in(C_40,A_42)
| ~ subset(A_42,B_41) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_200,plain,
! [D_47,B_48,B_49] :
( in(D_47,B_48)
| ~ subset(unordered_pair(D_47,B_49),B_48) ),
inference(resolution,[status(thm)],[c_10,c_158]) ).
tff(c_203,plain,
in('#skF_9','#skF_11'),
inference(resolution,[status(thm)],[c_120,c_200]) ).
tff(c_217,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_134,c_203]) ).
tff(c_219,plain,
in('#skF_9','#skF_11'),
inference(splitRight,[status(thm)],[c_40]) ).
tff(c_38,plain,
( in('#skF_7','#skF_8')
| ~ in('#skF_10','#skF_11')
| ~ in('#skF_9','#skF_11') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_224,plain,
( in('#skF_7','#skF_8')
| ~ in('#skF_10','#skF_11') ),
inference(demodulation,[status(thm),theory(equality)],[c_219,c_38]) ).
tff(c_225,plain,
~ in('#skF_10','#skF_11'),
inference(splitLeft,[status(thm)],[c_224]) ).
tff(c_8,plain,
! [D_10,A_5] : in(D_10,unordered_pair(A_5,D_10)),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_226,plain,
! [C_50,B_51,A_52] :
( in(C_50,B_51)
| ~ in(C_50,A_52)
| ~ subset(A_52,B_51) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_246,plain,
! [D_54,B_55,A_56] :
( in(D_54,B_55)
| ~ subset(unordered_pair(A_56,D_54),B_55) ),
inference(resolution,[status(thm)],[c_8,c_226]) ).
tff(c_249,plain,
in('#skF_10','#skF_11'),
inference(resolution,[status(thm)],[c_120,c_246]) ).
tff(c_263,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_225,c_249]) ).
tff(c_265,plain,
in('#skF_10','#skF_11'),
inference(splitRight,[status(thm)],[c_224]) ).
tff(c_36,plain,
( ~ subset(unordered_pair('#skF_6','#skF_7'),'#skF_8')
| ~ in('#skF_10','#skF_11')
| ~ in('#skF_9','#skF_11') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_369,plain,
~ subset(unordered_pair('#skF_6','#skF_7'),'#skF_8'),
inference(demodulation,[status(thm),theory(equality)],[c_219,c_265,c_36]) ).
tff(c_264,plain,
in('#skF_7','#skF_8'),
inference(splitRight,[status(thm)],[c_224]) ).
tff(c_218,plain,
( ~ in('#skF_10','#skF_11')
| in('#skF_6','#skF_8') ),
inference(splitRight,[status(thm)],[c_40]) ).
tff(c_274,plain,
in('#skF_6','#skF_8'),
inference(demodulation,[status(thm),theory(equality)],[c_265,c_218]) ).
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_314,plain,
! [D_62,B_63,A_64] :
( ( D_62 = B_63 )
| ( D_62 = A_64 )
| ~ in(D_62,unordered_pair(A_64,B_63)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_3477,plain,
! [A_2268,B_2269,B_2270] :
( ( '#skF_3'(unordered_pair(A_2268,B_2269),B_2270) = B_2269 )
| ( '#skF_3'(unordered_pair(A_2268,B_2269),B_2270) = A_2268 )
| subset(unordered_pair(A_2268,B_2269),B_2270) ),
inference(resolution,[status(thm)],[c_28,c_314]) ).
tff(c_3745,plain,
( ( '#skF_3'(unordered_pair('#skF_6','#skF_7'),'#skF_8') = '#skF_7' )
| ( '#skF_3'(unordered_pair('#skF_6','#skF_7'),'#skF_8') = '#skF_6' ) ),
inference(resolution,[status(thm)],[c_3477,c_369]) ).
tff(c_3747,plain,
'#skF_3'(unordered_pair('#skF_6','#skF_7'),'#skF_8') = '#skF_6',
inference(splitLeft,[status(thm)],[c_3745]) ).
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_3765,plain,
( ~ in('#skF_6','#skF_8')
| subset(unordered_pair('#skF_6','#skF_7'),'#skF_8') ),
inference(superposition,[status(thm),theory(equality)],[c_3747,c_26]) ).
tff(c_3892,plain,
subset(unordered_pair('#skF_6','#skF_7'),'#skF_8'),
inference(demodulation,[status(thm),theory(equality)],[c_274,c_3765]) ).
tff(c_3894,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_369,c_3892]) ).
tff(c_3895,plain,
'#skF_3'(unordered_pair('#skF_6','#skF_7'),'#skF_8') = '#skF_7',
inference(splitRight,[status(thm)],[c_3745]) ).
tff(c_3914,plain,
( ~ in('#skF_7','#skF_8')
| subset(unordered_pair('#skF_6','#skF_7'),'#skF_8') ),
inference(superposition,[status(thm),theory(equality)],[c_3895,c_26]) ).
tff(c_4041,plain,
subset(unordered_pair('#skF_6','#skF_7'),'#skF_8'),
inference(demodulation,[status(thm),theory(equality)],[c_264,c_3914]) ).
tff(c_4043,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_369,c_4041]) ).
tff(c_4045,plain,
~ subset(unordered_pair('#skF_9','#skF_10'),'#skF_11'),
inference(splitRight,[status(thm)],[c_46]) ).
tff(c_42,plain,
( ~ subset(unordered_pair('#skF_6','#skF_7'),'#skF_8')
| subset(unordered_pair('#skF_9','#skF_10'),'#skF_11') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_4125,plain,
~ subset(unordered_pair('#skF_6','#skF_7'),'#skF_8'),
inference(negUnitSimplification,[status(thm)],[c_4045,c_42]) ).
tff(c_44,plain,
( in('#skF_7','#skF_8')
| subset(unordered_pair('#skF_9','#skF_10'),'#skF_11') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_4046,plain,
subset(unordered_pair('#skF_9','#skF_10'),'#skF_11'),
inference(splitLeft,[status(thm)],[c_44]) ).
tff(c_4050,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4045,c_4046]) ).
tff(c_4051,plain,
in('#skF_7','#skF_8'),
inference(splitRight,[status(thm)],[c_44]) ).
tff(c_4044,plain,
in('#skF_6','#skF_8'),
inference(splitRight,[status(thm)],[c_46]) ).
tff(c_4072,plain,
! [D_2367,B_2368,A_2369] :
( ( D_2367 = B_2368 )
| ( D_2367 = A_2369 )
| ~ in(D_2367,unordered_pair(A_2369,B_2368)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_6394,plain,
! [A_4117,B_4118,B_4119] :
( ( '#skF_3'(unordered_pair(A_4117,B_4118),B_4119) = B_4118 )
| ( '#skF_3'(unordered_pair(A_4117,B_4118),B_4119) = A_4117 )
| subset(unordered_pair(A_4117,B_4118),B_4119) ),
inference(resolution,[status(thm)],[c_28,c_4072]) ).
tff(c_6664,plain,
( ( '#skF_3'(unordered_pair('#skF_6','#skF_7'),'#skF_8') = '#skF_7' )
| ( '#skF_3'(unordered_pair('#skF_6','#skF_7'),'#skF_8') = '#skF_6' ) ),
inference(resolution,[status(thm)],[c_6394,c_4125]) ).
tff(c_6666,plain,
'#skF_3'(unordered_pair('#skF_6','#skF_7'),'#skF_8') = '#skF_6',
inference(splitLeft,[status(thm)],[c_6664]) ).
tff(c_6685,plain,
( ~ in('#skF_6','#skF_8')
| subset(unordered_pair('#skF_6','#skF_7'),'#skF_8') ),
inference(superposition,[status(thm),theory(equality)],[c_6666,c_26]) ).
tff(c_6810,plain,
subset(unordered_pair('#skF_6','#skF_7'),'#skF_8'),
inference(demodulation,[status(thm),theory(equality)],[c_4044,c_6685]) ).
tff(c_6812,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4125,c_6810]) ).
tff(c_6813,plain,
'#skF_3'(unordered_pair('#skF_6','#skF_7'),'#skF_8') = '#skF_7',
inference(splitRight,[status(thm)],[c_6664]) ).
tff(c_6833,plain,
( ~ in('#skF_7','#skF_8')
| subset(unordered_pair('#skF_6','#skF_7'),'#skF_8') ),
inference(superposition,[status(thm),theory(equality)],[c_6813,c_26]) ).
tff(c_6958,plain,
subset(unordered_pair('#skF_6','#skF_7'),'#skF_8'),
inference(demodulation,[status(thm),theory(equality)],[c_4051,c_6833]) ).
tff(c_6960,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4125,c_6958]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU159+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n008.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 11:32:18 EDT 2023
% 0.13/0.35 % CPUTime :
% 6.95/2.70 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.95/2.71
% 6.95/2.71 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.95/2.74
% 6.95/2.74 Inference rules
% 6.95/2.74 ----------------------
% 6.95/2.74 #Ref : 0
% 6.95/2.74 #Sup : 1075
% 6.95/2.74 #Fact : 8
% 6.95/2.74 #Define : 0
% 6.95/2.74 #Split : 18
% 6.95/2.74 #Chain : 0
% 6.95/2.74 #Close : 0
% 6.95/2.74
% 6.95/2.74 Ordering : KBO
% 6.95/2.74
% 6.95/2.74 Simplification rules
% 6.95/2.74 ----------------------
% 6.95/2.74 #Subsume : 124
% 6.95/2.74 #Demod : 44
% 6.95/2.74 #Tautology : 165
% 6.95/2.74 #SimpNegUnit : 28
% 6.95/2.74 #BackRed : 0
% 6.95/2.74
% 6.95/2.74 #Partial instantiations: 4752
% 6.95/2.74 #Strategies tried : 1
% 6.95/2.74
% 6.95/2.74 Timing (in seconds)
% 6.95/2.74 ----------------------
% 6.95/2.74 Preprocessing : 0.48
% 6.95/2.74 Parsing : 0.25
% 6.95/2.74 CNF conversion : 0.04
% 6.95/2.74 Main loop : 1.20
% 6.95/2.74 Inferencing : 0.55
% 6.95/2.74 Reduction : 0.29
% 6.95/2.74 Demodulation : 0.21
% 6.95/2.74 BG Simplification : 0.05
% 6.95/2.74 Subsumption : 0.23
% 6.95/2.74 Abstraction : 0.05
% 6.95/2.74 MUC search : 0.00
% 6.95/2.74 Cooper : 0.00
% 6.95/2.74 Total : 1.74
% 6.95/2.74 Index Insertion : 0.00
% 6.95/2.74 Index Deletion : 0.00
% 6.95/2.74 Index Matching : 0.00
% 6.95/2.74 BG Taut test : 0.00
%------------------------------------------------------------------------------