TSTP Solution File: SEU159+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU159+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/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:57:50 EDT 2023
% Result : Theorem 7.03s 2.83s
% Output : CNFRefutation 7.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 76 ( 34 unt; 12 typ; 0 def)
% Number of atoms : 107 ( 21 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 74 ( 31 ~; 37 |; 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 : 14 ( 6 >; 8 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 46 (; 46 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > unordered_pair > #nlpp > #skF_1 > #skF_7 > #skF_3 > #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(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(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('#skF_9',type,
'#skF_9': $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_59,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_33,axiom,
! [A,B] : ( unordered_pair(A,B) = unordered_pair(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
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_38,plain,
( in('#skF_4','#skF_6')
| ~ in('#skF_8','#skF_9')
| ~ in('#skF_7','#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_122,plain,
~ in('#skF_7','#skF_9'),
inference(splitLeft,[status(thm)],[c_38]) ).
tff(c_4,plain,
! [B_4,A_3] : ( unordered_pair(B_4,A_3) = unordered_pair(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_44,plain,
( in('#skF_4','#skF_6')
| subset(unordered_pair('#skF_7','#skF_8'),'#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_45,plain,
( in('#skF_4','#skF_6')
| subset(unordered_pair('#skF_8','#skF_7'),'#skF_9') ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_44]) ).
tff(c_107,plain,
subset(unordered_pair('#skF_8','#skF_7'),'#skF_9'),
inference(splitLeft,[status(thm)],[c_45]) ).
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_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_168,plain,
! [D_43,B_44,A_45] :
( in(D_43,B_44)
| ~ subset(unordered_pair(A_45,D_43),B_44) ),
inference(resolution,[status(thm)],[c_8,c_158]) ).
tff(c_171,plain,
in('#skF_7','#skF_9'),
inference(resolution,[status(thm)],[c_107,c_168]) ).
tff(c_185,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_122,c_171]) ).
tff(c_187,plain,
in('#skF_7','#skF_9'),
inference(splitRight,[status(thm)],[c_38]) ).
tff(c_186,plain,
( ~ in('#skF_8','#skF_9')
| in('#skF_4','#skF_6') ),
inference(splitRight,[status(thm)],[c_38]) ).
tff(c_191,plain,
~ in('#skF_8','#skF_9'),
inference(splitLeft,[status(thm)],[c_186]) ).
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_229,plain,
! [C_55,B_56,A_57] :
( in(C_55,B_56)
| ~ in(C_55,A_57)
| ~ subset(A_57,B_56) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_250,plain,
! [D_59,B_60,B_61] :
( in(D_59,B_60)
| ~ subset(unordered_pair(D_59,B_61),B_60) ),
inference(resolution,[status(thm)],[c_10,c_229]) ).
tff(c_253,plain,
in('#skF_8','#skF_9'),
inference(resolution,[status(thm)],[c_107,c_250]) ).
tff(c_267,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_191,c_253]) ).
tff(c_269,plain,
in('#skF_8','#skF_9'),
inference(splitRight,[status(thm)],[c_186]) ).
tff(c_34,plain,
( ~ subset(unordered_pair('#skF_4','#skF_5'),'#skF_6')
| ~ in('#skF_8','#skF_9')
| ~ in('#skF_7','#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_292,plain,
~ subset(unordered_pair('#skF_4','#skF_5'),'#skF_6'),
inference(demodulation,[status(thm),theory(equality)],[c_187,c_269,c_34]) ).
tff(c_36,plain,
( in('#skF_5','#skF_6')
| ~ in('#skF_8','#skF_9')
| ~ in('#skF_7','#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_274,plain,
( in('#skF_5','#skF_6')
| ~ in('#skF_8','#skF_9') ),
inference(demodulation,[status(thm),theory(equality)],[c_187,c_36]) ).
tff(c_275,plain,
~ in('#skF_8','#skF_9'),
inference(splitLeft,[status(thm)],[c_274]) ).
tff(c_280,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_269,c_275]) ).
tff(c_281,plain,
in('#skF_5','#skF_6'),
inference(splitRight,[status(thm)],[c_274]) ).
tff(c_268,plain,
in('#skF_4','#skF_6'),
inference(splitRight,[status(thm)],[c_186]) ).
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_327,plain,
! [D_71,B_72,A_73] :
( ( D_71 = B_72 )
| ( D_71 = A_73 )
| ~ in(D_71,unordered_pair(A_73,B_72)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_3079,plain,
! [A_2219,B_2220,B_2221] :
( ( '#skF_3'(unordered_pair(A_2219,B_2220),B_2221) = B_2220 )
| ( '#skF_3'(unordered_pair(A_2219,B_2220),B_2221) = A_2219 )
| subset(unordered_pair(A_2219,B_2220),B_2221) ),
inference(resolution,[status(thm)],[c_28,c_327]) ).
tff(c_3311,plain,
( ( '#skF_3'(unordered_pair('#skF_4','#skF_5'),'#skF_6') = '#skF_5' )
| ( '#skF_3'(unordered_pair('#skF_4','#skF_5'),'#skF_6') = '#skF_4' ) ),
inference(resolution,[status(thm)],[c_3079,c_292]) ).
tff(c_3312,plain,
'#skF_3'(unordered_pair('#skF_4','#skF_5'),'#skF_6') = '#skF_4',
inference(splitLeft,[status(thm)],[c_3311]) ).
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_3330,plain,
( ~ in('#skF_4','#skF_6')
| subset(unordered_pair('#skF_4','#skF_5'),'#skF_6') ),
inference(superposition,[status(thm),theory(equality)],[c_3312,c_26]) ).
tff(c_3435,plain,
subset(unordered_pair('#skF_4','#skF_5'),'#skF_6'),
inference(demodulation,[status(thm),theory(equality)],[c_268,c_3330]) ).
tff(c_3437,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_292,c_3435]) ).
tff(c_3438,plain,
'#skF_3'(unordered_pair('#skF_4','#skF_5'),'#skF_6') = '#skF_5',
inference(splitRight,[status(thm)],[c_3311]) ).
tff(c_3457,plain,
( ~ in('#skF_5','#skF_6')
| subset(unordered_pair('#skF_4','#skF_5'),'#skF_6') ),
inference(superposition,[status(thm),theory(equality)],[c_3438,c_26]) ).
tff(c_3562,plain,
subset(unordered_pair('#skF_4','#skF_5'),'#skF_6'),
inference(demodulation,[status(thm),theory(equality)],[c_281,c_3457]) ).
tff(c_3564,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_292,c_3562]) ).
tff(c_3566,plain,
~ subset(unordered_pair('#skF_8','#skF_7'),'#skF_9'),
inference(splitRight,[status(thm)],[c_45]) ).
tff(c_40,plain,
( ~ subset(unordered_pair('#skF_4','#skF_5'),'#skF_6')
| subset(unordered_pair('#skF_7','#skF_8'),'#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_46,plain,
( ~ subset(unordered_pair('#skF_4','#skF_5'),'#skF_6')
| subset(unordered_pair('#skF_8','#skF_7'),'#skF_9') ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_40]) ).
tff(c_3702,plain,
~ subset(unordered_pair('#skF_4','#skF_5'),'#skF_6'),
inference(negUnitSimplification,[status(thm)],[c_3566,c_46]) ).
tff(c_42,plain,
( in('#skF_5','#skF_6')
| subset(unordered_pair('#skF_7','#skF_8'),'#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_47,plain,
( in('#skF_5','#skF_6')
| subset(unordered_pair('#skF_8','#skF_7'),'#skF_9') ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_42]) ).
tff(c_3578,plain,
in('#skF_5','#skF_6'),
inference(negUnitSimplification,[status(thm)],[c_3566,c_47]) ).
tff(c_3565,plain,
in('#skF_4','#skF_6'),
inference(splitRight,[status(thm)],[c_45]) ).
tff(c_3602,plain,
! [D_2322,B_2323,A_2324] :
( ( D_2322 = B_2323 )
| ( D_2322 = A_2324 )
| ~ in(D_2322,unordered_pair(A_2324,B_2323)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_5550,plain,
! [A_3856,B_3857,B_3858] :
( ( '#skF_3'(unordered_pair(A_3856,B_3857),B_3858) = B_3857 )
| ( '#skF_3'(unordered_pair(A_3856,B_3857),B_3858) = A_3856 )
| subset(unordered_pair(A_3856,B_3857),B_3858) ),
inference(resolution,[status(thm)],[c_28,c_3602]) ).
tff(c_5768,plain,
( ( '#skF_3'(unordered_pair('#skF_4','#skF_5'),'#skF_6') = '#skF_5' )
| ( '#skF_3'(unordered_pair('#skF_4','#skF_5'),'#skF_6') = '#skF_4' ) ),
inference(resolution,[status(thm)],[c_5550,c_3702]) ).
tff(c_5772,plain,
'#skF_3'(unordered_pair('#skF_4','#skF_5'),'#skF_6') = '#skF_4',
inference(splitLeft,[status(thm)],[c_5768]) ).
tff(c_5791,plain,
( ~ in('#skF_4','#skF_6')
| subset(unordered_pair('#skF_4','#skF_5'),'#skF_6') ),
inference(superposition,[status(thm),theory(equality)],[c_5772,c_26]) ).
tff(c_5894,plain,
subset(unordered_pair('#skF_4','#skF_5'),'#skF_6'),
inference(demodulation,[status(thm),theory(equality)],[c_3565,c_5791]) ).
tff(c_5896,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_3702,c_5894]) ).
tff(c_5897,plain,
'#skF_3'(unordered_pair('#skF_4','#skF_5'),'#skF_6') = '#skF_5',
inference(splitRight,[status(thm)],[c_5768]) ).
tff(c_5918,plain,
( ~ in('#skF_5','#skF_6')
| subset(unordered_pair('#skF_4','#skF_5'),'#skF_6') ),
inference(superposition,[status(thm),theory(equality)],[c_5897,c_26]) ).
tff(c_6021,plain,
subset(unordered_pair('#skF_4','#skF_5'),'#skF_6'),
inference(demodulation,[status(thm),theory(equality)],[c_3578,c_5918]) ).
tff(c_6023,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_3702,c_6021]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU159+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.15 % 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.36 % Computer : n001.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 12:01:39 EDT 2023
% 0.14/0.36 % CPUTime :
% 7.03/2.83 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.03/2.84
% 7.03/2.84 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.03/2.88
% 7.03/2.88 Inference rules
% 7.03/2.88 ----------------------
% 7.03/2.88 #Ref : 0
% 7.03/2.88 #Sup : 941
% 7.03/2.88 #Fact : 8
% 7.03/2.88 #Define : 0
% 7.03/2.88 #Split : 19
% 7.03/2.88 #Chain : 0
% 7.03/2.88 #Close : 0
% 7.03/2.88
% 7.03/2.88 Ordering : KBO
% 7.03/2.88
% 7.03/2.88 Simplification rules
% 7.03/2.88 ----------------------
% 7.03/2.88 #Subsume : 137
% 7.03/2.88 #Demod : 50
% 7.03/2.88 #Tautology : 155
% 7.03/2.88 #SimpNegUnit : 28
% 7.03/2.88 #BackRed : 0
% 7.03/2.88
% 7.03/2.88 #Partial instantiations: 3720
% 7.03/2.88 #Strategies tried : 1
% 7.03/2.88
% 7.03/2.88 Timing (in seconds)
% 7.03/2.88 ----------------------
% 7.03/2.88 Preprocessing : 0.48
% 7.03/2.88 Parsing : 0.25
% 7.03/2.88 CNF conversion : 0.04
% 7.03/2.88 Main loop : 1.30
% 7.03/2.88 Inferencing : 0.65
% 7.03/2.88 Reduction : 0.31
% 7.03/2.88 Demodulation : 0.22
% 7.03/2.88 BG Simplification : 0.06
% 7.03/2.88 Subsumption : 0.21
% 7.03/2.88 Abstraction : 0.05
% 7.03/2.88 MUC search : 0.00
% 7.03/2.88 Cooper : 0.00
% 7.03/2.88 Total : 1.85
% 7.03/2.88 Index Insertion : 0.00
% 7.03/2.88 Index Deletion : 0.00
% 7.03/2.88 Index Matching : 0.00
% 7.03/2.88 BG Taut test : 0.00
%------------------------------------------------------------------------------