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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : NUM844+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:53 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > vmul > #nlpp > vsucc > vskolem2 > vd413 > vd411 > v1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(vd413,type,
    vd413: $i ).

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

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

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

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

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

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

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

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

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

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

tff(f_52,axiom,
    ! [Vd78,Vd79] : ( vplus(Vd79,Vd78) = vplus(Vd78,Vd79) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(61,0),0)) ).

tff(f_62,axiom,
    ! [Vd42,Vd43] :
      ( ( vplus(Vd42,vsucc(Vd43)) = vsucc(vplus(Vd42,Vd43)) )
      & ( vplus(Vd42,v1) = vsucc(Vd42) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',qu(cond(conseq(axiom(3)),3),and(holds(definiens(29),45,0),holds(definiens(29),44,0)))) ).

tff(f_54,axiom,
    ! [Vd68,Vd69] : ( vplus(vsucc(Vd68),Vd69) = vsucc(vplus(Vd68,Vd69)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(52,0),0)) ).

tff(f_29,negated_conjecture,
    vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))) != vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(266,415,3)) ).

tff(c_28,plain,
    ! [Vd79_9,Vd78_8] : ( vplus(Vd79_9,Vd78_8) = vplus(Vd78_8,Vd79_9) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_36,plain,
    ! [Vd42_16,Vd43_17] : ( vplus(Vd42_16,vsucc(Vd43_17)) = vsucc(vplus(Vd42_16,Vd43_17)) ),
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_30,plain,
    ! [Vd68_10,Vd69_11] : ( vplus(vsucc(Vd68_10),Vd69_11) = vsucc(vplus(Vd68_10,Vd69_11)) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_2,plain,
    vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)) != vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_54,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_28,c_36,c_30,c_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM844+2 : TPTP v8.1.2. Released v4.1.0.
% 0.00/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.13/0.34  % Computer : n004.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 14:20:26 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 2.78/1.72  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.91/1.73  
% 2.91/1.73  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.91/1.75  
% 2.91/1.75  Inference rules
% 2.91/1.75  ----------------------
% 2.91/1.75  #Ref     : 0
% 2.91/1.75  #Sup     : 0
% 2.91/1.75  #Fact    : 0
% 2.91/1.75  #Define  : 0
% 2.91/1.75  #Split   : 0
% 2.91/1.75  #Chain   : 0
% 2.91/1.75  #Close   : 0
% 2.91/1.75  
% 2.91/1.75  Ordering : KBO
% 2.91/1.75  
% 2.91/1.75  Simplification rules
% 2.91/1.75  ----------------------
% 2.91/1.75  #Subsume      : 17
% 2.91/1.75  #Demod        : 21
% 2.91/1.75  #Tautology    : 4
% 2.91/1.75  #SimpNegUnit  : 0
% 2.91/1.75  #BackRed      : 0
% 2.91/1.75  
% 2.91/1.75  #Partial instantiations: 0
% 2.91/1.75  #Strategies tried      : 1
% 2.91/1.75  
% 2.91/1.75  Timing (in seconds)
% 2.91/1.75  ----------------------
% 2.91/1.75  Preprocessing        : 0.52
% 2.91/1.75  Parsing              : 0.27
% 2.91/1.75  CNF conversion       : 0.02
% 2.91/1.75  Main loop            : 0.11
% 2.91/1.75  Inferencing          : 0.00
% 2.91/1.75  Reduction            : 0.07
% 2.91/1.75  Demodulation         : 0.06
% 2.91/1.75  BG Simplification    : 0.02
% 2.91/1.75  Subsumption          : 0.03
% 2.91/1.75  Abstraction          : 0.01
% 2.91/1.75  MUC search           : 0.00
% 2.91/1.75  Cooper               : 0.00
% 2.91/1.75  Total                : 0.67
% 2.91/1.75  Index Insertion      : 0.00
% 2.91/1.75  Index Deletion       : 0.00
% 2.91/1.75  Index Matching       : 0.00
% 2.91/1.75  BG Taut test         : 0.00
%------------------------------------------------------------------------------