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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : NUM839+1 : 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 : n013.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:51 EDT 2023

% Result   : Theorem 9.47s 3.35s
% Output   : CNFRefutation 9.87s
% 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_117,axiom,
    ! [Vd203,Vd204] :
      ( ( Vd203 != Vd204 )
      | ~ greater(Vd203,Vd204) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(goal(130),0),3)) ).

tff(f_85,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_28,negated_conjecture,
    ~ greater(vd328,vd329),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(conseq(204),332,0)) ).

tff(f_99,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_89,axiom,
    ! [Vd226,Vd227] :
      ( less(Vd226,Vd227)
     => greater(Vd227,Vd226) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(147,0),0)) ).

tff(f_41,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_29,axiom,
    greater(vplus(vd328,vd330),vplus(vd329,vd330)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(antec(204),331,0)) ).

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

tff(f_111,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_117]) ).

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

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

tff(c_691,plain,
    ! [Vd203_168,Vd204_169] :
      ( less(Vd203_168,Vd204_169)
      | greater(Vd203_168,Vd204_169)
      | ( Vd204_169 = Vd203_168 ) ),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

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

tff(c_10437,plain,
    ! [Vd204_492,Vd203_493] :
      ( greater(Vd204_492,Vd203_493)
      | greater(Vd203_493,Vd204_492)
      | ( Vd204_492 = Vd203_493 ) ),
    inference(resolution,[status(thm)],[c_691,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_41]) ).

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

tff(c_455,plain,
    ! [Vd209_146,Vd208_147] :
      ( less(Vd209_146,Vd208_147)
      | ~ greater(Vd208_147,Vd209_146) ),
    inference(cnfTransformation,[status(thm)],[f_93]) ).

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

tff(c_609,plain,
    ! [Vd209_159,Vd208_160] :
      ( ~ greater(Vd209_159,Vd208_160)
      | ~ greater(Vd208_160,Vd209_159) ),
    inference(resolution,[status(thm)],[c_455,c_47]) ).

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

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

tff(c_10466,plain,
    ( greater(vd328,vd329)
    | ( vd329 = vd328 ) ),
    inference(resolution,[status(thm)],[c_10437,c_4284]) ).

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

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_85]) ).

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

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

tff(c_10638,plain,
    ~ geq(vd328,vd328),
    inference(demodulation,[status(thm),theory(equality)],[c_10607,c_4531]) ).

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

tff(c_10648,plain,
    vd329 = vd328,
    inference(splitRight,[status(thm)],[c_4289]) ).

tff(c_1026,plain,
    ! [Vd245_190,Vd244_191] :
      ( ( Vd245_190 = Vd244_191 )
      | greater(Vd245_190,Vd244_191)
      | ~ geq(Vd245_190,Vd244_191) ),
    inference(cnfTransformation,[status(thm)],[f_85]) ).

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

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

tff(c_10653,plain,
    ~ geq(vd328,vd328),
    inference(demodulation,[status(thm),theory(equality)],[c_10648,c_1090]) ).

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

tff(c_10660,plain,
    vd329 = vd328,
    inference(splitRight,[status(thm)],[c_1078]) ).

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

tff(c_10665,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_49,c_10662]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : NUM839+1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.14  % 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.15/0.36  % Computer : n013.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 14:45:02 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 9.47/3.35  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.47/3.36  
% 9.47/3.36  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.87/3.39  
% 9.87/3.39  Inference rules
% 9.87/3.39  ----------------------
% 9.87/3.39  #Ref     : 6
% 9.87/3.39  #Sup     : 2668
% 9.87/3.39  #Fact    : 2
% 9.87/3.39  #Define  : 0
% 9.87/3.39  #Split   : 2
% 9.87/3.39  #Chain   : 0
% 9.87/3.39  #Close   : 0
% 9.87/3.39  
% 9.87/3.39  Ordering : KBO
% 9.87/3.39  
% 9.87/3.39  Simplification rules
% 9.87/3.39  ----------------------
% 9.87/3.39  #Subsume      : 552
% 9.87/3.39  #Demod        : 796
% 9.87/3.39  #Tautology    : 525
% 9.87/3.39  #SimpNegUnit  : 91
% 9.87/3.39  #BackRed      : 15
% 9.87/3.39  
% 9.87/3.39  #Partial instantiations: 0
% 9.87/3.39  #Strategies tried      : 1
% 9.87/3.39  
% 9.87/3.39  Timing (in seconds)
% 9.87/3.39  ----------------------
% 9.87/3.39  Preprocessing        : 0.58
% 9.87/3.39  Parsing              : 0.30
% 9.87/3.39  CNF conversion       : 0.04
% 9.87/3.39  Main loop            : 1.72
% 9.87/3.39  Inferencing          : 0.48
% 9.87/3.39  Reduction            : 0.67
% 9.87/3.39  Demodulation         : 0.46
% 9.87/3.39  BG Simplification    : 0.06
% 9.87/3.39  Subsumption          : 0.39
% 9.87/3.39  Abstraction          : 0.05
% 9.87/3.39  MUC search           : 0.00
% 9.87/3.39  Cooper               : 0.00
% 9.87/3.39  Total                : 2.35
% 9.87/3.39  Index Insertion      : 0.00
% 9.87/3.39  Index Deletion       : 0.00
% 9.87/3.39  Index Matching       : 0.00
% 9.87/3.39  BG Taut test         : 0.00
%------------------------------------------------------------------------------