TSTP Solution File: MGT009+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MGT009+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 : n029.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:30 EDT 2023
% Result : Theorem 3.43s 1.85s
% Output : CNFRefutation 3.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 21
% Syntax : Number of formulae : 49 ( 14 unt; 17 typ; 0 def)
% Number of atoms : 154 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 216 ( 94 ~; 92 |; 25 &)
% ( 1 <=>; 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 : 97 (; 96 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ size > reproducibility > 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(reproducibility,type,
reproducibility: ( $i * $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('#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_101,negated_conjecture,
~ ! [X,Y,C,Rp1,Rp2,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)
& reproducibility(X,Rp1,T1)
& reproducibility(Y,Rp2,T2)
& size(X,S1,T1)
& size(Y,S2,T2)
& greater(S2,S1) )
=> greater(Rp2,Rp1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_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_76,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_54,hypothesis,
! [X,Y,T1,T2,Rp1,Rp2,I1,I2] :
( ( organization(X,T1)
& organization(Y,T2)
& reorganization_free(X,T1,T1)
& reorganization_free(Y,T2,T2)
& reproducibility(X,Rp1,T1)
& reproducibility(Y,Rp2,T2)
& inertia(X,I1,T1)
& inertia(Y,I2,T2) )
=> ( greater(Rp2,Rp1)
<=> greater(I2,I1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3_FOL) ).
tff(c_10,plain,
~ greater('#skF_6','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_32,plain,
organization('#skF_2','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_24,plain,
class('#skF_2','#skF_4','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_16,plain,
size('#skF_2','#skF_7','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_28,plain,
reorganization_free('#skF_2','#skF_9','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_20,plain,
reproducibility('#skF_2','#skF_5','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_18,plain,
reproducibility('#skF_3','#skF_6','#skF_10'),
inference(cnfTransformation,[status(thm)],[f_101]) ).
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_30,plain,
organization('#skF_3','#skF_10'),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_26,plain,
reorganization_free('#skF_3','#skF_10','#skF_10'),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_14,plain,
size('#skF_3','#skF_8','#skF_10'),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_22,plain,
class('#skF_3','#skF_4','#skF_10'),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_12,plain,
greater('#skF_8','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_49,plain,
! [X_40,S2_39,S1_42,T2_37,C_44,T1_45,I1_43,I2_38,Y_41] :
( greater(I2_38,I1_43)
| ~ greater(S2_39,S1_42)
| ~ inertia(Y_41,I2_38,T2_37)
| ~ inertia(X_40,I1_43,T1_45)
| ~ size(Y_41,S2_39,T2_37)
| ~ size(X_40,S1_42,T1_45)
| ~ class(Y_41,C_44,T2_37)
| ~ class(X_40,C_44,T1_45)
| ~ organization(Y_41,T2_37)
| ~ organization(X_40,T1_45) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_55,plain,
! [T2_50,X_47,T1_49,C_52,I1_46,Y_51,I2_48] :
( greater(I2_48,I1_46)
| ~ inertia(Y_51,I2_48,T2_50)
| ~ inertia(X_47,I1_46,T1_49)
| ~ size(Y_51,'#skF_8',T2_50)
| ~ size(X_47,'#skF_7',T1_49)
| ~ class(Y_51,C_52,T2_50)
| ~ class(X_47,C_52,T1_49)
| ~ organization(Y_51,T2_50)
| ~ organization(X_47,T1_49) ),
inference(resolution,[status(thm)],[c_12,c_49]) ).
tff(c_59,plain,
! [T1_55,T_53,X_54,C_58,X_56,I1_57] :
( greater('#skF_1'(X_56,T_53),I1_57)
| ~ inertia(X_54,I1_57,T1_55)
| ~ size(X_56,'#skF_8',T_53)
| ~ size(X_54,'#skF_7',T1_55)
| ~ class(X_56,C_58,T_53)
| ~ class(X_54,C_58,T1_55)
| ~ organization(X_54,T1_55)
| ~ organization(X_56,T_53) ),
inference(resolution,[status(thm)],[c_2,c_55]) ).
tff(c_63,plain,
! [X_61,C_60,T_59,T_62,X_63] :
( greater('#skF_1'(X_63,T_62),'#skF_1'(X_61,T_59))
| ~ size(X_63,'#skF_8',T_62)
| ~ size(X_61,'#skF_7',T_59)
| ~ class(X_63,C_60,T_62)
| ~ class(X_61,C_60,T_59)
| ~ organization(X_63,T_62)
| ~ organization(X_61,T_59) ),
inference(resolution,[status(thm)],[c_2,c_59]) ).
tff(c_65,plain,
! [X_61,T_59] :
( greater('#skF_1'('#skF_3','#skF_10'),'#skF_1'(X_61,T_59))
| ~ size('#skF_3','#skF_8','#skF_10')
| ~ size(X_61,'#skF_7',T_59)
| ~ class(X_61,'#skF_4',T_59)
| ~ organization('#skF_3','#skF_10')
| ~ organization(X_61,T_59) ),
inference(resolution,[status(thm)],[c_22,c_63]) ).
tff(c_74,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_30,c_14,c_65]) ).
tff(c_4,plain,
! [Rp2_9,T1_6,Rp1_8,X_4,I1_10,Y_5,T2_7,I2_11] :
( greater(Rp2_9,Rp1_8)
| ~ greater(I2_11,I1_10)
| ~ inertia(Y_5,I2_11,T2_7)
| ~ inertia(X_4,I1_10,T1_6)
| ~ reproducibility(Y_5,Rp2_9,T2_7)
| ~ reproducibility(X_4,Rp1_8,T1_6)
| ~ reorganization_free(Y_5,T2_7,T2_7)
| ~ reorganization_free(X_4,T1_6,T1_6)
| ~ organization(Y_5,T2_7)
| ~ organization(X_4,T1_6) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_127,plain,
! [Rp1_135,Y_131,X_133,T2_129,Rp2_132,T_128,T1_130,X_134] :
( greater(Rp2_132,Rp1_135)
| ~ inertia(Y_131,'#skF_1'('#skF_3','#skF_10'),T2_129)
| ~ inertia(X_134,'#skF_1'(X_133,T_128),T1_130)
| ~ reproducibility(Y_131,Rp2_132,T2_129)
| ~ reproducibility(X_134,Rp1_135,T1_130)
| ~ reorganization_free(Y_131,T2_129,T2_129)
| ~ reorganization_free(X_134,T1_130,T1_130)
| ~ organization(Y_131,T2_129)
| ~ organization(X_134,T1_130)
| ~ size(X_133,'#skF_7',T_128)
| ~ class(X_133,'#skF_4',T_128)
| ~ organization(X_133,T_128) ),
inference(resolution,[status(thm)],[c_74,c_4]) ).
tff(c_130,plain,
! [Rp1_135,X_133,Rp2_132,T_128,T1_130,X_134] :
( greater(Rp2_132,Rp1_135)
| ~ inertia(X_134,'#skF_1'(X_133,T_128),T1_130)
| ~ reproducibility('#skF_3',Rp2_132,'#skF_10')
| ~ reproducibility(X_134,Rp1_135,T1_130)
| ~ reorganization_free('#skF_3','#skF_10','#skF_10')
| ~ reorganization_free(X_134,T1_130,T1_130)
| ~ organization(X_134,T1_130)
| ~ size(X_133,'#skF_7',T_128)
| ~ class(X_133,'#skF_4',T_128)
| ~ organization(X_133,T_128)
| ~ organization('#skF_3','#skF_10') ),
inference(resolution,[status(thm)],[c_2,c_127]) ).
tff(c_134,plain,
! [T_137,X_136,Rp1_140,T1_141,Rp2_138,X_139] :
( greater(Rp2_138,Rp1_140)
| ~ inertia(X_139,'#skF_1'(X_136,T_137),T1_141)
| ~ reproducibility('#skF_3',Rp2_138,'#skF_10')
| ~ reproducibility(X_139,Rp1_140,T1_141)
| ~ reorganization_free(X_139,T1_141,T1_141)
| ~ organization(X_139,T1_141)
| ~ size(X_136,'#skF_7',T_137)
| ~ class(X_136,'#skF_4',T_137)
| ~ organization(X_136,T_137) ),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_26,c_130]) ).
tff(c_138,plain,
! [Rp2_142,Rp1_143,X_144,T_145] :
( greater(Rp2_142,Rp1_143)
| ~ reproducibility('#skF_3',Rp2_142,'#skF_10')
| ~ reproducibility(X_144,Rp1_143,T_145)
| ~ reorganization_free(X_144,T_145,T_145)
| ~ size(X_144,'#skF_7',T_145)
| ~ class(X_144,'#skF_4',T_145)
| ~ organization(X_144,T_145) ),
inference(resolution,[status(thm)],[c_2,c_134]) ).
tff(c_142,plain,
! [Rp1_146,X_147,T_148] :
( greater('#skF_6',Rp1_146)
| ~ reproducibility(X_147,Rp1_146,T_148)
| ~ reorganization_free(X_147,T_148,T_148)
| ~ size(X_147,'#skF_7',T_148)
| ~ class(X_147,'#skF_4',T_148)
| ~ organization(X_147,T_148) ),
inference(resolution,[status(thm)],[c_18,c_138]) ).
tff(c_144,plain,
( greater('#skF_6','#skF_5')
| ~ reorganization_free('#skF_2','#skF_9','#skF_9')
| ~ size('#skF_2','#skF_7','#skF_9')
| ~ class('#skF_2','#skF_4','#skF_9')
| ~ organization('#skF_2','#skF_9') ),
inference(resolution,[status(thm)],[c_20,c_142]) ).
tff(c_149,plain,
greater('#skF_6','#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_32,c_24,c_16,c_28,c_144]) ).
tff(c_151,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10,c_149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : MGT009+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.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 20:48:37 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.43/1.85 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.43/1.86
% 3.43/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.80/1.90
% 3.80/1.90 Inference rules
% 3.80/1.90 ----------------------
% 3.80/1.90 #Ref : 0
% 3.80/1.90 #Sup : 25
% 3.80/1.90 #Fact : 0
% 3.80/1.90 #Define : 0
% 3.80/1.90 #Split : 5
% 3.80/1.90 #Chain : 0
% 3.80/1.90 #Close : 0
% 3.80/1.90
% 3.80/1.90 Ordering : KBO
% 3.80/1.90
% 3.80/1.90 Simplification rules
% 3.80/1.90 ----------------------
% 3.80/1.90 #Subsume : 0
% 3.80/1.90 #Demod : 15
% 3.80/1.90 #Tautology : 0
% 3.80/1.90 #SimpNegUnit : 1
% 3.80/1.90 #BackRed : 0
% 3.80/1.90
% 3.80/1.90 #Partial instantiations: 0
% 3.80/1.90 #Strategies tried : 1
% 3.80/1.90
% 3.80/1.90 Timing (in seconds)
% 3.80/1.90 ----------------------
% 3.80/1.90 Preprocessing : 0.46
% 3.80/1.90 Parsing : 0.26
% 3.80/1.90 CNF conversion : 0.03
% 3.80/1.90 Main loop : 0.36
% 3.80/1.90 Inferencing : 0.16
% 3.80/1.90 Reduction : 0.09
% 3.80/1.90 Demodulation : 0.06
% 3.80/1.90 BG Simplification : 0.02
% 3.80/1.90 Subsumption : 0.09
% 3.80/1.90 Abstraction : 0.01
% 3.80/1.90 MUC search : 0.00
% 3.80/1.90 Cooper : 0.00
% 3.80/1.90 Total : 0.88
% 3.80/1.90 Index Insertion : 0.00
% 3.80/1.90 Index Deletion : 0.00
% 3.80/1.90 Index Matching : 0.00
% 3.80/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------