TSTP Solution File: NUM021-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : NUM021-1 : TPTP v8.1.2. Bugfixed v4.0.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 : n022.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:50:52 EDT 2023

% Result   : Unsatisfiable 28.19s 17.84s
% Output   : CNFRefutation 28.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   41 (  10 unt;  11 typ;   0 def)
%            Number of atoms       :   60 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   59 (  29   ~;  30   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   13 (   7   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   44 (;  44   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ less > equalish > divides > predecessor_of_1st_minus_2nd > multiply > add > #nlpp > successor > n0 > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

tff(f_165,axiom,
    ~ less(b,a),
    file(unknown,unknown) ).

tff(f_163,axiom,
    less(b,c),
    file(unknown,unknown) ).

tff(f_166,axiom,
    divides(c,a),
    file(unknown,unknown) ).

tff(f_135,axiom,
    ! [A,B] :
      ( ~ divides(A,B)
      | less(A,B)
      | equalish(A,B) ),
    file(unknown,unknown) ).

tff(f_96,axiom,
    ! [A,B,C] :
      ( ~ less(A,B)
      | ~ less(C,A)
      | less(C,B) ),
    file(unknown,unknown) ).

tff(f_154,axiom,
    ! [X,Y] :
      ( ~ equalish(X,Y)
      | equalish(Y,X) ),
    file(unknown,unknown) ).

tff(f_106,axiom,
    ! [A,B] :
      ( ~ less(A,B)
      | equalish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B) ),
    file(unknown,unknown) ).

tff(f_162,axiom,
    ! [X,Y,Z] :
      ( ~ equalish(X,Y)
      | ~ equalish(Y,Z)
      | equalish(X,Z) ),
    file(unknown,unknown) ).

tff(f_101,axiom,
    ! [A,B,C] :
      ( ~ equalish(add(successor(A),B),C)
      | less(B,C) ),
    file(unknown,unknown) ).

tff(c_34,plain,
    ~ less(b,a),
    inference(cnfTransformation,[status(thm)],[f_165]) ).

tff(c_32,plain,
    less(b,c),
    inference(cnfTransformation,[status(thm)],[f_163]) ).

tff(c_36,plain,
    divides(c,a),
    inference(cnfTransformation,[status(thm)],[f_166]) ).

tff(c_208,plain,
    ! [A_80,B_81] :
      ( equalish(A_80,B_81)
      | less(A_80,B_81)
      | ~ divides(A_80,B_81) ),
    inference(cnfTransformation,[status(thm)],[f_135]) ).

tff(c_128,plain,
    ! [C_59,B_60,A_61] :
      ( less(C_59,B_60)
      | ~ less(C_59,A_61)
      | ~ less(A_61,B_60) ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_131,plain,
    ! [B_60] :
      ( less(b,B_60)
      | ~ less(c,B_60) ),
    inference(resolution,[status(thm)],[c_32,c_128]) ).

tff(c_694,plain,
    ! [B_150] :
      ( less(b,B_150)
      | equalish(c,B_150)
      | ~ divides(c,B_150) ),
    inference(resolution,[status(thm)],[c_208,c_131]) ).

tff(c_702,plain,
    ( equalish(c,a)
    | ~ divides(c,a) ),
    inference(resolution,[status(thm)],[c_694,c_34]) ).

tff(c_707,plain,
    equalish(c,a),
    inference(demodulation,[status(thm),theory(equality)],[c_36,c_702]) ).

tff(c_28,plain,
    ! [Y_27,X_26] :
      ( equalish(Y_27,X_26)
      | ~ equalish(X_26,Y_27) ),
    inference(cnfTransformation,[status(thm)],[f_154]) ).

tff(c_718,plain,
    equalish(a,c),
    inference(resolution,[status(thm)],[c_707,c_28]) ).

tff(c_376,plain,
    ! [B_100,A_101] :
      ( equalish(add(successor(predecessor_of_1st_minus_2nd(B_100,A_101)),A_101),B_100)
      | ~ less(A_101,B_100) ),
    inference(cnfTransformation,[status(thm)],[f_106]) ).

tff(c_1006,plain,
    ! [B_160,A_161] :
      ( equalish(B_160,add(successor(predecessor_of_1st_minus_2nd(B_160,A_161)),A_161))
      | ~ less(A_161,B_160) ),
    inference(resolution,[status(thm)],[c_376,c_28]) ).

tff(c_30,plain,
    ! [X_28,Z_30,Y_29] :
      ( equalish(X_28,Z_30)
      | ~ equalish(Y_29,Z_30)
      | ~ equalish(X_28,Y_29) ),
    inference(cnfTransformation,[status(thm)],[f_162]) ).

tff(c_6788,plain,
    ! [X_361,B_362,A_363] :
      ( equalish(X_361,add(successor(predecessor_of_1st_minus_2nd(B_362,A_363)),A_363))
      | ~ equalish(X_361,B_362)
      | ~ less(A_363,B_362) ),
    inference(resolution,[status(thm)],[c_1006,c_30]) ).

tff(c_64888,plain,
    ! [B_1311,A_1312,X_1313] :
      ( equalish(add(successor(predecessor_of_1st_minus_2nd(B_1311,A_1312)),A_1312),X_1313)
      | ~ equalish(X_1313,B_1311)
      | ~ less(A_1312,B_1311) ),
    inference(resolution,[status(thm)],[c_6788,c_28]) ).

tff(c_16,plain,
    ! [B_15,C_16,A_14] :
      ( less(B_15,C_16)
      | ~ equalish(add(successor(A_14),B_15),C_16) ),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_65352,plain,
    ! [A_1314,X_1315,B_1316] :
      ( less(A_1314,X_1315)
      | ~ equalish(X_1315,B_1316)
      | ~ less(A_1314,B_1316) ),
    inference(resolution,[status(thm)],[c_64888,c_16]) ).

tff(c_66184,plain,
    ! [A_1317] :
      ( less(A_1317,a)
      | ~ less(A_1317,c) ),
    inference(resolution,[status(thm)],[c_718,c_65352]) ).

tff(c_66205,plain,
    less(b,a),
    inference(resolution,[status(thm)],[c_32,c_66184]) ).

tff(c_66217,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_34,c_66205]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM021-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.00/0.13  % 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.34  % Computer : n022.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:36:49 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 28.19/17.84  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 28.19/17.85  
% 28.19/17.85  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 28.19/17.90  
% 28.19/17.90  Inference rules
% 28.19/17.90  ----------------------
% 28.19/17.91  #Ref     : 0
% 28.19/17.91  #Sup     : 15542
% 28.19/17.91  #Fact    : 0
% 28.19/17.91  #Define  : 0
% 28.19/17.91  #Split   : 16
% 28.19/17.91  #Chain   : 0
% 28.19/17.91  #Close   : 0
% 28.19/17.91  
% 28.19/17.91  Ordering : KBO
% 28.19/17.91  
% 28.19/17.91  Simplification rules
% 28.19/17.91  ----------------------
% 28.19/17.91  #Subsume      : 4823
% 28.19/17.91  #Demod        : 3613
% 28.19/17.91  #Tautology    : 2121
% 28.19/17.91  #SimpNegUnit  : 828
% 28.19/17.91  #BackRed      : 0
% 28.19/17.91  
% 28.19/17.91  #Partial instantiations: 0
% 28.19/17.91  #Strategies tried      : 1
% 28.19/17.91  
% 28.19/17.91  Timing (in seconds)
% 28.19/17.91  ----------------------
% 28.19/17.91  Preprocessing        : 0.42
% 28.19/17.91  Parsing              : 0.23
% 28.19/17.91  CNF conversion       : 0.02
% 28.19/17.91  Main loop            : 16.42
% 28.19/17.91  Inferencing          : 2.35
% 28.19/17.91  Reduction            : 7.89
% 28.19/17.91  Demodulation         : 5.81
% 28.19/17.91  BG Simplification    : 0.07
% 28.19/17.91  Subsumption          : 5.21
% 28.19/17.91  Abstraction          : 0.13
% 28.19/17.91  MUC search           : 0.00
% 28.19/17.91  Cooper               : 0.00
% 28.19/17.91  Total                : 16.93
% 28.19/17.91  Index Insertion      : 0.00
% 28.19/17.91  Index Deletion       : 0.00
% 28.19/17.91  Index Matching       : 0.00
% 28.19/17.91  BG Taut test         : 0.00
%------------------------------------------------------------------------------