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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP550-1 : TPTP v8.1.2. Released v2.6.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 : n029.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:41:29 EDT 2023

% Result   : Unsatisfiable 2.90s 1.74s
% Output   : CNFRefutation 3.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   37 (  31 unt;   6 typ;   0 def)
%            Number of atoms       :   31 (  30 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    5 (   3   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   38 (;  38   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > identity > b2 > a2

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_29,axiom,
    ! [A] : ( identity = divide(A,A) ),
    file(unknown,unknown) ).

tff(f_27,axiom,
    ! [A] : ( inverse(A) = divide(identity,A) ),
    file(unknown,unknown) ).

tff(f_23,axiom,
    ! [A,B,C] : ( divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C ),
    file(unknown,unknown) ).

tff(f_25,axiom,
    ! [A,B] : ( multiply(A,B) = divide(A,divide(identity,B)) ),
    file(unknown,unknown) ).

tff(f_31,axiom,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file(unknown,unknown) ).

tff(c_8,plain,
    ! [A_7] : ( divide(A_7,A_7) = identity ),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_6,plain,
    ! [A_6] : ( divide(identity,A_6) = inverse(A_6) ),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_2,plain,
    ! [A_1,B_2,C_3] : ( divide(divide(identity,A_1),divide(divide(divide(B_2,A_1),C_3),B_2)) = C_3 ),
    inference(cnfTransformation,[status(thm)],[f_23]) ).

tff(c_183,plain,
    ! [A_17,B_18,C_19] : ( divide(inverse(A_17),divide(divide(divide(B_18,A_17),C_19),B_18)) = C_19 ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_2]) ).

tff(c_297,plain,
    ! [A_23,C_24] : ( divide(inverse(A_23),divide(divide(inverse(A_23),C_24),identity)) = C_24 ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_183]) ).

tff(c_329,plain,
    ! [A_23] : ( divide(inverse(A_23),divide(identity,identity)) = inverse(A_23) ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_297]) ).

tff(c_336,plain,
    ! [A_23] : ( divide(inverse(A_23),identity) = inverse(A_23) ),
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_329]) ).

tff(c_20,plain,
    ! [A_9] : ( divide(identity,A_9) = inverse(A_9) ),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_27,plain,
    inverse(identity) = identity,
    inference(superposition,[status(thm),theory(equality)],[c_20,c_8]) ).

tff(c_322,plain,
    ! [C_24] : ( divide(identity,divide(divide(inverse(identity),C_24),identity)) = C_24 ),
    inference(superposition,[status(thm),theory(equality)],[c_27,c_297]) ).

tff(c_334,plain,
    ! [C_24] : ( inverse(divide(inverse(C_24),identity)) = C_24 ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_6,c_27,c_322]) ).

tff(c_424,plain,
    ! [C_24] : ( inverse(inverse(C_24)) = C_24 ),
    inference(demodulation,[status(thm),theory(equality)],[c_336,c_334]) ).

tff(c_4,plain,
    ! [A_4,B_5] : ( divide(A_4,divide(identity,B_5)) = multiply(A_4,B_5) ),
    inference(cnfTransformation,[status(thm)],[f_25]) ).

tff(c_11,plain,
    ! [A_4,B_5] : ( divide(A_4,inverse(B_5)) = multiply(A_4,B_5) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).

tff(c_222,plain,
    ! [A_17,B_18] : ( divide(inverse(A_17),divide(identity,B_18)) = divide(B_18,A_17) ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_183]) ).

tff(c_231,plain,
    ! [A_20,B_21] : ( multiply(inverse(A_20),B_21) = divide(B_21,A_20) ),
    inference(demodulation,[status(thm),theory(equality)],[c_11,c_6,c_222]) ).

tff(c_258,plain,
    ! [B_21] : ( multiply(identity,B_21) = divide(B_21,identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_27,c_231]) ).

tff(c_42,plain,
    ! [A_10,B_11] : ( divide(A_10,inverse(B_11)) = multiply(A_10,B_11) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).

tff(c_63,plain,
    ! [B_11] : ( inverse(inverse(B_11)) = multiply(identity,B_11) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_42]) ).

tff(c_268,plain,
    ! [B_11] : ( inverse(inverse(B_11)) = divide(B_11,identity) ),
    inference(demodulation,[status(thm),theory(equality)],[c_258,c_63]) ).

tff(c_450,plain,
    ! [B_11] : ( divide(B_11,identity) = B_11 ),
    inference(demodulation,[status(thm),theory(equality)],[c_424,c_268]) ).

tff(c_53,plain,
    ! [B_11] : ( multiply(inverse(B_11),B_11) = identity ),
    inference(superposition,[status(thm),theory(equality)],[c_42,c_8]) ).

tff(c_10,plain,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_70,plain,
    multiply(identity,a2) != a2,
    inference(demodulation,[status(thm),theory(equality)],[c_53,c_10]) ).

tff(c_269,plain,
    divide(a2,identity) != a2,
    inference(demodulation,[status(thm),theory(equality)],[c_258,c_70]) ).

tff(c_560,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_450,c_269]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP550-1 : TPTP v8.1.2. Released v2.6.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 : n029.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 22:24:37 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 2.90/1.74  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.90/1.75  
% 2.90/1.75  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.10/1.77  
% 3.10/1.77  Inference rules
% 3.10/1.77  ----------------------
% 3.10/1.77  #Ref     : 0
% 3.10/1.77  #Sup     : 137
% 3.10/1.77  #Fact    : 0
% 3.10/1.77  #Define  : 0
% 3.10/1.77  #Split   : 0
% 3.10/1.77  #Chain   : 0
% 3.10/1.77  #Close   : 0
% 3.10/1.77  
% 3.10/1.77  Ordering : KBO
% 3.10/1.77  
% 3.10/1.77  Simplification rules
% 3.10/1.77  ----------------------
% 3.10/1.77  #Subsume      : 0
% 3.10/1.77  #Demod        : 104
% 3.10/1.77  #Tautology    : 70
% 3.10/1.77  #SimpNegUnit  : 0
% 3.10/1.77  #BackRed      : 11
% 3.10/1.77  
% 3.10/1.77  #Partial instantiations: 0
% 3.10/1.77  #Strategies tried      : 1
% 3.10/1.77  
% 3.10/1.77  Timing (in seconds)
% 3.10/1.77  ----------------------
% 3.10/1.78  Preprocessing        : 0.40
% 3.10/1.78  Parsing              : 0.21
% 3.10/1.78  CNF conversion       : 0.02
% 3.10/1.78  Main loop            : 0.33
% 3.10/1.78  Inferencing          : 0.12
% 3.10/1.78  Reduction            : 0.11
% 3.10/1.78  Demodulation         : 0.08
% 3.10/1.78  BG Simplification    : 0.02
% 3.10/1.78  Subsumption          : 0.06
% 3.10/1.78  Abstraction          : 0.02
% 3.10/1.78  MUC search           : 0.00
% 3.10/1.78  Cooper               : 0.00
% 3.10/1.78  Total                : 0.77
% 3.10/1.78  Index Insertion      : 0.00
% 3.10/1.78  Index Deletion       : 0.00
% 3.10/1.78  Index Matching       : 0.00
% 3.10/1.78  BG Taut test         : 0.00
%------------------------------------------------------------------------------