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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n031.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   : Unsatisfiable 9.73s 3.43s
% Output   : CNFRefutation 9.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   34 (  10 unt;  12 typ;   0 def)
%            Number of atoms       :   44 (   4 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   47 (  25   ~;  22   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 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   :   35 (;  35   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ smaller_or_equal > smaller > greater_or_equal > greater > organization > stock_of_knowledge > internal_friction > capability > age > #nlpp > sk3 > sk2 > sk1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(greater,type,
    greater: ( $i * $i ) > $o ).

tff(sk2,type,
    sk2: $i ).

tff(organization,type,
    organization: $i > $o ).

tff(sk1,type,
    sk1: $i ).

tff(internal_friction,type,
    internal_friction: ( $i * $i ) > $i ).

tff(smaller,type,
    smaller: ( $i * $i ) > $o ).

tff(capability,type,
    capability: ( $i * $i ) > $i ).

tff(stock_of_knowledge,type,
    stock_of_knowledge: ( $i * $i ) > $i ).

tff(age,type,
    age: ( $i * $i ) > $i ).

tff(sk3,type,
    sk3: $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_160,axiom,
    greater(age(sk1,sk3),age(sk1,sk2)),
    file(unknown,unknown) ).

tff(f_159,axiom,
    organization(sk1),
    file(unknown,unknown) ).

tff(f_153,axiom,
    ! [A,B,C] :
      ( ~ organization(A)
      | ~ greater(age(A,B),age(A,C))
      | greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) ),
    file(unknown,unknown) ).

tff(f_63,axiom,
    ! [A,B] :
      ( ( A != B )
      | smaller_or_equal(A,B) ),
    file(unknown,unknown) ).

tff(f_158,axiom,
    ! [A,B,C] :
      ( ~ organization(A)
      | ( internal_friction(A,B) = internal_friction(A,C) ) ),
    file(unknown,unknown) ).

tff(f_123,axiom,
    ! [A,B,C] :
      ( ~ organization(A)
      | ~ greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C))
      | ~ smaller_or_equal(internal_friction(A,B),internal_friction(A,C))
      | greater(capability(A,B),capability(A,C)) ),
    file(unknown,unknown) ).

tff(f_162,axiom,
    ~ greater(capability(sk1,sk3),capability(sk1,sk2)),
    file(unknown,unknown) ).

tff(c_36,plain,
    greater(age(sk1,sk3),age(sk1,sk2)),
    inference(cnfTransformation,[status(thm)],[f_160]) ).

tff(c_34,plain,
    organization(sk1),
    inference(cnfTransformation,[status(thm)],[f_159]) ).

tff(c_30,plain,
    ! [A_33,B_34,C_35] :
      ( greater(stock_of_knowledge(A_33,B_34),stock_of_knowledge(A_33,C_35))
      | ~ greater(age(A_33,B_34),age(A_33,C_35))
      | ~ organization(A_33) ),
    inference(cnfTransformation,[status(thm)],[f_153]) ).

tff(c_6,plain,
    ! [B_6] : smaller_or_equal(B_6,B_6),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_63,plain,
    ! [A_53,C_54,B_55] :
      ( ( internal_friction(A_53,C_54) = internal_friction(A_53,B_55) )
      | ~ organization(A_53) ),
    inference(cnfTransformation,[status(thm)],[f_158]) ).

tff(c_66,plain,
    ! [C_54,B_55] : ( internal_friction(sk1,C_54) = internal_friction(sk1,B_55) ),
    inference(resolution,[status(thm)],[c_34,c_63]) ).

tff(c_5736,plain,
    ! [A_1251,B_1252,C_1253] :
      ( greater(capability(A_1251,B_1252),capability(A_1251,C_1253))
      | ~ smaller_or_equal(internal_friction(A_1251,B_1252),internal_friction(A_1251,C_1253))
      | ~ greater(stock_of_knowledge(A_1251,B_1252),stock_of_knowledge(A_1251,C_1253))
      | ~ organization(A_1251) ),
    inference(cnfTransformation,[status(thm)],[f_123]) ).

tff(c_5739,plain,
    ! [B_55,C_1253,C_54] :
      ( greater(capability(sk1,B_55),capability(sk1,C_1253))
      | ~ smaller_or_equal(internal_friction(sk1,C_54),internal_friction(sk1,C_1253))
      | ~ greater(stock_of_knowledge(sk1,B_55),stock_of_knowledge(sk1,C_1253))
      | ~ organization(sk1) ),
    inference(superposition,[status(thm),theory(equality)],[c_66,c_5736]) ).

