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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : NUM835+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/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 : n024.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:50 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ m > vplus > #nlpp > vsucc > vskolem2 > vskolem3 > vd165 > vd151 > v1 > #skF_1 > #skF_3 > #skF_2

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_1',type,
    '#skF_1': $i > $i ).

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

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

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

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

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

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

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

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

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

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

tff(f_34,negated_conjecture,
    ~ ( ? [Vd180] : ( vd165 = vplus(vd151,Vd180) )
      | ? [Vd170] : ( vd151 = vplus(vd165,Vd170) )
      | ( vd151 = vd165 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dis(case_distinction(conseq(110)))) ).

tff(f_140,axiom,
    ! [Vd151,Vd152] :
      ( m(Vd152)
    <=> ( ( Vd151 = Vd152 )
        | ? [Vd155] : ( Vd151 = vplus(Vd152,Vd155) )
        | ? [Vd157] : ( Vd152 = vplus(Vd151,Vd157) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def(cond(conseq(105),0),1)) ).

tff(c_2,plain,
    vd165 != vd151,
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_64,plain,
    ! [Vd152_18] : m(Vd152_18),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_58,plain,
    ! [Vd151_17,Vd152_18] :
      ( ( vplus(Vd151_17,'#skF_3'(Vd151_17,Vd152_18)) = Vd152_18 )
      | ( vplus(Vd152_18,'#skF_2'(Vd151_17,Vd152_18)) = Vd151_17 )
      | ( Vd152_18 = Vd151_17 )
      | ~ m(Vd152_18) ),
    inference(cnfTransformation,[status(thm)],[f_140]) ).

tff(c_883,plain,
    ! [Vd151_126,Vd152_127] :
      ( ( vplus(Vd151_126,'#skF_3'(Vd151_126,Vd152_127)) = Vd152_127 )
      | ( vplus(Vd152_127,'#skF_2'(Vd151_126,Vd152_127)) = Vd151_126 )
      | ( Vd152_127 = Vd151_126 ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_64,c_58]) ).

tff(c_4,plain,
    ! [Vd170_2] : ( vplus(vd165,Vd170_2) != vd151 ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_1150,plain,
    ! [Vd152_132] :
      ( ( vd151 != Vd152_132 )
      | ( vplus(Vd152_132,'#skF_2'(vd165,Vd152_132)) = vd165 )
      | ( vd165 = Vd152_132 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_883,c_4]) ).

tff(c_6,plain,
    ! [Vd180_1] : ( vplus(vd151,Vd180_1) != vd165 ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_1211,plain,
    vd165 = vd151,
    inference(superposition,[status(thm),theory(equality)],[c_1150,c_6]) ).

tff(c_1250,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_2,c_1211]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : NUM835+1 : TPTP v8.1.2. Released v4.1.0.
% 0.08/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.14/0.36  % Computer : n024.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 14:50:00 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 4.00/2.07  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.00/2.08  
% 4.00/2.08  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.00/2.10  
% 4.00/2.10  Inference rules
% 4.00/2.10  ----------------------
% 4.00/2.10  #Ref     : 2
% 4.00/2.10  #Sup     : 289
% 4.00/2.10  #Fact    : 0
% 4.00/2.10  #Define  : 0
% 4.00/2.10  #Split   : 1
% 4.00/2.10  #Chain   : 0
% 4.00/2.10  #Close   : 0
% 4.00/2.10  
% 4.00/2.10  Ordering : KBO
% 4.00/2.10  
% 4.00/2.10  Simplification rules
% 4.00/2.10  ----------------------
% 4.00/2.10  #Subsume      : 70
% 4.00/2.10  #Demod        : 92
% 4.00/2.10  #Tautology    : 81
% 4.00/2.10  #SimpNegUnit  : 4
% 4.00/2.10  #BackRed      : 0
% 4.00/2.10  
% 4.00/2.10  #Partial instantiations: 0
% 4.00/2.10  #Strategies tried      : 1
% 4.00/2.10  
% 4.00/2.10  Timing (in seconds)
% 4.00/2.10  ----------------------
% 4.00/2.11  Preprocessing        : 0.58
% 4.00/2.11  Parsing              : 0.30
% 4.00/2.11  CNF conversion       : 0.04
% 4.00/2.11  Main loop            : 0.47
% 4.00/2.11  Inferencing          : 0.14
% 4.00/2.11  Reduction            : 0.16
% 4.00/2.11  Demodulation         : 0.12
% 4.00/2.11  BG Simplification    : 0.03
% 4.00/2.11  Subsumption          : 0.10
% 4.00/2.11  Abstraction          : 0.02
% 4.00/2.11  MUC search           : 0.00
% 4.00/2.11  Cooper               : 0.00
% 4.00/2.11  Total                : 1.09
% 4.00/2.11  Index Insertion      : 0.00
% 4.00/2.11  Index Deletion       : 0.00
% 4.00/2.11  Index Matching       : 0.00
% 4.00/2.11  BG Taut test         : 0.00
%------------------------------------------------------------------------------