TSTP Solution File: MGT059-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : MGT059-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 : 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:45 EDT 2023

% Result   : Unsatisfiable 3.28s 1.74s
% Output   : CNFRefutation 3.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   33 (  12 unt;  17 typ;   0 def)
%            Number of atoms       :   22 (   9 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   15 (   9   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 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  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :    4 (;   4   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ smaller_or_equal > smaller > positional_advantage > is_aligned > has_immunity > greater_or_equal > greater > organization > hazard_of_mortality > #nlpp > very_low > sk3 > sk2 > sk1 > mod2 > mod1 > low > high

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(mod1,type,
    mod1: $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,axiom,
    organization(sk1),
    file(unknown,unknown) ).

tff(f_172,axiom,
    has_immunity(sk1,sk3),
    file(unknown,unknown) ).

tff(f_121,axiom,
    ! [A,B] :
      ( ~ organization(A)
      | ~ has_immunity(A,B)
      | ( hazard_of_mortality(A,B) = very_low ) ),
    file(unknown,unknown) ).

tff(f_171,axiom,
    has_immunity(sk1,sk2),
    file(unknown,unknown) ).

tff(f_174,axiom,
    hazard_of_mortality(sk1,sk2) != hazard_of_mortality(sk1,sk3),
    file(unknown,unknown) ).

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

tff(c_38,plain,
    has_immunity(sk1,sk3),
    inference(cnfTransformation,[status(thm)],[f_172]) ).

tff(c_100,plain,
    ! [A_54,B_55] :
      ( ( hazard_of_mortality(A_54,B_55) = very_low )
      | ~ has_immunity(A_54,B_55)
      | ~ organization(A_54) ),
    inference(cnfTransformation,[status(thm)],[f_121]) ).

tff(c_106,plain,
    ( ( hazard_of_mortality(sk1,sk3) = very_low )
    | ~ organization(sk1) ),
    inference(resolution,[status(thm)],[c_38,c_100]) ).

tff(c_112,plain,
    hazard_of_mortality(sk1,sk3) = very_low,
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_106]) ).

tff(c_36,plain,
    has_immunity(sk1,sk2),
    inference(cnfTransformation,[status(thm)],[f_171]) ).

tff(c_103,plain,
    ( ( hazard_of_mortality(sk1,sk2) = very_low )
    | ~ organization(sk1) ),
    inference(resolution,[status(thm)],[c_36,c_100]) ).

tff(c_109,plain,
    hazard_of_mortality(sk1,sk2) = very_low,
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_103]) ).

tff(c_40,plain,
    hazard_of_mortality(sk1,sk3) != hazard_of_mortality(sk1,sk2),
    inference(cnfTransformation,[status(thm)],[f_174]) ).

tff(c_113,plain,
    hazard_of_mortality(sk1,sk3) != very_low,
    inference(demodulation,[status(thm),theory(equality)],[c_109,c_40]) ).

tff(c_123,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_112,c_113]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : MGT059-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13  % 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.16/0.34  % Computer : n029.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Thu Aug  3 20:47:37 EDT 2023
% 0.16/0.34  % CPUTime  : 
% 3.28/1.74  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.28/1.74  
% 3.28/1.74  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.28/1.77  
% 3.28/1.77  Inference rules
% 3.28/1.77  ----------------------
% 3.28/1.77  #Ref     : 0
% 3.28/1.77  #Sup     : 14
% 3.28/1.77  #Fact    : 2
% 3.28/1.77  #Define  : 0
% 3.28/1.77  #Split   : 0
% 3.28/1.77  #Chain   : 0
% 3.28/1.77  #Close   : 0
% 3.28/1.77  
% 3.28/1.77  Ordering : KBO
% 3.28/1.77  
% 3.28/1.77  Simplification rules
% 3.28/1.77  ----------------------
% 3.28/1.77  #Subsume      : 0
% 3.28/1.77  #Demod        : 4
% 3.28/1.77  #Tautology    : 13
% 3.28/1.77  #SimpNegUnit  : 0
% 3.28/1.77  #BackRed      : 1
% 3.28/1.77  
% 3.28/1.77  #Partial instantiations: 0
% 3.28/1.77  #Strategies tried      : 1
% 3.28/1.77  
% 3.28/1.77  Timing (in seconds)
% 3.28/1.77  ----------------------
% 3.28/1.78  Preprocessing        : 0.50
% 3.28/1.78  Parsing              : 0.23
% 3.28/1.78  CNF conversion       : 0.03
% 3.28/1.78  Main loop            : 0.22
% 3.28/1.78  Inferencing          : 0.08
% 3.28/1.78  Reduction            : 0.06
% 3.28/1.78  Demodulation         : 0.04
% 3.28/1.78  BG Simplification    : 0.02
% 3.28/1.78  Subsumption          : 0.05
% 3.28/1.78  Abstraction          : 0.01
% 3.28/1.78  MUC search           : 0.00
% 3.28/1.78  Cooper               : 0.00
% 3.28/1.78  Total                : 0.77
% 3.28/1.78  Index Insertion      : 0.00
% 3.28/1.78  Index Deletion       : 0.00
% 3.28/1.78  Index Matching       : 0.00
% 3.28/1.78  BG Taut test         : 0.00
%------------------------------------------------------------------------------