TSTP Solution File: NUM839+2 by Beagle---0.9.51

View Problem - Process Solution

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

% Result   : Theorem 8.49s 3.11s
% Output   : CNFRefutation 8.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   53 (  19 unt;  15 typ;   0 def)
%            Number of atoms       :   63 (  13 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   49 (  24   ~;  21   |;   0   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   20 (  11   >;   9   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   4 con; 0-2 aty)
%            Number of variables   :   36 (;  36   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > #nlpp > vsucc > vskolem2 > vd330 > vd329 > vd328 > v1 > #skF_3 > #skF_2 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

tff('#skF_3',type,
    '#skF_3': ( $i * $i ) > $i ).

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

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

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

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

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

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

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

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

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

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

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

tff('#skF_4',type,
    '#skF_4': ( $i * $i ) > $i ).

tff(f_118,axiom,
    ! [Vd203,Vd204] :
      ( ( Vd203 != Vd204 )
      | ~ greater(Vd203,Vd204) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(goal(130),0),3)) ).

tff(f_86,axiom,
    ! [Vd244,Vd245] :
      ( geq(Vd245,Vd244)
    <=> ( greater(Vd245,Vd244)
        | ( Vd245 = Vd244 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',def(cond(conseq(axiom(3)),16),1)) ).

tff(f_29,negated_conjecture,
    ~ greater(vd328,vd329),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(conseq(204),332,0)) ).

tff(f_100,axiom,
    ! [Vd203,Vd204] :
      ( ( Vd203 = Vd204 )
      | greater(Vd203,Vd204)
      | less(Vd203,Vd204) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(goal(130),0),0)) ).

tff(f_90,axiom,
    ! [Vd226,Vd227] :
      ( less(Vd226,Vd227)
     => greater(Vd227,Vd226) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(147,0),0)) ).

tff(f_42,axiom,
    ! [Vd301,Vd302,Vd303] :
      ( greater(Vd301,Vd302)
     => greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(goal(193),0),2)) ).

tff(f_30,axiom,
    greater(vplus(vd328,vd330),vplus(vd329,vd330)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(antec(204),331,0)) ).

tff(f_94,axiom,
    ! [Vd208,Vd209] :
      ( greater(Vd208,Vd209)
     => less(Vd209,Vd208) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(140,0),0)) ).

tff(f_112,axiom,
    ! [Vd203,Vd204] :
      ( ~ greater(Vd203,Vd204)
      | ~ less(Vd203,Vd204) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(goal(130),0),2)) ).

tff(c_49,plain,
    ! [Vd204_40] : ~ greater(Vd204_40,Vd204_40),
    inference(cnfTransformation,[status(thm)],[f_118]) ).

tff(c_35,plain,
    ! [Vd245_28] : geq(Vd245_28,Vd245_28),
    inference(cnfTransformation,[status(thm)],[f_86]) ).

tff(c_2,plain,
    ~ greater(vd328,vd329),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_814,plain,
    ! [Vd203_176,Vd204_177] :
      ( less(Vd203_176,Vd204_177)
      | greater(Vd203_176,Vd204_177)
      | ( Vd204_177 = Vd203_176 ) ),
    inference(cnfTransformation,[status(thm)],[f_100]) ).

tff(c_39,plain,
    ! [Vd227_30,Vd226_29] :
      ( greater(Vd227_30,Vd226_29)
      | ~ less(Vd226_29,Vd227_30) ),
    inference(cnfTransformation,[status(thm)],[f_90]) ).

tff(c_7759,plain,
    ! [Vd204_423,Vd203_424] :
      ( greater(Vd204_423,Vd203_424)
      | greater(Vd203_424,Vd204_423)
      | ( Vd204_423 = Vd203_424 ) ),
    inference(resolution,[status(thm)],[c_814,c_39]) ).

