TSTP Solution File: MGT014+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MGT014+1 : TPTP v8.1.2. Released v2.0.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 : n004.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:49:31 EDT 2023
% Result : Theorem 3.63s 1.89s
% Output : CNFRefutation 3.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of formulae : 57 ( 20 unt; 13 typ; 0 def)
% Number of atoms : 127 ( 12 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 146 ( 63 ~; 53 |; 23 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 6 >; 8 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 63 (; 63 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ size > reorganization_free > complexity > organization > greater > time > #nlpp > #skF_7 > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(reorganization_free,type,
reorganization_free: ( $i * $i * $i ) > $o ).
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(size,type,
size: ( $i * $i * $i ) > $o ).
tff(time,type,
time: $i > $o ).
tff(complexity,type,
complexity: ( $i * $i * $i ) > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(organization,type,
organization: ( $i * $i ) > $o ).
tff(f_34,axiom,
! [X,Y] :
~ ( greater(X,Y)
& ( X = Y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_1) ).
tff(f_123,negated_conjecture,
~ ! [X,C1,C2,S1,S2,T1,T2] :
( ( organization(X,T1)
& organization(X,T2)
& reorganization_free(X,T1,T2)
& complexity(X,C1,T1)
& complexity(X,C2,T2)
& size(X,S1,T1)
& size(X,S2,T2)
& greater(S2,S1) )
=> ~ greater(C1,C2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL) ).
tff(f_60,axiom,
! [X,T1,T2] :
( reorganization_free(X,T1,T2)
=> reorganization_free(X,T2,T1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp17) ).
tff(f_88,hypothesis,
! [X,S1,S2,T1,T2] :
( ( organization(X,T1)
& organization(X,T2)
& reorganization_free(X,T1,T2)
& size(X,S1,T1)
& size(X,S2,T2)
& greater(T2,T1) )
=> ~ greater(S1,S2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL) ).
tff(f_44,axiom,
! [X,T] :
( organization(X,T)
=> time(T) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp15) ).
tff(f_55,axiom,
! [T1,T2] :
( ( time(T1)
& time(T2) )
=> ( greater(T1,T2)
| ( T1 = T2 )
| greater(T2,T1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp16) ).
tff(f_103,hypothesis,
! [X,C1,C2,T1,T2] :
( ( organization(X,T1)
& organization(X,T2)
& reorganization_free(X,T1,T2)
& complexity(X,C1,T1)
& complexity(X,C2,T2)
& greater(T2,T1) )
=> ~ greater(C1,C2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL) ).
tff(f_73,axiom,
! [X,S1,S2,T1,T2] :
( ( organization(X,T1)
& organization(X,T2)
& size(X,S1,T1)
& size(X,S2,T2)
& ( T1 = T2 ) )
=> ( S1 = S2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp19) ).
tff(c_2,plain,
! [Y_2] : ~ greater(Y_2,Y_2),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_32,plain,
organization('#skF_1','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_30,plain,
reorganization_free('#skF_1','#skF_6','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_52,plain,
! [X_32,T2_33,T1_34] :
( reorganization_free(X_32,T2_33,T1_34)
| ~ reorganization_free(X_32,T1_34,T2_33) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_55,plain,
reorganization_free('#skF_1','#skF_7','#skF_6'),
inference(resolution,[status(thm)],[c_30,c_52]) ).
tff(c_22,plain,
size('#skF_1','#skF_5','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_34,plain,
organization('#skF_1','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_24,plain,
size('#skF_1','#skF_4','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_20,plain,
greater('#skF_5','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_118,plain,
! [T1_43,X_47,T2_45,S2_44,S1_46] :
( ~ greater(S1_46,S2_44)
| ~ greater(T2_45,T1_43)
| ~ size(X_47,S2_44,T2_45)
| ~ size(X_47,S1_46,T1_43)
| ~ reorganization_free(X_47,T1_43,T2_45)
| ~ organization(X_47,T2_45)
| ~ organization(X_47,T1_43) ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_132,plain,
! [T2_51,T1_52,X_53] :
( ~ greater(T2_51,T1_52)
| ~ size(X_53,'#skF_4',T2_51)
| ~ size(X_53,'#skF_5',T1_52)
| ~ reorganization_free(X_53,T1_52,T2_51)
| ~ organization(X_53,T2_51)
| ~ organization(X_53,T1_52) ),
inference(resolution,[status(thm)],[c_20,c_118]) ).
tff(c_134,plain,
! [T1_52] :
( ~ greater('#skF_6',T1_52)
| ~ size('#skF_1','#skF_5',T1_52)
| ~ reorganization_free('#skF_1',T1_52,'#skF_6')
| ~ organization('#skF_1','#skF_6')
| ~ organization('#skF_1',T1_52) ),
inference(resolution,[status(thm)],[c_24,c_132]) ).
tff(c_151,plain,
! [T1_59] :
( ~ greater('#skF_6',T1_59)
| ~ size('#skF_1','#skF_5',T1_59)
| ~ reorganization_free('#skF_1',T1_59,'#skF_6')
| ~ organization('#skF_1',T1_59) ),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_134]) ).
tff(c_154,plain,
( ~ greater('#skF_6','#skF_7')
| ~ reorganization_free('#skF_1','#skF_7','#skF_6')
| ~ organization('#skF_1','#skF_7') ),
inference(resolution,[status(thm)],[c_22,c_151]) ).
tff(c_157,plain,
~ greater('#skF_6','#skF_7'),
inference(demodulation,[status(thm),theory(equality)],[c_32,c_55,c_154]) ).
tff(c_36,plain,
! [T_28,X_29] :
( time(T_28)
| ~ organization(X_29,T_28) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_44,plain,
time('#skF_6'),
inference(resolution,[status(thm)],[c_34,c_36]) ).
tff(c_43,plain,
time('#skF_7'),
inference(resolution,[status(thm)],[c_32,c_36]) ).
tff(c_8,plain,
! [T2_8,T1_7] :
( greater(T2_8,T1_7)
| ( T2_8 = T1_7 )
| greater(T1_7,T2_8)
| ~ time(T2_8)
| ~ time(T1_7) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_28,plain,
complexity('#skF_1','#skF_2','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_26,plain,
complexity('#skF_1','#skF_3','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_18,plain,
greater('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_138,plain,
! [X_56,C1_54,C2_55,T2_58,T1_57] :
( ~ greater(C1_54,C2_55)
| ~ greater(T2_58,T1_57)
| ~ complexity(X_56,C2_55,T2_58)
| ~ complexity(X_56,C1_54,T1_57)
| ~ reorganization_free(X_56,T1_57,T2_58)
| ~ organization(X_56,T2_58)
| ~ organization(X_56,T1_57) ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_160,plain,
! [T2_60,T1_61,X_62] :
( ~ greater(T2_60,T1_61)
| ~ complexity(X_62,'#skF_3',T2_60)
| ~ complexity(X_62,'#skF_2',T1_61)
| ~ reorganization_free(X_62,T1_61,T2_60)
| ~ organization(X_62,T2_60)
| ~ organization(X_62,T1_61) ),
inference(resolution,[status(thm)],[c_18,c_138]) ).
tff(c_166,plain,
( ~ greater('#skF_7','#skF_6')
| ~ complexity('#skF_1','#skF_3','#skF_7')
| ~ complexity('#skF_1','#skF_2','#skF_6')
| ~ organization('#skF_1','#skF_7')
| ~ organization('#skF_1','#skF_6') ),
inference(resolution,[status(thm)],[c_30,c_160]) ).
tff(c_172,plain,
~ greater('#skF_7','#skF_6'),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_32,c_28,c_26,c_166]) ).
tff(c_188,plain,
( ( '#skF_7' = '#skF_6' )
| greater('#skF_6','#skF_7')
| ~ time('#skF_7')
| ~ time('#skF_6') ),
inference(resolution,[status(thm)],[c_8,c_172]) ).
tff(c_194,plain,
( ( '#skF_7' = '#skF_6' )
| greater('#skF_6','#skF_7') ),
inference(demodulation,[status(thm),theory(equality)],[c_44,c_43,c_188]) ).
tff(c_195,plain,
'#skF_7' = '#skF_6',
inference(negUnitSimplification,[status(thm)],[c_157,c_194]) ).
tff(c_207,plain,
size('#skF_1','#skF_5','#skF_6'),
inference(demodulation,[status(thm),theory(equality)],[c_195,c_22]) ).
tff(c_95,plain,
! [S2_37,S1_38,X_39,T2_40] :
( ( S2_37 = S1_38 )
| ~ size(X_39,S2_37,T2_40)
| ~ size(X_39,S1_38,T2_40)
| ~ organization(X_39,T2_40) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_97,plain,
! [S1_38] :
( ( S1_38 = '#skF_4' )
| ~ size('#skF_1',S1_38,'#skF_6')
| ~ organization('#skF_1','#skF_6') ),
inference(resolution,[status(thm)],[c_24,c_95]) ).
tff(c_102,plain,
! [S1_38] :
( ( S1_38 = '#skF_4' )
| ~ size('#skF_1',S1_38,'#skF_6') ),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_97]) ).
tff(c_227,plain,
'#skF_5' = '#skF_4',
inference(resolution,[status(thm)],[c_207,c_102]) ).
tff(c_236,plain,
greater('#skF_4','#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_227,c_20]) ).
tff(c_239,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2,c_236]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT014+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/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 : n004.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 20:27:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 3.63/1.89 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.63/1.89
% 3.63/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.63/1.93
% 3.63/1.93 Inference rules
% 3.63/1.93 ----------------------
% 3.63/1.93 #Ref : 0
% 3.63/1.93 #Sup : 33
% 3.63/1.93 #Fact : 2
% 3.63/1.93 #Define : 0
% 3.63/1.93 #Split : 0
% 3.63/1.93 #Chain : 0
% 3.63/1.93 #Close : 0
% 3.63/1.93
% 3.63/1.93 Ordering : KBO
% 3.63/1.93
% 3.63/1.93 Simplification rules
% 3.63/1.93 ----------------------
% 3.63/1.93 #Subsume : 6
% 3.63/1.93 #Demod : 41
% 3.63/1.93 #Tautology : 13
% 3.63/1.93 #SimpNegUnit : 5
% 3.63/1.93 #BackRed : 15
% 3.63/1.93
% 3.63/1.93 #Partial instantiations: 0
% 3.63/1.93 #Strategies tried : 1
% 3.63/1.93
% 3.63/1.93 Timing (in seconds)
% 3.63/1.93 ----------------------
% 3.63/1.93 Preprocessing : 0.50
% 3.63/1.93 Parsing : 0.27
% 3.63/1.93 CNF conversion : 0.03
% 3.63/1.93 Main loop : 0.36
% 3.63/1.93 Inferencing : 0.16
% 3.63/1.93 Reduction : 0.09
% 3.63/1.93 Demodulation : 0.06
% 3.63/1.93 BG Simplification : 0.02
% 3.63/1.93 Subsumption : 0.07
% 3.63/1.93 Abstraction : 0.01
% 3.63/1.93 MUC search : 0.00
% 3.63/1.93 Cooper : 0.00
% 3.63/1.93 Total : 0.92
% 3.63/1.93 Index Insertion : 0.00
% 3.63/1.93 Index Deletion : 0.00
% 3.63/1.93 Index Matching : 0.00
% 3.63/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------