TSTP Solution File: SYN986+1.002 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN986+1.002 : TPTP v8.1.2. Released v4.0.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 : n027.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 11:17:04 EDT 2023

% Result   : Theorem 2.79s 1.58s
% Output   : CNFRefutation 2.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (   6 unt;   3 typ;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   42 (  22   ~;  16   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   36 (;  33   !;   3   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ r > #nlpp > succ > zero

%Foreground sorts:

%Background operators:

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

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

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

tff(f_57,axiom,
    ! [Y] : r(Y,zero,succ(Y)),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN002+0.ax',hyp1) ).

tff(f_63,axiom,
    ! [Y,X,Z,Z1] :
      ( r(Y,X,Z)
     => ( r(Z,X,Z1)
       => r(Y,succ(X),Z1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN002+0.ax',hyp2) ).

tff(f_72,negated_conjecture,
    ~ ? [Z2,Z1,Z0] :
        ( r(zero,zero,Z2)
        & r(zero,Z2,Z1)
        & r(zero,Z1,Z0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ck) ).

tff(c_2,plain,
    ! [Y_1] : r(Y_1,zero,succ(Y_1)),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_14,plain,
    ! [Y_14,X_15,Z1_16,Z_17] :
      ( r(Y_14,succ(X_15),Z1_16)
      | ~ r(Z_17,X_15,Z1_16)
      | ~ r(Y_14,X_15,Z_17) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_17,plain,
    ! [Y_14,Y_1] :
      ( r(Y_14,succ(zero),succ(Y_1))
      | ~ r(Y_14,zero,Y_1) ),
    inference(resolution,[status(thm)],[c_2,c_14]) ).

tff(c_18,plain,
    ! [Y_18,Y_19] :
      ( r(Y_18,succ(zero),succ(Y_19))
      | ~ r(Y_18,zero,Y_19) ),
    inference(resolution,[status(thm)],[c_2,c_14]) ).

tff(c_4,plain,
    ! [Y_2,X_3,Z1_5,Z_4] :
      ( r(Y_2,succ(X_3),Z1_5)
      | ~ r(Z_4,X_3,Z1_5)
      | ~ r(Y_2,X_3,Z_4) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_47,plain,
    ! [Y_22,Y_23,Y_24] :
      ( r(Y_22,succ(succ(zero)),succ(Y_23))
      | ~ r(Y_22,succ(zero),Y_24)
      | ~ r(Y_24,zero,Y_23) ),
    inference(resolution,[status(thm)],[c_18,c_4]) ).

tff(c_51,plain,
    ! [Y_25,Y_26,Y_27] :
      ( r(Y_25,succ(succ(zero)),succ(Y_26))
      | ~ r(succ(Y_27),zero,Y_26)
      | ~ r(Y_25,zero,Y_27) ),
    inference(resolution,[status(thm)],[c_17,c_47]) ).

tff(c_56,plain,
    ! [Y_28,Y_29] :
      ( r(Y_28,succ(succ(zero)),succ(succ(succ(Y_29))))
      | ~ r(Y_28,zero,Y_29) ),
    inference(resolution,[status(thm)],[c_2,c_51]) ).

tff(c_6,plain,
    ! [Z1_7,Z0_8,Z2_6] :
      ( ~ r(zero,Z1_7,Z0_8)
      | ~ r(zero,Z2_6,Z1_7)
      | ~ r(zero,zero,Z2_6) ),
    inference(cnfTransformation,[status(thm)],[f_72]) ).

tff(c_63,plain,
    ! [Z2_6,Y_29] :
      ( ~ r(zero,Z2_6,succ(succ(zero)))
      | ~ r(zero,zero,Z2_6)
      | ~ r(zero,zero,Y_29) ),
    inference(resolution,[status(thm)],[c_56,c_6]) ).

tff(c_65,plain,
    ! [Y_30] : ~ r(zero,zero,Y_30),
    inference(splitLeft,[status(thm)],[c_63]) ).

tff(c_70,plain,
    $false,
    inference(resolution,[status(thm)],[c_2,c_65]) ).

tff(c_72,plain,
    ! [Z2_31] :
      ( ~ r(zero,Z2_31,succ(succ(zero)))
      | ~ r(zero,zero,Z2_31) ),
    inference(splitRight,[status(thm)],[c_63]) ).

tff(c_76,plain,
    ~ r(zero,zero,succ(zero)),
    inference(resolution,[status(thm)],[c_17,c_72]) ).

tff(c_80,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_76]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN986+1.002 : TPTP v8.1.2. Released v4.0.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.14/0.34  % Computer : n027.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 17:52:38 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 2.79/1.58  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.79/1.58  
% 2.79/1.58  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.86/1.61  
% 2.86/1.61  Inference rules
% 2.86/1.61  ----------------------
% 2.86/1.61  #Ref     : 0
% 2.86/1.61  #Sup     : 13
% 2.86/1.61  #Fact    : 0
% 2.86/1.61  #Define  : 0
% 2.86/1.61  #Split   : 2
% 2.86/1.61  #Chain   : 0
% 2.86/1.61  #Close   : 0
% 2.86/1.61  
% 2.86/1.61  Ordering : KBO
% 2.86/1.61  
% 2.86/1.61  Simplification rules
% 2.86/1.61  ----------------------
% 2.86/1.61  #Subsume      : 7
% 2.86/1.61  #Demod        : 2
% 2.86/1.61  #Tautology    : 0
% 2.86/1.61  #SimpNegUnit  : 0
% 2.86/1.61  #BackRed      : 0
% 2.86/1.61  
% 2.86/1.61  #Partial instantiations: 0
% 2.86/1.61  #Strategies tried      : 1
% 2.86/1.61  
% 2.86/1.61  Timing (in seconds)
% 2.86/1.61  ----------------------
% 2.86/1.62  Preprocessing        : 0.38
% 2.86/1.62  Parsing              : 0.21
% 2.86/1.62  CNF conversion       : 0.02
% 2.86/1.62  Main loop            : 0.20
% 2.86/1.62  Inferencing          : 0.09
% 2.86/1.62  Reduction            : 0.04
% 2.86/1.62  Demodulation         : 0.03
% 2.86/1.62  BG Simplification    : 0.01
% 2.86/1.62  Subsumption          : 0.06
% 2.86/1.62  Abstraction          : 0.01
% 2.86/1.62  MUC search           : 0.00
% 2.86/1.62  Cooper               : 0.00
% 2.86/1.62  Total                : 0.64
% 2.86/1.62  Index Insertion      : 0.00
% 2.86/1.62  Index Deletion       : 0.00
% 2.86/1.62  Index Matching       : 0.00
% 2.86/1.62  BG Taut test         : 0.00
%------------------------------------------------------------------------------