tff(c_11,plain,
    ! [Vd301_7,Vd303_9,Vd302_8] :
      ( greater(vplus(Vd301_7,Vd303_9),vplus(Vd302_8,Vd303_9))
      | ~ greater(Vd301_7,Vd302_8) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_4,plain,
    greater(vplus(vd328,vd330),vplus(vd329,vd330)),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_578,plain,
    ! [Vd209_153,Vd208_154] :
      ( less(Vd209_153,Vd208_154)
      | ~ greater(Vd208_154,Vd209_153) ),
    inference(cnfTransformation,[status(thm)],[f_94]) ).

tff(c_47,plain,
    ! [Vd203_37,Vd204_38] :
      ( ~ less(Vd203_37,Vd204_38)
      | ~ greater(Vd203_37,Vd204_38) ),
    inference(cnfTransformation,[status(thm)],[f_112]) ).

tff(c_610,plain,
    ! [Vd209_158,Vd208_159] :
      ( ~ greater(Vd209_158,Vd208_159)
      | ~ greater(Vd208_159,Vd209_158) ),
    inference(resolution,[status(thm)],[c_578,c_47]) ).

tff(c_623,plain,
    ~ greater(vplus(vd329,vd330),vplus(vd328,vd330)),
    inference(resolution,[status(thm)],[c_4,c_610]) ).

tff(c_5967,plain,
    ~ greater(vd329,vd328),
    inference(resolution,[status(thm)],[c_11,c_623]) ).

tff(c_7776,plain,
    ( greater(vd328,vd329)
    | ( vd329 = vd328 ) ),
    inference(resolution,[status(thm)],[c_7759,c_5967]) ).

tff(c_7903,plain,
    vd329 = vd328,
    inference(negUnitSimplification,[status(thm)],[c_2,c_7776]) ).

tff(c_33,plain,
    ! [Vd245_28,Vd244_27] :
      ( ( Vd245_28 = Vd244_27 )
      | greater(Vd245_28,Vd244_27)
      | ~ geq(Vd245_28,Vd244_27) ),
    inference(cnfTransformation,[status(thm)],[f_86]) ).

tff(c_5972,plain,
    ( ( vd329 = vd328 )
    | ~ geq(vd329,vd328) ),
    inference(resolution,[status(thm)],[c_33,c_5967]) ).

tff(c_5973,plain,
    ~ geq(vd329,vd328),
    inference(splitLeft,[status(thm)],[c_5972]) ).

tff(c_7933,plain,
    ~ geq(vd328,vd328),
    inference(demodulation,[status(thm),theory(equality)],[c_7903,c_5973]) ).

tff(c_7942,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_35,c_7933]) ).

tff(c_7943,plain,
    vd329 = vd328,
    inference(splitRight,[status(thm)],[c_5972]) ).

tff(c_974,plain,
    ! [Vd245_191,Vd244_192] :
      ( ( Vd245_191 = Vd244_192 )
      | greater(Vd245_191,Vd244_192)
      | ~ geq(Vd245_191,Vd244_192) ),
    inference(cnfTransformation,[status(thm)],[f_86]) ).

tff(c_1033,plain,
    ( ( vd329 = vd328 )
    | ~ geq(vd328,vd329) ),
    inference(resolution,[status(thm)],[c_974,c_2]) ).

tff(c_1045,plain,
    ~ geq(vd328,vd329),
    inference(splitLeft,[status(thm)],[c_1033]) ).

tff(c_7948,plain,
    ~ geq(vd328,vd328),
    inference(demodulation,[status(thm),theory(equality)],[c_7943,c_1045]) ).

tff(c_7954,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_35,c_7948]) ).

tff(c_7955,plain,
    vd329 = vd328,
    inference(splitRight,[status(thm)],[c_1033]) ).

tff(c_7957,plain,
    greater(vplus(vd328,vd330),vplus(vd328,vd330)),
    inference(demodulation,[status(thm),theory(equality)],[c_7955,c_4]) ).

tff(c_7960,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_49,c_7957]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM839+2 : TPTP v8.1.2. Released v4.1.0.
% 0.11/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.14/0.34  % Computer : n004.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu Aug  3 15:04:56 EDT 2023
% 0.21/0.34  % CPUTime  : 
% 8.49/3.11  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.49/3.11  
% 8.49/3.11  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.49/3.14  
% 8.49/3.14  Inference rules
% 8.49/3.14  ----------------------
% 8.49/3.14  #Ref     : 4
% 8.49/3.14  #Sup     : 2028
% 8.49/3.14  #Fact    : 2
% 8.49/3.14  #Define  : 0
% 8.49/3.14  #Split   : 2
% 8.49/3.14  #Chain   : 0
% 8.49/3.14  #Close   : 0
% 8.49/3.14  
% 8.49/3.14  Ordering : KBO
% 8.49/3.14  
% 8.49/3.14  Simplification rules
% 8.49/3.14  ----------------------
% 8.49/3.14  #Subsume      : 403
% 8.49/3.14  #Demod        : 508
% 8.49/3.14  #Tautology    : 366
% 8.49/3.14  #SimpNegUnit  : 49
% 8.49/3.14  #BackRed      : 16
% 8.49/3.14  
% 8.49/3.14  #Partial instantiations: 0
% 8.49/3.14  #Strategies tried      : 1
% 8.49/3.14  
% 8.49/3.14  Timing (in seconds)
% 8.49/3.14  ----------------------
% 8.49/3.15  Preprocessing        : 0.58
% 8.49/3.15  Parsing              : 0.30
% 8.49/3.15  CNF conversion       : 0.04
% 8.49/3.15  Main loop            : 1.41
% 8.49/3.15  Inferencing          : 0.43
% 8.49/3.15  Reduction            : 0.53
% 8.49/3.15  Demodulation         : 0.36
% 8.49/3.15  BG Simplification    : 0.05
% 8.49/3.15  Subsumption          : 0.30
% 8.49/3.15  Abstraction          : 0.05
% 8.49/3.15  MUC search           : 0.00
% 8.49/3.15  Cooper               : 0.00
% 8.49/3.15  Total                : 2.03
% 8.49/3.15  Index Insertion      : 0.00
% 8.49/3.15  Index Deletion       : 0.00
% 8.49/3.15  Index Matching       : 0.00
% 8.49/3.15  BG Taut test         : 0.00
%------------------------------------------------------------------------------