TSTP Solution File: MGT008+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MGT008+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 : n012.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:29 EDT 2023
% Result : Theorem 3.49s 1.83s
% Output : CNFRefutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 21
% Syntax : Number of formulae : 53 ( 16 unt; 17 typ; 0 def)
% Number of atoms : 165 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 234 ( 105 ~; 99 |; 26 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 8 >; 13 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 99 (; 98 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ survival_chance > size > reorganization_free > inertia > class > organization > greater > #nlpp > #skF_7 > #skF_10 > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_9 > #skF_8 > #skF_4 > #skF_1
%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('#skF_7',type,
'#skF_7': $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(inertia,type,
inertia: ( $i * $i * $i ) > $o ).
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(survival_chance,type,
survival_chance: ( $i * $i * $i ) > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff(class,type,
class: ( $i * $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(organization,type,
organization: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_100,negated_conjecture,
~ ! [X,Y,C,P1,P2,S1,S2,T1,T2] :
( ( organization(X,T1)
& organization(Y,T2)
& reorganization_free(X,T1,T1)
& reorganization_free(Y,T2,T2)
& class(X,C,T1)
& class(Y,C,T2)
& survival_chance(X,P1,T1)
& survival_chance(Y,P2,T2)
& size(X,S1,T1)
& size(Y,S2,T2)
& greater(S2,S1) )
=> greater(P2,P1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL) ).
tff(f_32,axiom,
! [X,T] :
( organization(X,T)
=> ? [I] : inertia(X,I,T) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).
tff(f_54,hypothesis,
! [X,Y,C,S1,S2,I1,I2,T1,T2] :
( ( organization(X,T1)
& organization(Y,T2)
& class(X,C,T1)
& class(Y,C,T2)
& size(X,S1,T1)
& size(Y,S2,T2)
& inertia(X,I1,T1)
& inertia(Y,I2,T2)
& greater(S2,S1) )
=> greater(I2,I1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5_FOL) ).
tff(f_74,hypothesis,
! [X,Y,T1,T2,I1,I2,P1,P2] :
( ( organization(X,T1)
& organization(Y,T2)
& reorganization_free(X,T1,T1)
& reorganization_free(Y,T2,T2)
& inertia(X,I1,T1)
& inertia(Y,I2,T2)
& survival_chance(X,P1,T1)
& survival_chance(Y,P2,T2)
& greater(I2,I1) )
=> greater(P2,P1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_FOL) ).
tff(c_30,plain,
organization('#skF_2','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_22,plain,
class('#skF_2','#skF_4','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_14,plain,
size('#skF_2','#skF_7','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_2,plain,
! [X_1,T_2] :
( inertia(X_1,'#skF_1'(X_1,T_2),T_2)
| ~ organization(X_1,T_2) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_8,plain,
~ greater('#skF_6','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_26,plain,
reorganization_free('#skF_2','#skF_9','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_18,plain,
survival_chance('#skF_2','#skF_5','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_28,plain,
organization('#skF_3','#skF_10'),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_24,plain,
reorganization_free('#skF_3','#skF_10','#skF_10'),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_16,plain,
survival_chance('#skF_3','#skF_6','#skF_10'),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_12,plain,
size('#skF_3','#skF_8','#skF_10'),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_20,plain,
class('#skF_3','#skF_4','#skF_10'),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_10,plain,
greater('#skF_8','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_47,plain,
! [C_42,I2_39,X_43,T1_41,I1_45,S1_44,T2_37,Y_40,S2_38] :
( greater(I2_39,I1_45)
| ~ greater(S2_38,S1_44)
| ~ inertia(Y_40,I2_39,T2_37)
| ~ inertia(X_43,I1_45,T1_41)
| ~ size(Y_40,S2_38,T2_37)
| ~ size(X_43,S1_44,T1_41)
| ~ class(Y_40,C_42,T2_37)
| ~ class(X_43,C_42,T1_41)
| ~ organization(Y_40,T2_37)
| ~ organization(X_43,T1_41) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_53,plain,
! [Y_47,I1_52,T1_50,T2_49,I2_51,C_48,X_46] :
( greater(I2_51,I1_52)
| ~ inertia(Y_47,I2_51,T2_49)
| ~ inertia(X_46,I1_52,T1_50)
| ~ size(Y_47,'#skF_8',T2_49)
| ~ size(X_46,'#skF_7',T1_50)
| ~ class(Y_47,C_48,T2_49)
| ~ class(X_46,C_48,T1_50)
| ~ organization(Y_47,T2_49)
| ~ organization(X_46,T1_50) ),
inference(resolution,[status(thm)],[c_10,c_47]) ).
tff(c_57,plain,
! [T_53,I1_56,X_58,X_55,C_57,T1_54] :
( greater('#skF_1'(X_55,T_53),I1_56)
| ~ inertia(X_58,I1_56,T1_54)
| ~ size(X_55,'#skF_8',T_53)
| ~ size(X_58,'#skF_7',T1_54)
| ~ class(X_55,C_57,T_53)
| ~ class(X_58,C_57,T1_54)
| ~ organization(X_58,T1_54)
| ~ organization(X_55,T_53) ),
inference(resolution,[status(thm)],[c_2,c_53]) ).
tff(c_61,plain,
! [X_60,C_62,T_61,T_59,X_63] :
( greater('#skF_1'(X_63,T_61),'#skF_1'(X_60,T_59))
| ~ size(X_63,'#skF_8',T_61)
| ~ size(X_60,'#skF_7',T_59)
| ~ class(X_63,C_62,T_61)
| ~ class(X_60,C_62,T_59)
| ~ organization(X_63,T_61)
| ~ organization(X_60,T_59) ),
inference(resolution,[status(thm)],[c_2,c_57]) ).
tff(c_63,plain,
! [X_60,T_59] :
( greater('#skF_1'('#skF_3','#skF_10'),'#skF_1'(X_60,T_59))
| ~ size('#skF_3','#skF_8','#skF_10')
| ~ size(X_60,'#skF_7',T_59)
| ~ class(X_60,'#skF_4',T_59)
| ~ organization('#skF_3','#skF_10')
| ~ organization(X_60,T_59) ),
inference(resolution,[status(thm)],[c_20,c_61]) ).
tff(c_72,plain,
! [X_64,T_65] :
( greater('#skF_1'('#skF_3','#skF_10'),'#skF_1'(X_64,T_65))
| ~ size(X_64,'#skF_7',T_65)
| ~ class(X_64,'#skF_4',T_65)
| ~ organization(X_64,T_65) ),
inference(demodulation,[status(thm),theory(equality)],[c_28,c_12,c_63]) ).
tff(c_6,plain,
! [Y_14,P2_20,T1_15,T2_16,I1_17,P1_19,X_13,I2_18] :
( greater(P2_20,P1_19)
| ~ greater(I2_18,I1_17)
| ~ survival_chance(Y_14,P2_20,T2_16)
| ~ survival_chance(X_13,P1_19,T1_15)
| ~ inertia(Y_14,I2_18,T2_16)
| ~ inertia(X_13,I1_17,T1_15)
| ~ reorganization_free(Y_14,T2_16,T2_16)
| ~ reorganization_free(X_13,T1_15,T1_15)
| ~ organization(Y_14,T2_16)
| ~ organization(X_13,T1_15) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_89,plain,
! [T2_90,X_93,Y_94,P1_97,T1_96,X_95,T_91,P2_92] :
( greater(P2_92,P1_97)
| ~ survival_chance(Y_94,P2_92,T2_90)
| ~ survival_chance(X_93,P1_97,T1_96)
| ~ inertia(Y_94,'#skF_1'('#skF_3','#skF_10'),T2_90)
| ~ inertia(X_93,'#skF_1'(X_95,T_91),T1_96)
| ~ reorganization_free(Y_94,T2_90,T2_90)
| ~ reorganization_free(X_93,T1_96,T1_96)
| ~ organization(Y_94,T2_90)
| ~ organization(X_93,T1_96)
| ~ size(X_95,'#skF_7',T_91)
| ~ class(X_95,'#skF_4',T_91)
| ~ organization(X_95,T_91) ),
inference(resolution,[status(thm)],[c_72,c_6]) ).
tff(c_93,plain,
! [X_93,P1_97,T1_96,X_95,T_91] :
( greater('#skF_6',P1_97)
| ~ survival_chance(X_93,P1_97,T1_96)
| ~ inertia('#skF_3','#skF_1'('#skF_3','#skF_10'),'#skF_10')
| ~ inertia(X_93,'#skF_1'(X_95,T_91),T1_96)
| ~ reorganization_free('#skF_3','#skF_10','#skF_10')
| ~ reorganization_free(X_93,T1_96,T1_96)
| ~ organization('#skF_3','#skF_10')
| ~ organization(X_93,T1_96)
| ~ size(X_95,'#skF_7',T_91)
| ~ class(X_95,'#skF_4',T_91)
| ~ organization(X_95,T_91) ),
inference(resolution,[status(thm)],[c_16,c_89]) ).
tff(c_99,plain,
! [X_93,P1_97,T1_96,X_95,T_91] :
( greater('#skF_6',P1_97)
| ~ survival_chance(X_93,P1_97,T1_96)
| ~ inertia('#skF_3','#skF_1'('#skF_3','#skF_10'),'#skF_10')
| ~ inertia(X_93,'#skF_1'(X_95,T_91),T1_96)
| ~ reorganization_free(X_93,T1_96,T1_96)
| ~ organization(X_93,T1_96)
| ~ size(X_95,'#skF_7',T_91)
| ~ class(X_95,'#skF_4',T_91)
| ~ organization(X_95,T_91) ),
inference(demodulation,[status(thm),theory(equality)],[c_28,c_24,c_93]) ).
tff(c_101,plain,
~ inertia('#skF_3','#skF_1'('#skF_3','#skF_10'),'#skF_10'),
inference(splitLeft,[status(thm)],[c_99]) ).
tff(c_104,plain,
~ organization('#skF_3','#skF_10'),
inference(resolution,[status(thm)],[c_2,c_101]) ).
tff(c_108,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_104]) ).
tff(c_131,plain,
! [T_101,P1_102,T1_100,X_98,X_99] :
( greater('#skF_6',P1_102)
| ~ survival_chance(X_98,P1_102,T1_100)
| ~ inertia(X_98,'#skF_1'(X_99,T_101),T1_100)
| ~ reorganization_free(X_98,T1_100,T1_100)
| ~ organization(X_98,T1_100)
| ~ size(X_99,'#skF_7',T_101)
| ~ class(X_99,'#skF_4',T_101)
| ~ organization(X_99,T_101) ),
inference(splitRight,[status(thm)],[c_99]) ).
tff(c_133,plain,
! [X_99,T_101] :
( greater('#skF_6','#skF_5')
| ~ inertia('#skF_2','#skF_1'(X_99,T_101),'#skF_9')
| ~ reorganization_free('#skF_2','#skF_9','#skF_9')
| ~ organization('#skF_2','#skF_9')
| ~ size(X_99,'#skF_7',T_101)
| ~ class(X_99,'#skF_4',T_101)
| ~ organization(X_99,T_101) ),
inference(resolution,[status(thm)],[c_18,c_131]) ).
tff(c_138,plain,
! [X_99,T_101] :
( greater('#skF_6','#skF_5')
| ~ inertia('#skF_2','#skF_1'(X_99,T_101),'#skF_9')
| ~ size(X_99,'#skF_7',T_101)
| ~ class(X_99,'#skF_4',T_101)
| ~ organization(X_99,T_101) ),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_26,c_133]) ).
tff(c_143,plain,
! [X_103,T_104] :
( ~ inertia('#skF_2','#skF_1'(X_103,T_104),'#skF_9')
| ~ size(X_103,'#skF_7',T_104)
| ~ class(X_103,'#skF_4',T_104)
| ~ organization(X_103,T_104) ),
inference(negUnitSimplification,[status(thm)],[c_8,c_138]) ).
tff(c_147,plain,
( ~ size('#skF_2','#skF_7','#skF_9')
| ~ class('#skF_2','#skF_4','#skF_9')
| ~ organization('#skF_2','#skF_9') ),
inference(resolution,[status(thm)],[c_2,c_143]) ).
tff(c_151,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_30,c_22,c_14,c_147]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT008+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/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.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 20:25:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.49/1.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.49/1.83
% 3.49/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.71/1.87
% 3.71/1.87 Inference rules
% 3.71/1.87 ----------------------
% 3.71/1.87 #Ref : 0
% 3.71/1.87 #Sup : 22
% 3.71/1.87 #Fact : 0
% 3.71/1.87 #Define : 0
% 3.71/1.87 #Split : 5
% 3.71/1.87 #Chain : 0
% 3.71/1.87 #Close : 0
% 3.71/1.87
% 3.71/1.87 Ordering : KBO
% 3.71/1.87
% 3.71/1.87 Simplification rules
% 3.71/1.87 ----------------------
% 3.71/1.87 #Subsume : 0
% 3.71/1.87 #Demod : 24
% 3.71/1.87 #Tautology : 0
% 3.71/1.87 #SimpNegUnit : 1
% 3.71/1.87 #BackRed : 0
% 3.71/1.87
% 3.71/1.87 #Partial instantiations: 0
% 3.71/1.87 #Strategies tried : 1
% 3.71/1.87
% 3.71/1.87 Timing (in seconds)
% 3.71/1.87 ----------------------
% 3.71/1.87 Preprocessing : 0.46
% 3.71/1.87 Parsing : 0.26
% 3.71/1.87 CNF conversion : 0.03
% 3.71/1.87 Main loop : 0.31
% 3.71/1.87 Inferencing : 0.14
% 3.71/1.87 Reduction : 0.08
% 3.71/1.87 Demodulation : 0.06
% 3.71/1.87 BG Simplification : 0.02
% 3.71/1.87 Subsumption : 0.06
% 3.71/1.87 Abstraction : 0.01
% 3.74/1.87 MUC search : 0.00
% 3.74/1.87 Cooper : 0.00
% 3.74/1.87 Total : 0.82
% 3.74/1.87 Index Insertion : 0.00
% 3.74/1.87 Index Deletion : 0.00
% 3.74/1.87 Index Matching : 0.00
% 3.74/1.87 BG Taut test : 0.00
%------------------------------------------------------------------------------