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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : NUM857+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 : n010.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:56 EDT 2023

% Result   : Theorem 52.17s 35.28s
% Output   : CNFRefutation 52.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   43 (  14 unt;  17 typ;   0 def)
%            Number of atoms       :   45 (   6 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   37 (  18   ~;  14   |;   2   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   22 (  12   >;  10   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   5 con; 0-2 aty)
%            Number of variables   :   28 (;  28   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > vmul > #nlpp > vsucc > vskolem2 > vd530 > vd529 > vd527 > vd526 > v1 > #skF_3 > #skF_2 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_185,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_31,axiom,
    geq(vd526,vd527),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(conjunct1(antec(323)),528,0)) ).

tff(f_71,axiom,
    ! [Vd456,Vd457,Vd458] :
      ( greater(Vd457,Vd458)
     => greater(vmul(Vd457,Vd456),vmul(Vd458,Vd456)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(299,0),2)) ).

tff(f_30,axiom,
    geq(vd529,vd530),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(conjunct2(antec(323)),531,0)) ).

tff(f_41,axiom,
    ! [Vd517,Vd518,Vd519,Vd520] :
      ( ( ( greater(Vd519,Vd520)
          & geq(Vd517,Vd518) )
        | ( geq(Vd519,Vd520)
          & greater(Vd517,Vd518) ) )
     => greater(vmul(Vd517,Vd519),vmul(Vd518,Vd520)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(318,0),0)) ).

tff(f_29,negated_conjecture,
    ~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(conseq(323),532,0)) ).

tff(c_90,plain,
    ! [Vd245_93] : geq(Vd245_93,Vd245_93),
    inference(cnfTransformation,[status(thm)],[f_185]) ).

tff(c_6,plain,
    geq(vd526,vd527),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_88,plain,
    ! [Vd245_93,Vd244_92] :
      ( ( Vd245_93 = Vd244_92 )
      | greater(Vd245_93,Vd244_92)
      | ~ geq(Vd245_93,Vd244_92) ),
    inference(cnfTransformation,[status(thm)],[f_185]) ).

tff(c_3942,plain,
    ! [Vd457_393,Vd456_394,Vd458_395] :
      ( greater(vmul(Vd457_393,Vd456_394),vmul(Vd458_395,Vd456_394))
      | ~ greater(Vd457_393,Vd458_395) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_92,plain,
    ! [Vd245_93,Vd244_92] :
      ( ~ greater(Vd245_93,Vd244_92)
      | geq(Vd245_93,Vd244_92) ),
    inference(cnfTransformation,[status(thm)],[f_185]) ).

tff(c_3986,plain,
    ! [Vd457_393,Vd456_394,Vd458_395] :
      ( geq(vmul(Vd457_393,Vd456_394),vmul(Vd458_395,Vd456_394))
      | ~ greater(Vd457_393,Vd458_395) ),
    inference(resolution,[status(thm)],[c_3942,c_92]) ).

tff(c_4,plain,
    geq(vd529,vd530),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_5395,plain,
    ! [Vd517_451,Vd518_452,Vd519_453,Vd520_454] :
      ( ~ geq(Vd517_451,Vd518_452)
      | ~ greater(Vd519_453,Vd520_454)
      | greater(vmul(Vd517_451,Vd519_453),vmul(Vd518_452,Vd520_454)) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_176839,plain,
    ! [Vd517_2330,Vd519_2331,Vd518_2332,Vd520_2333] :
      ( geq(vmul(Vd517_2330,Vd519_2331),vmul(Vd518_2332,Vd520_2333))
      | ~ geq(Vd517_2330,Vd518_2332)
      | ~ greater(Vd519_2331,Vd520_2333) ),
    inference(resolution,[status(thm)],[c_5395,c_92]) ).

tff(c_2,plain,
    ~ geq(vmul(vd526,vd529),vmul(vd527,vd530)),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_176897,plain,
    ( ~ geq(vd526,vd527)
    | ~ greater(vd529,vd530) ),
    inference(resolution,[status(thm)],[c_176839,c_2]) ).

tff(c_177011,plain,
    ~ greater(vd529,vd530),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_176897]) ).

tff(c_177023,plain,
    ( ( vd530 = vd529 )
    | ~ geq(vd529,vd530) ),
    inference(resolution,[status(thm)],[c_88,c_177011]) ).

tff(c_177029,plain,
    vd530 = vd529,
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_177023]) ).

tff(c_177214,plain,
    ~ geq(vmul(vd526,vd529),vmul(vd527,vd529)),
    inference(demodulation,[status(thm),theory(equality)],[c_177029,c_2]) ).

tff(c_177322,plain,
    ~ greater(vd526,vd527),
    inference(resolution,[status(thm)],[c_3986,c_177214]) ).

tff(c_177336,plain,
    ( ( vd527 = vd526 )
    | ~ geq(vd526,vd527) ),
    inference(resolution,[status(thm)],[c_88,c_177322]) ).

tff(c_177342,plain,
    vd527 = vd526,
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_177336]) ).

tff(c_177344,plain,
    ~ geq(vmul(vd526,vd529),vmul(vd526,vd529)),
    inference(demodulation,[status(thm),theory(equality)],[c_177342,c_177214]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : NUM857+2 : 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.14/0.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 14:44:13 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 52.17/35.28  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 52.17/35.29  
% 52.17/35.29  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 52.17/35.31  
% 52.17/35.31  Inference rules
% 52.17/35.31  ----------------------
% 52.17/35.31  #Ref     : 29
% 52.17/35.31  #Sup     : 45127
% 52.17/35.31  #Fact    : 2
% 52.17/35.31  #Define  : 0
% 52.17/35.31  #Split   : 19
% 52.17/35.31  #Chain   : 0
% 52.17/35.31  #Close   : 0
% 52.17/35.31  
% 52.17/35.31  Ordering : KBO
% 52.17/35.31  
% 52.17/35.31  Simplification rules
% 52.17/35.31  ----------------------
% 52.17/35.31  #Subsume      : 16053
% 52.17/35.31  #Demod        : 11995
% 52.17/35.31  #Tautology    : 4700
% 52.17/35.31  #SimpNegUnit  : 1565
% 52.17/35.31  #BackRed      : 341
% 52.17/35.31  
% 52.17/35.31  #Partial instantiations: 0
% 52.17/35.31  #Strategies tried      : 1
% 52.17/35.31  
% 52.17/35.31  Timing (in seconds)
% 52.17/35.31  ----------------------
% 52.17/35.32  Preprocessing        : 0.63
% 52.17/35.32  Parsing              : 0.32
% 52.17/35.32  CNF conversion       : 0.05
% 52.17/35.32  Main loop            : 33.61
% 52.17/35.32  Inferencing          : 2.96
% 52.17/35.32  Reduction            : 15.22
% 52.17/35.32  Demodulation         : 9.90
% 52.17/35.32  BG Simplification    : 0.24
% 52.17/35.32  Subsumption          : 12.23
% 52.17/35.32  Abstraction          : 0.28
% 52.17/35.32  MUC search           : 0.00
% 52.17/35.32  Cooper               : 0.00
% 52.17/35.32  Total                : 34.29
% 52.17/35.32  Index Insertion      : 0.00
% 52.17/35.32  Index Deletion       : 0.00
% 52.17/35.32  Index Matching       : 0.00
% 52.17/35.32  BG Taut test         : 0.00
%------------------------------------------------------------------------------