TSTP Solution File: MSC017+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : MSC017+1 : TPTP v8.1.2. Released v4.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:51 EDT 2023

% Result   : Theorem 2.96s 1.71s
% Output   : CNFRefutation 2.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   35 (   6 unt;  14 typ;   0 def)
%            Number of atoms       :   52 (   4 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   57 (  26   ~;  20   |;   2   &)
%                                         (   2 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (   8   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   17 (;  17   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ outcome > greater > dive > bad > padi > #nlpp > time > nitrogen > depth > time_limit > nitrogen_limit > depth_limit > dci > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

tff(depth,type,
    depth: $i > $i ).

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

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

tff('#skF_2',type,
    '#skF_2': $i ).

tff('#skF_1',type,
    '#skF_1': $i ).

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

tff(nitrogen,type,
    nitrogen: $i > $i ).

tff(time,type,
    time: $i > $i ).

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

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

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

tff(f_76,negated_conjecture,
    ~ ! [D] :
        ( dive(D)
       => ! [O] :
            ( outcome(D,O)
           => ~ bad(O) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_bad) ).

tff(f_57,axiom,
    ! [D] :
      ( dive(D)
     => ! [O] :
          ( ( outcome(D,O)
            & bad(O) )
         => ( O = dci ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dci_is_the_only_bad_outcome) ).

tff(f_45,axiom,
    ! [D] :
      ( dive(D)
     => ( greater(nitrogen(D),nitrogen_limit)
      <=> outcome(D,dci) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',too_much_nitrogen) ).

tff(f_37,axiom,
    ! [D] :
      ( dive(D)
     => ( ( greater(depth(D),depth_limit)
          | greater(time(D),time_limit) )
      <=> greater(nitrogen(D),nitrogen_limit) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',depth_and_time_and_nitrogen) ).

tff(f_66,axiom,
    ! [D] :
      ( dive(D)
     => ( ~ greater(depth(D),depth_limit)
        & ~ greater(time(D),time_limit) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_deep_long) ).

tff(c_26,plain,
    dive('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_76]) ).

tff(c_24,plain,
    outcome('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_76]) ).

tff(c_22,plain,
    bad('#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_76]) ).

tff(c_29,plain,
    ! [O_11,D_12] :
      ( ( dci = O_11 )
      | ~ bad(O_11)
      | ~ outcome(D_12,O_11)
      | ~ dive(D_12) ),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_32,plain,
    ( ( dci = '#skF_2' )
    | ~ bad('#skF_2')
    | ~ dive('#skF_1') ),
    inference(resolution,[status(thm)],[c_24,c_29]) ).

tff(c_35,plain,
    dci = '#skF_2',
    inference(demodulation,[status(thm),theory(equality)],[c_26,c_22,c_32]) ).

tff(c_10,plain,
    ! [D_3] :
      ( greater(nitrogen(D_3),nitrogen_limit)
      | ~ outcome(D_3,dci)
      | ~ dive(D_3) ),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_54,plain,
    ! [D_3] :
      ( greater(nitrogen(D_3),nitrogen_limit)
      | ~ outcome(D_3,'#skF_2')
      | ~ dive(D_3) ),
    inference(demodulation,[status(thm),theory(equality)],[c_35,c_10]) ).

tff(c_68,plain,
    ! [D_18] :
      ( greater(time(D_18),time_limit)
      | greater(depth(D_18),depth_limit)
      | ~ greater(nitrogen(D_18),nitrogen_limit)
      | ~ dive(D_18) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_18,plain,
    ! [D_7] :
      ( ~ greater(time(D_7),time_limit)
      | ~ dive(D_7) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_73,plain,
    ! [D_19] :
      ( greater(depth(D_19),depth_limit)
      | ~ greater(nitrogen(D_19),nitrogen_limit)
      | ~ dive(D_19) ),
    inference(resolution,[status(thm)],[c_68,c_18]) ).

tff(c_78,plain,
    ! [D_20] :
      ( greater(depth(D_20),depth_limit)
      | ~ outcome(D_20,'#skF_2')
      | ~ dive(D_20) ),
    inference(resolution,[status(thm)],[c_54,c_73]) ).

tff(c_20,plain,
    ! [D_7] :
      ( ~ greater(depth(D_7),depth_limit)
      | ~ dive(D_7) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_83,plain,
    ! [D_21] :
      ( ~ outcome(D_21,'#skF_2')
      | ~ dive(D_21) ),
    inference(resolution,[status(thm)],[c_78,c_20]) ).

tff(c_86,plain,
    ~ dive('#skF_1'),
    inference(resolution,[status(thm)],[c_24,c_83]) ).

tff(c_90,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_26,c_86]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : MSC017+1 : TPTP v8.1.2. Released v4.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.34  % Computer : n029.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu Aug  3 13:27:37 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 2.96/1.71  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.96/1.71  
% 2.96/1.71  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.96/1.74  
% 2.96/1.74  Inference rules
% 2.96/1.74  ----------------------
% 2.96/1.74  #Ref     : 0
% 2.96/1.74  #Sup     : 11
% 2.96/1.74  #Fact    : 0
% 2.96/1.74  #Define  : 0
% 2.96/1.74  #Split   : 0
% 2.96/1.74  #Chain   : 0
% 2.96/1.74  #Close   : 0
% 2.96/1.74  
% 2.96/1.74  Ordering : KBO
% 2.96/1.74  
% 2.96/1.74  Simplification rules
% 2.96/1.74  ----------------------
% 2.96/1.74  #Subsume      : 5
% 2.96/1.74  #Demod        : 10
% 2.96/1.74  #Tautology    : 7
% 2.96/1.74  #SimpNegUnit  : 0
% 2.96/1.74  #BackRed      : 2
% 2.96/1.74  
% 2.96/1.74  #Partial instantiations: 0
% 2.96/1.74  #Strategies tried      : 1
% 2.96/1.74  
% 2.96/1.74  Timing (in seconds)
% 2.96/1.74  ----------------------
% 2.96/1.74  Preprocessing        : 0.46
% 2.96/1.74  Parsing              : 0.25
% 2.96/1.74  CNF conversion       : 0.03
% 2.96/1.74  Main loop            : 0.22
% 2.96/1.74  Inferencing          : 0.10
% 2.96/1.74  Reduction            : 0.05
% 2.96/1.74  Demodulation         : 0.04
% 2.96/1.74  BG Simplification    : 0.01
% 2.96/1.74  Subsumption          : 0.04
% 2.96/1.74  Abstraction          : 0.01
% 2.96/1.74  MUC search           : 0.00
% 2.96/1.74  Cooper               : 0.00
% 2.96/1.74  Total                : 0.72
% 2.96/1.74  Index Insertion      : 0.00
% 2.96/1.74  Index Deletion       : 0.00
% 2.96/1.74  Index Matching       : 0.00
% 2.96/1.74  BG Taut test         : 0.00
%------------------------------------------------------------------------------