TSTP Solution File: MGT003+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MGT003+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 : n006.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:27 EDT 2023
% Result : Theorem 3.16s 1.73s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 42 ( 10 unt; 11 typ; 0 def)
% Number of atoms : 142 ( 0 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 204 ( 93 ~; 87 |; 19 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 6 >; 9 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 84 (; 83 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ survival_chance > reorganization_free > inertia > organization > greater > #nlpp > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #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(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_4',type,
'#skF_4': $i ).
tff(organization,type,
organization: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_87,negated_conjecture,
~ ! [X,P1,P2,T1,T2] :
( ( organization(X,T1)
& organization(X,T2)
& reorganization_free(X,T1,T2)
& survival_chance(X,P1,T1)
& survival_chance(X,P2,T2)
& greater(T2,T1) )
=> greater(P2,P1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL) ).
tff(f_38,axiom,
! [X,T] :
( organization(X,T)
=> ? [I] : inertia(X,I,T) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).
tff(f_33,axiom,
! [X,T1,T2] :
( reorganization_free(X,T1,T2)
=> ( reorganization_free(X,T1,T1)
& reorganization_free(X,T2,T2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4) ).
tff(f_72,hypothesis,
! [X,I1,I2,T1,T2] :
( ( organization(X,T1)
& organization(X,T2)
& reorganization_free(X,T1,T2)
& inertia(X,I1,T1)
& inertia(X,I2,T2)
& greater(T2,T1) )
=> greater(I2,I1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL) ).
tff(f_58,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_24,plain,
organization('#skF_2','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_20,plain,
reorganization_free('#skF_2','#skF_5','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_14,plain,
greater('#skF_6','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_6,plain,
! [X_4,T_5] :
( inertia(X_4,'#skF_1'(X_4,T_5),T_5)
| ~ organization(X_4,T_5) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_22,plain,
organization('#skF_2','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_12,plain,
~ greater('#skF_4','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_25,plain,
! [X_20,T1_21,T2_22] :
( reorganization_free(X_20,T1_21,T1_21)
| ~ reorganization_free(X_20,T1_21,T2_22) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_28,plain,
reorganization_free('#skF_2','#skF_5','#skF_5'),
inference(resolution,[status(thm)],[c_20,c_25]) ).
tff(c_18,plain,
survival_chance('#skF_2','#skF_3','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_33,plain,
! [X_23,T2_24,T1_25] :
( reorganization_free(X_23,T2_24,T2_24)
| ~ reorganization_free(X_23,T1_25,T2_24) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_40,plain,
reorganization_free('#skF_2','#skF_6','#skF_6'),
inference(resolution,[status(thm)],[c_20,c_33]) ).
tff(c_16,plain,
survival_chance('#skF_2','#skF_4','#skF_6'),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_50,plain,
! [T2_29,T1_32,I2_30,X_31,I1_28] :
( greater(I2_30,I1_28)
| ~ greater(T2_29,T1_32)
| ~ inertia(X_31,I2_30,T2_29)
| ~ inertia(X_31,I1_28,T1_32)
| ~ reorganization_free(X_31,T1_32,T2_29)
| ~ organization(X_31,T2_29)
| ~ organization(X_31,T1_32) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_54,plain,
! [X_33,T_34,I1_35,T1_36] :
( greater('#skF_1'(X_33,T_34),I1_35)
| ~ greater(T_34,T1_36)
| ~ inertia(X_33,I1_35,T1_36)
| ~ reorganization_free(X_33,T1_36,T_34)
| ~ organization(X_33,T1_36)
| ~ organization(X_33,T_34) ),
inference(resolution,[status(thm)],[c_6,c_50]) ).
tff(c_57,plain,
! [X_4,T_34,T_5] :
( greater('#skF_1'(X_4,T_34),'#skF_1'(X_4,T_5))
| ~ greater(T_34,T_5)
| ~ reorganization_free(X_4,T_5,T_34)
| ~ organization(X_4,T_34)
| ~ organization(X_4,T_5) ),
inference(resolution,[status(thm)],[c_6,c_54]) ).
tff(c_59,plain,
! [X_43,P2_40,T2_42,P1_47,I1_46,I2_45,T1_44,Y_41] :
( greater(P2_40,P1_47)
| ~ greater(I2_45,I1_46)
| ~ survival_chance(Y_41,P2_40,T2_42)
| ~ survival_chance(X_43,P1_47,T1_44)
| ~ inertia(Y_41,I2_45,T2_42)
| ~ inertia(X_43,I1_46,T1_44)
| ~ reorganization_free(Y_41,T2_42,T2_42)
| ~ reorganization_free(X_43,T1_44,T1_44)
| ~ organization(Y_41,T2_42)
| ~ organization(X_43,T1_44) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_79,plain,
! [P1_57,X_54,T_56,T1_58,X_61,T2_60,Y_59,P2_55,T_62] :
( greater(P2_55,P1_57)
| ~ survival_chance(Y_59,P2_55,T2_60)
| ~ survival_chance(X_54,P1_57,T1_58)
| ~ inertia(Y_59,'#skF_1'(X_61,T_56),T2_60)
| ~ inertia(X_54,'#skF_1'(X_61,T_62),T1_58)
| ~ reorganization_free(Y_59,T2_60,T2_60)
| ~ reorganization_free(X_54,T1_58,T1_58)
| ~ organization(Y_59,T2_60)
| ~ organization(X_54,T1_58)
| ~ greater(T_56,T_62)
| ~ reorganization_free(X_61,T_62,T_56)
| ~ organization(X_61,T_56)
| ~ organization(X_61,T_62) ),
inference(resolution,[status(thm)],[c_57,c_59]) ).
tff(c_81,plain,
! [P1_57,X_54,T_56,T1_58,X_61,T_62] :
( greater('#skF_4',P1_57)
| ~ survival_chance(X_54,P1_57,T1_58)
| ~ inertia('#skF_2','#skF_1'(X_61,T_56),'#skF_6')
| ~ inertia(X_54,'#skF_1'(X_61,T_62),T1_58)
| ~ reorganization_free('#skF_2','#skF_6','#skF_6')
| ~ reorganization_free(X_54,T1_58,T1_58)
| ~ organization('#skF_2','#skF_6')
| ~ organization(X_54,T1_58)
| ~ greater(T_56,T_62)
| ~ reorganization_free(X_61,T_62,T_56)
| ~ organization(X_61,T_56)
| ~ organization(X_61,T_62) ),
inference(resolution,[status(thm)],[c_16,c_79]) ).
tff(c_90,plain,
! [X_68,X_65,T1_67,T_66,P1_63,T_64] :
( greater('#skF_4',P1_63)
| ~ survival_chance(X_65,P1_63,T1_67)
| ~ inertia('#skF_2','#skF_1'(X_68,T_64),'#skF_6')
| ~ inertia(X_65,'#skF_1'(X_68,T_66),T1_67)
| ~ reorganization_free(X_65,T1_67,T1_67)
| ~ organization(X_65,T1_67)
| ~ greater(T_64,T_66)
| ~ reorganization_free(X_68,T_66,T_64)
| ~ organization(X_68,T_64)
| ~ organization(X_68,T_66) ),
inference(demodulation,[status(thm),theory(equality)],[c_22,c_40,c_81]) ).
tff(c_94,plain,
! [X_68,T_64,T_66] :
( greater('#skF_4','#skF_3')
| ~ inertia('#skF_2','#skF_1'(X_68,T_64),'#skF_6')
| ~ inertia('#skF_2','#skF_1'(X_68,T_66),'#skF_5')
| ~ reorganization_free('#skF_2','#skF_5','#skF_5')
| ~ organization('#skF_2','#skF_5')
| ~ greater(T_64,T_66)
| ~ reorganization_free(X_68,T_66,T_64)
| ~ organization(X_68,T_64)
| ~ organization(X_68,T_66) ),
inference(resolution,[status(thm)],[c_18,c_90]) ).
tff(c_100,plain,
! [X_68,T_64,T_66] :
( greater('#skF_4','#skF_3')
| ~ inertia('#skF_2','#skF_1'(X_68,T_64),'#skF_6')
| ~ inertia('#skF_2','#skF_1'(X_68,T_66),'#skF_5')
| ~ greater(T_64,T_66)
| ~ reorganization_free(X_68,T_66,T_64)
| ~ organization(X_68,T_64)
| ~ organization(X_68,T_66) ),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_28,c_94]) ).
tff(c_102,plain,
! [X_69,T_70,T_71] :
( ~ inertia('#skF_2','#skF_1'(X_69,T_70),'#skF_6')
| ~ inertia('#skF_2','#skF_1'(X_69,T_71),'#skF_5')
| ~ greater(T_70,T_71)
| ~ reorganization_free(X_69,T_71,T_70)
| ~ organization(X_69,T_70)
| ~ organization(X_69,T_71) ),
inference(negUnitSimplification,[status(thm)],[c_12,c_100]) ).
tff(c_105,plain,
! [T_71] :
( ~ inertia('#skF_2','#skF_1'('#skF_2',T_71),'#skF_5')
| ~ greater('#skF_6',T_71)
| ~ reorganization_free('#skF_2',T_71,'#skF_6')
| ~ organization('#skF_2',T_71)
| ~ organization('#skF_2','#skF_6') ),
inference(resolution,[status(thm)],[c_6,c_102]) ).
tff(c_109,plain,
! [T_72] :
( ~ inertia('#skF_2','#skF_1'('#skF_2',T_72),'#skF_5')
| ~ greater('#skF_6',T_72)
| ~ reorganization_free('#skF_2',T_72,'#skF_6')
| ~ organization('#skF_2',T_72) ),
inference(demodulation,[status(thm),theory(equality)],[c_22,c_105]) ).
tff(c_113,plain,
( ~ greater('#skF_6','#skF_5')
| ~ reorganization_free('#skF_2','#skF_5','#skF_6')
| ~ organization('#skF_2','#skF_5') ),
inference(resolution,[status(thm)],[c_6,c_109]) ).
tff(c_117,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_20,c_14,c_113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : MGT003+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % 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 : n006.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:28:13 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.16/1.73 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.16/1.74
% 3.16/1.74 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.16/1.77
% 3.16/1.77 Inference rules
% 3.16/1.77 ----------------------
% 3.16/1.77 #Ref : 0
% 3.16/1.77 #Sup : 18
% 3.16/1.77 #Fact : 0
% 3.16/1.77 #Define : 0
% 3.16/1.77 #Split : 2
% 3.16/1.77 #Chain : 0
% 3.16/1.77 #Close : 0
% 3.16/1.77
% 3.16/1.77 Ordering : KBO
% 3.16/1.77
% 3.16/1.77 Simplification rules
% 3.16/1.77 ----------------------
% 3.16/1.77 #Subsume : 0
% 3.16/1.77 #Demod : 20
% 3.16/1.77 #Tautology : 4
% 3.16/1.77 #SimpNegUnit : 1
% 3.16/1.77 #BackRed : 0
% 3.16/1.77
% 3.16/1.77 #Partial instantiations: 0
% 3.16/1.77 #Strategies tried : 1
% 3.16/1.77
% 3.16/1.77 Timing (in seconds)
% 3.16/1.77 ----------------------
% 3.16/1.78 Preprocessing : 0.44
% 3.16/1.78 Parsing : 0.25
% 3.16/1.78 CNF conversion : 0.03
% 3.16/1.78 Main loop : 0.29
% 3.16/1.78 Inferencing : 0.12
% 3.16/1.78 Reduction : 0.06
% 3.16/1.78 Demodulation : 0.05
% 3.16/1.78 BG Simplification : 0.02
% 3.16/1.78 Subsumption : 0.07
% 3.16/1.78 Abstraction : 0.01
% 3.16/1.78 MUC search : 0.00
% 3.16/1.78 Cooper : 0.00
% 3.16/1.78 Total : 0.78
% 3.16/1.78 Index Insertion : 0.00
% 3.16/1.78 Index Deletion : 0.00
% 3.16/1.78 Index Matching : 0.00
% 3.16/1.78 BG Taut test : 0.00
%------------------------------------------------------------------------------