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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : NUN067+1 : TPTP v8.1.2. Released v7.3.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 : 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:53:21 EDT 2023

% Result   : Theorem 3.67s 1.83s
% Output   : CNFRefutation 3.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   32
% Syntax   : Number of formulae    :   48 (   8 unt;  26 typ;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   51 (  27   ~;  18   |;   6   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   41 (  25   >;  16   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :   21 (  21 usr;   1 con; 0-2 aty)
%            Number of variables   :   36 (;  33   !;   3   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ r4 > r3 > r2 > id > r1 > #nlpp > #skF_11 > #skF_21 > #skF_16 > #skF_6 > #skF_2 > #skF_18 > #skF_19 > #skF_3 > #skF_15 > #skF_12 > #skF_10 > #skF_1 > #skF_8 > #skF_13 > #skF_17 > #skF_14 > #skF_7 > #skF_9 > #skF_5 > #skF_4 > #skF_20

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_272,negated_conjecture,
    ~ ? [Y1] :
      ! [Y2] :
        ( ~ id(Y1,Y2)
        | ~ r1(Y2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonzerosexistid) ).

tff(f_127,axiom,
    ! [X26,X27] :
      ( ~ id(X26,X27)
      | ( ~ r1(X26)
        & ~ r1(X27) )
      | ( r1(X26)
        & r1(X27) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_8) ).

tff(f_63,axiom,
    ? [Y24] :
    ! [X19] :
      ( ( id(X19,Y24)
        & r1(X19) )
      | ( ~ r1(X19)
        & ~ id(X19,Y24) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_1) ).

tff(f_106,axiom,
    ! [X21,X22] :
      ( ~ id(X21,X22)
      | id(X22,X21) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_6) ).

tff(f_75,axiom,
    ! [X11] :
    ? [Y21] :
    ! [X12] :
      ( ( id(X12,Y21)
        & r2(X11,X12) )
      | ( ~ r2(X11,X12)
        & ~ id(X12,Y21) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_2) ).

tff(f_262,axiom,
    ! [X7,Y10] :
      ( ! [Y20] :
          ( ~ id(Y20,Y10)
          | ~ r1(Y20) )
      | ~ r2(X7,Y10) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_7a) ).

tff(c_118,plain,
    ! [Y1_108] : r1('#skF_21'(Y1_108)),
    inference(cnfTransformation,[status(thm)],[f_272]) ).

tff(c_120,plain,
    ! [Y1_108] : id(Y1_108,'#skF_21'(Y1_108)),
    inference(cnfTransformation,[status(thm)],[f_272]) ).

tff(c_201,plain,
    ! [X27_138,X26_139] :
      ( ~ r1(X27_138)
      | r1(X26_139)
      | ~ id(X26_139,X27_138) ),
    inference(cnfTransformation,[status(thm)],[f_127]) ).

tff(c_225,plain,
    ! [Y1_108] :
      ( ~ r1('#skF_21'(Y1_108))
      | r1(Y1_108) ),
    inference(resolution,[status(thm)],[c_120,c_201]) ).

tff(c_245,plain,
    ! [Y1_108] : r1(Y1_108),
    inference(demodulation,[status(thm),theory(equality)],[c_118,c_225]) ).

tff(c_8,plain,
    ! [X19_2] :
      ( id(X19_2,'#skF_1')
      | ~ r1(X19_2) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_303,plain,
    ! [X19_2] : id(X19_2,'#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_245,c_8]) ).

tff(c_147,plain,
    ! [X22_124,X21_125] :
      ( id(X22_124,X21_125)
      | ~ id(X21_125,X22_124) ),
    inference(cnfTransformation,[status(thm)],[f_106]) ).

tff(c_158,plain,
    ! [X19_2] :
      ( id('#skF_1',X19_2)
      | ~ r1(X19_2) ),
    inference(resolution,[status(thm)],[c_8,c_147]) ).

tff(c_298,plain,
    ! [X19_2] : id('#skF_1',X19_2),
    inference(demodulation,[status(thm),theory(equality)],[c_245,c_158]) ).

tff(c_338,plain,
    ! [X11_149,X12_150] :
      ( r2(X11_149,X12_150)
      | ~ id(X12_150,'#skF_2'(X11_149)) ),
    inference(cnfTransformation,[status(thm)],[f_75]) ).

tff(c_355,plain,
    ! [X11_149] : r2(X11_149,'#skF_1'),
    inference(resolution,[status(thm)],[c_298,c_338]) ).

tff(c_116,plain,
    ! [X7_104,Y10_105,Y20_107] :
      ( ~ r2(X7_104,Y10_105)
      | ~ r1(Y20_107)
      | ~ id(Y20_107,Y10_105) ),
    inference(cnfTransformation,[status(thm)],[f_262]) ).

tff(c_395,plain,
    ! [X7_165,Y10_166,Y20_167] :
      ( ~ r2(X7_165,Y10_166)
      | ~ id(Y20_167,Y10_166) ),
    inference(demodulation,[status(thm),theory(equality)],[c_245,c_116]) ).

tff(c_403,plain,
    ! [Y20_167] : ~ id(Y20_167,'#skF_1'),
    inference(resolution,[status(thm)],[c_355,c_395]) ).

tff(c_416,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_303,c_403]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : NUN067+1 : TPTP v8.1.2. Released v7.3.0.
% 0.13/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.13/0.35  % Computer : n010.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 18:28:29 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 3.67/1.83  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.67/1.83  
% 3.67/1.83  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.67/1.86  
% 3.67/1.86  Inference rules
% 3.67/1.86  ----------------------
% 3.67/1.86  #Ref     : 0
% 3.67/1.86  #Sup     : 53
% 3.67/1.86  #Fact    : 0
% 3.67/1.86  #Define  : 0
% 3.67/1.86  #Split   : 0
% 3.67/1.86  #Chain   : 0
% 3.67/1.86  #Close   : 0
% 3.67/1.86  
% 3.67/1.86  Ordering : KBO
% 3.67/1.86  
% 3.67/1.86  Simplification rules
% 3.67/1.86  ----------------------
% 3.67/1.86  #Subsume      : 2
% 3.67/1.86  #Demod        : 51
% 3.67/1.86  #Tautology    : 56
% 3.67/1.86  #SimpNegUnit  : 0
% 3.67/1.86  #BackRed      : 2
% 3.67/1.86  
% 3.67/1.86  #Partial instantiations: 0
% 3.67/1.86  #Strategies tried      : 1
% 3.67/1.86  
% 3.67/1.86  Timing (in seconds)
% 3.67/1.86  ----------------------
% 3.67/1.86  Preprocessing        : 0.51
% 3.67/1.86  Parsing              : 0.28
% 3.67/1.86  CNF conversion       : 0.05
% 3.67/1.86  Main loop            : 0.31
% 3.67/1.86  Inferencing          : 0.12
% 3.67/1.86  Reduction            : 0.09
% 3.67/1.86  Demodulation         : 0.07
% 3.67/1.86  BG Simplification    : 0.02
% 3.67/1.86  Subsumption          : 0.06
% 3.67/1.86  Abstraction          : 0.01
% 3.67/1.86  MUC search           : 0.00
% 3.67/1.86  Cooper               : 0.00
% 3.67/1.86  Total                : 0.86
% 3.67/1.86  Index Insertion      : 0.00
% 3.67/1.86  Index Deletion       : 0.00
% 3.67/1.86  Index Matching       : 0.00
% 3.67/1.86  BG Taut test         : 0.00
%------------------------------------------------------------------------------