tff(c_17326,plain,
    ! [B_3753,C_3754,C_3755] :
      ( greater(capability(sk1,B_3753),capability(sk1,C_3754))
      | ~ smaller_or_equal(internal_friction(sk1,C_3755),internal_friction(sk1,C_3754))
      | ~ greater(stock_of_knowledge(sk1,B_3753),stock_of_knowledge(sk1,C_3754)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_5739]) ).

tff(c_17485,plain,
    ! [B_3788,C_3789] :
      ( greater(capability(sk1,B_3788),capability(sk1,C_3789))
      | ~ greater(stock_of_knowledge(sk1,B_3788),stock_of_knowledge(sk1,C_3789)) ),
    inference(resolution,[status(thm)],[c_6,c_17326]) ).

tff(c_17704,plain,
    ! [B_34,C_35] :
      ( greater(capability(sk1,B_34),capability(sk1,C_35))
      | ~ greater(age(sk1,B_34),age(sk1,C_35))
      | ~ organization(sk1) ),
    inference(resolution,[status(thm)],[c_30,c_17485]) ).

tff(c_17739,plain,
    ! [B_3822,C_3823] :
      ( greater(capability(sk1,B_3822),capability(sk1,C_3823))
      | ~ greater(age(sk1,B_3822),age(sk1,C_3823)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_17704]) ).

tff(c_38,plain,
    ~ greater(capability(sk1,sk3),capability(sk1,sk2)),
    inference(cnfTransformation,[status(thm)],[f_162]) ).

tff(c_17792,plain,
    ~ greater(age(sk1,sk3),age(sk1,sk2)),
    inference(resolution,[status(thm)],[c_17739,c_38]) ).

tff(c_18084,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_36,c_17792]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : MGT044-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.15  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.37  % Computer : n031.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit : 300
% 0.14/0.37  % WCLimit  : 300
% 0.14/0.37  % DateTime : Thu Aug  3 20:57:14 EDT 2023
% 0.22/0.37  % CPUTime  : 
% 9.73/3.43  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.73/3.44  
% 9.73/3.44  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.73/3.47  
% 9.73/3.47  Inference rules
% 9.73/3.47  ----------------------
% 9.73/3.47  #Ref     : 2
% 9.73/3.47  #Sup     : 2302
% 9.73/3.47  #Fact    : 104
% 9.73/3.47  #Define  : 0
% 9.73/3.47  #Split   : 4
% 9.73/3.47  #Chain   : 0
% 9.73/3.47  #Close   : 0
% 9.73/3.47  
% 9.73/3.47  Ordering : KBO
% 9.73/3.47  
% 9.73/3.47  Simplification rules
% 9.73/3.47  ----------------------
% 9.73/3.47  #Subsume      : 609
% 9.73/3.47  #Demod        : 159
% 9.73/3.47  #Tautology    : 59
% 9.73/3.47  #SimpNegUnit  : 51
% 9.73/3.47  #BackRed      : 1
% 9.73/3.47  
% 9.73/3.47  #Partial instantiations: 3094
% 9.73/3.47  #Strategies tried      : 1
% 9.73/3.47  
% 9.73/3.47  Timing (in seconds)
% 9.73/3.47  ----------------------
% 9.73/3.47  Preprocessing        : 0.49
% 9.73/3.47  Parsing              : 0.23
% 9.73/3.47  CNF conversion       : 0.03
% 9.73/3.47  Main loop            : 1.91
% 9.73/3.47  Inferencing          : 0.59
% 9.73/3.47  Reduction            : 0.39
% 9.73/3.47  Demodulation         : 0.25
% 9.73/3.47  BG Simplification    : 0.06
% 9.73/3.47  Subsumption          : 0.77
% 9.73/3.47  Abstraction          : 0.08
% 9.73/3.47  MUC search           : 0.00
% 9.73/3.47  Cooper               : 0.00
% 9.73/3.47  Total                : 2.45
% 9.73/3.47  Index Insertion      : 0.00
% 9.73/3.47  Index Deletion       : 0.00
% 9.73/3.47  Index Matching       : 0.00
% 9.73/3.47  BG Taut test         : 0.00
%------------------------------------------------------------------------------