TSTP Solution File: MGT044+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MGT044+1 : TPTP v8.1.2. Released v2.4.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 : n019.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:42 EDT 2023
% Result : Theorem 14.69s 5.09s
% Output : CNFRefutation 14.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of formulae : 32 ( 7 unt; 12 typ; 0 def)
% Number of atoms : 51 ( 7 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 49 ( 18 ~; 16 |; 7 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 9 >; 8 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 38 (; 38 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ smaller_or_equal > smaller > greater_or_equal > greater > organization > stock_of_knowledge > internal_friction > capability > age > #nlpp > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(organization,type,
organization: $i > $o ).
tff(internal_friction,type,
internal_friction: ( $i * $i ) > $i ).
tff(smaller,type,
smaller: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(capability,type,
capability: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(stock_of_knowledge,type,
stock_of_knowledge: ( $i * $i ) > $i ).
tff(age,type,
age: ( $i * $i ) > $i ).
tff(greater_or_equal,type,
greater_or_equal: ( $i * $i ) > $o ).
tff(smaller_or_equal,type,
smaller_or_equal: ( $i * $i ) > $o ).
tff(f_170,negated_conjecture,
~ ! [X,T0,T] :
( ( organization(X)
& greater(age(X,T),age(X,T0)) )
=> greater(capability(X,T),capability(X,T0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3) ).
tff(f_152,axiom,
! [X,T0,T] :
( ( organization(X)
& greater(age(X,T),age(X,T0)) )
=> greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_7) ).
tff(f_58,axiom,
! [X,Y] :
( smaller_or_equal(X,Y)
<=> ( smaller(X,Y)
| ( X = Y ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',definition_smaller_or_equal) ).
tff(f_158,axiom,
! [X,T0,T] :
( organization(X)
=> ( internal_friction(X,T) = internal_friction(X,T0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_9) ).
tff(f_142,axiom,
! [X,T0,T] :
( organization(X)
=> ( ( ( greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))
& smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) )
=> greater(capability(X,T),capability(X,T0)) )
& ( ( smaller_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0))
& greater(internal_friction(X,T),internal_friction(X,T0)) )
=> smaller(capability(X,T),capability(X,T0)) )
& ( ( ( stock_of_knowledge(X,T) = stock_of_knowledge(X,T0) )
& ( internal_friction(X,T) = internal_friction(X,T0) ) )
=> ( capability(X,T) = capability(X,T0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_5) ).
tff(c_36,plain,
greater(age('#skF_1','#skF_3'),age('#skF_1','#skF_2')),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_38,plain,
organization('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_30,plain,
! [X_17,T_19,T0_18] :
( greater(stock_of_knowledge(X_17,T_19),stock_of_knowledge(X_17,T0_18))
| ~ greater(age(X_17,T_19),age(X_17,T0_18))
| ~ organization(X_17) ),
inference(cnfTransformation,[status(thm)],[f_152]) ).
tff(c_4,plain,
! [Y_2] : smaller_or_equal(Y_2,Y_2),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_63,plain,
! [X_37,T_38,T0_39] :
( ( internal_friction(X_37,T_38) = internal_friction(X_37,T0_39) )
| ~ organization(X_37) ),
inference(cnfTransformation,[status(thm)],[f_158]) ).
tff(c_66,plain,
! [T_38,T0_39] : ( internal_friction('#skF_1',T_38) = internal_friction('#skF_1',T0_39) ),
inference(resolution,[status(thm)],[c_38,c_63]) ).
tff(c_3895,plain,
! [X_915,T_916,T0_917] :
( greater(capability(X_915,T_916),capability(X_915,T0_917))
| ~ smaller_or_equal(internal_friction(X_915,T_916),internal_friction(X_915,T0_917))
| ~ greater(stock_of_knowledge(X_915,T_916),stock_of_knowledge(X_915,T0_917))
| ~ organization(X_915) ),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_3938,plain,
! [T0_39,T0_917,T_38] :
( greater(capability('#skF_1',T0_39),capability('#skF_1',T0_917))
| ~ smaller_or_equal(internal_friction('#skF_1',T_38),internal_friction('#skF_1',T0_917))
| ~ greater(stock_of_knowledge('#skF_1',T0_39),stock_of_knowledge('#skF_1',T0_917))
| ~ organization('#skF_1') ),
inference(superposition,[status(thm),theory(equality)],[c_66,c_3895]) ).
tff(c_44059,plain,
! [T0_9456,T0_9457,T_9458] :
( greater(capability('#skF_1',T0_9456),capability('#skF_1',T0_9457))
| ~ smaller_or_equal(internal_friction('#skF_1',T_9458),internal_friction('#skF_1',T0_9457))
| ~ greater(stock_of_knowledge('#skF_1',T0_9456),stock_of_knowledge('#skF_1',T0_9457)) ),
inference(demodulation,[status(thm),theory(equality)],[c_38,c_3938]) ).
tff(c_44146,plain,
! [T0_9475,T_9476] :
( greater(capability('#skF_1',T0_9475),capability('#skF_1',T_9476))
| ~ greater(stock_of_knowledge('#skF_1',T0_9475),stock_of_knowledge('#skF_1',T_9476)) ),
inference(resolution,[status(thm)],[c_4,c_44059]) ).
tff(c_44259,plain,
! [T_19,T0_18] :
( greater(capability('#skF_1',T_19),capability('#skF_1',T0_18))
| ~ greater(age('#skF_1',T_19),age('#skF_1',T0_18))
| ~ organization('#skF_1') ),
inference(resolution,[status(thm)],[c_30,c_44146]) ).
tff(c_44295,plain,
! [T_9493,T0_9494] :
( greater(capability('#skF_1',T_9493),capability('#skF_1',T0_9494))
| ~ greater(age('#skF_1',T_9493),age('#skF_1',T0_9494)) ),
inference(demodulation,[status(thm),theory(equality)],[c_38,c_44259]) ).
tff(c_34,plain,
~ greater(capability('#skF_1','#skF_3'),capability('#skF_1','#skF_2')),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_44356,plain,
~ greater(age('#skF_1','#skF_3'),age('#skF_1','#skF_2')),
inference(resolution,[status(thm)],[c_44295,c_34]) ).
tff(c_44518,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_36,c_44356]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : MGT044+1 : TPTP v8.1.2. Released v2.4.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.17/0.35 % Computer : n019.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 20:33:47 EDT 2023
% 0.17/0.35 % CPUTime :
% 14.69/5.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.69/5.10
% 14.69/5.10 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 14.69/5.12
% 14.69/5.12 Inference rules
% 14.69/5.12 ----------------------
% 14.69/5.12 #Ref : 1
% 14.69/5.12 #Sup : 5336
% 14.69/5.12 #Fact : 153
% 14.69/5.12 #Define : 0
% 14.69/5.12 #Split : 7
% 14.69/5.12 #Chain : 0
% 14.69/5.12 #Close : 0
% 14.69/5.12
% 14.69/5.12 Ordering : KBO
% 14.69/5.12
% 14.69/5.12 Simplification rules
% 14.69/5.12 ----------------------
% 14.69/5.12 #Subsume : 1344
% 14.69/5.12 #Demod : 642
% 14.69/5.12 #Tautology : 265
% 14.69/5.12 #SimpNegUnit : 339
% 14.69/5.12 #BackRed : 55
% 14.69/5.12
% 14.69/5.12 #Partial instantiations: 7994
% 14.69/5.12 #Strategies tried : 1
% 14.69/5.12
% 14.69/5.12 Timing (in seconds)
% 14.69/5.12 ----------------------
% 14.69/5.12 Preprocessing : 0.52
% 14.69/5.12 Parsing : 0.25
% 14.69/5.12 CNF conversion : 0.03
% 14.69/5.12 Main loop : 3.51
% 14.69/5.12 Inferencing : 0.90
% 14.69/5.12 Reduction : 0.59
% 14.69/5.12 Demodulation : 0.38
% 14.69/5.12 BG Simplification : 0.09
% 14.69/5.12 Subsumption : 1.74
% 14.69/5.12 Abstraction : 0.12
% 14.69/5.12 MUC search : 0.00
% 14.69/5.12 Cooper : 0.00
% 14.69/5.12 Total : 4.08
% 14.69/5.12 Index Insertion : 0.00
% 14.69/5.12 Index Deletion : 0.00
% 14.69/5.12 Index Matching : 0.00
% 14.69/5.12 BG Taut test : 0.00
%------------------------------------------------------------------------------