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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : ROB008-1 : TPTP v8.1.2. Released v1.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 : n011.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:55:04 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ add > #nlpp > negate > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

tff(f_54,axiom,
    add(a,b) != a,
    file(unknown,unknown) ).

tff(f_49,axiom,
    ! [X,Y] : ( negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))) = X ),
    file(unknown,unknown) ).

tff(f_52,axiom,
    negate(add(a,negate(add(b,c)))) = negate(add(a,add(b,negate(c)))),
    file(unknown,unknown) ).

tff(f_47,axiom,
    ! [X,Y,Z] : ( add(add(X,Y),Z) = add(X,add(Y,Z)) ),
    file(unknown,unknown) ).

tff(c_10,plain,
    add(a,b) != a,
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_6,plain,
    ! [X_6,Y_7] : ( negate(add(negate(add(X_6,Y_7)),negate(add(X_6,negate(Y_7))))) = X_6 ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_8,plain,
    negate(add(a,add(b,negate(c)))) = negate(add(a,negate(add(b,c)))),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_4,plain,
    ! [X_3,Y_4,Z_5] : ( add(add(X_3,Y_4),Z_5) = add(X_3,add(Y_4,Z_5)) ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_214,plain,
    ! [X_16,Y_17] : ( negate(add(negate(add(X_16,Y_17)),negate(add(X_16,negate(Y_17))))) = X_16 ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_251,plain,
    ! [X_3,Y_4,Y_17] : ( negate(add(negate(add(add(X_3,Y_4),Y_17)),negate(add(X_3,add(Y_4,negate(Y_17)))))) = add(X_3,Y_4) ),
    inference(superposition,[status(thm),theory(equality)],[c_4,c_214]) ).

tff(c_8662,plain,
    ! [X_71,Y_72,Y_73] : ( negate(add(negate(add(X_71,add(Y_72,Y_73))),negate(add(X_71,add(Y_72,negate(Y_73)))))) = add(X_71,Y_72) ),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_251]) ).

tff(c_8928,plain,
    negate(add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c)))))) = add(a,b),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_8662]) ).

tff(c_9054,plain,
    add(a,b) = a,
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_8928]) ).

tff(c_9056,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_10,c_9054]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : ROB008-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/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 : n011.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 20:35:51 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 11.32/5.08  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.32/5.08  
% 11.32/5.08  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.32/5.11  
% 11.32/5.11  Inference rules
% 11.32/5.11  ----------------------
% 11.32/5.11  #Ref     : 0
% 11.32/5.11  #Sup     : 2401
% 11.32/5.11  #Fact    : 0
% 11.32/5.11  #Define  : 0
% 11.32/5.11  #Split   : 0
% 11.32/5.11  #Chain   : 0
% 11.32/5.11  #Close   : 0
% 11.32/5.11  
% 11.32/5.11  Ordering : KBO
% 11.32/5.11  
% 11.32/5.11  Simplification rules
% 11.32/5.11  ----------------------
% 11.32/5.11  #Subsume      : 239
% 11.32/5.11  #Demod        : 1992
% 11.32/5.11  #Tautology    : 185
% 11.32/5.11  #SimpNegUnit  : 1
% 11.32/5.11  #BackRed      : 0
% 11.32/5.11  
% 11.32/5.11  #Partial instantiations: 0
% 11.32/5.11  #Strategies tried      : 1
% 11.32/5.11  
% 11.32/5.11  Timing (in seconds)
% 11.32/5.11  ----------------------
% 11.32/5.11  Preprocessing        : 0.42
% 11.32/5.11  Parsing              : 0.21
% 11.32/5.12  CNF conversion       : 0.02
% 11.32/5.12  Main loop            : 3.62
% 11.32/5.12  Inferencing          : 0.50
% 11.32/5.12  Reduction            : 2.74
% 11.32/5.12  Demodulation         : 2.62
% 11.32/5.12  BG Simplification    : 0.09
% 11.32/5.12  Subsumption          : 0.21
% 11.32/5.12  Abstraction          : 0.15
% 11.32/5.12  MUC search           : 0.00
% 11.32/5.12  Cooper               : 0.00
% 11.32/5.12  Total                : 4.08
% 11.32/5.12  Index Insertion      : 0.00
% 11.32/5.12  Index Deletion       : 0.00
% 11.32/5.12  Index Matching       : 0.00
% 11.32/5.12  BG Taut test         : 0.00
%------------------------------------------------------------------------------