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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP514-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/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 : n031.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:25 EDT 2023

% Result   : Unsatisfiable 3.64s 1.89s
% Output   : CNFRefutation 3.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   29 (  25 unt;   4 typ;   0 def)
%            Number of atoms       :   25 (  24 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    8 (   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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   57 (;  57   !;   0   ?;   0   :)

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

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

tff(c_5,plain,
    ! [A_4,B_5,C_6] : ( multiply(A_4,multiply(multiply(B_5,C_6),inverse(multiply(A_4,C_6)))) = B_5 ),
    inference(cnfTransformation,[status(thm)],[f_23]) ).

tff(c_26,plain,
    ! [A_7,B_8,C_9,A_10] : ( multiply(A_7,multiply(B_8,inverse(multiply(A_7,multiply(multiply(B_8,C_9),inverse(multiply(A_10,C_9))))))) = A_10 ),
    inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).

tff(c_62,plain,
    ! [A_11,B_12] : ( multiply(A_11,multiply(B_12,inverse(B_12))) = A_11 ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_26]) ).

tff(c_8,plain,
    ! [A_1,B_5,C_6,A_4] : ( multiply(A_1,multiply(B_5,inverse(multiply(A_1,multiply(multiply(B_5,C_6),inverse(multiply(A_4,C_6))))))) = A_4 ),
    inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).

tff(c_75,plain,
    ! [A_11,B_5] : ( multiply(A_11,multiply(B_5,inverse(A_11))) = B_5 ),
    inference(superposition,[status(thm),theory(equality)],[c_62,c_8]) ).

tff(c_101,plain,
    ! [A_13,B_14] : ( multiply(A_13,multiply(B_14,inverse(A_13))) = B_14 ),
    inference(superposition,[status(thm),theory(equality)],[c_62,c_8]) ).

tff(c_118,plain,
    ! [A_4,C_6,B_5] : ( multiply(multiply(A_4,C_6),multiply(B_5,inverse(multiply(B_5,C_6)))) = A_4 ),
    inference(superposition,[status(thm),theory(equality)],[c_101,c_8]) ).

tff(c_220,plain,
    ! [A_19,C_20,B_21] : ( multiply(multiply(A_19,C_20),multiply(B_21,inverse(multiply(B_21,C_20)))) = A_19 ),
    inference(superposition,[status(thm),theory(equality)],[c_101,c_8]) ).

tff(c_497,plain,
    ! [A_28,C_29,B_30] : ( multiply(multiply(A_28,C_29),multiply(B_30,inverse(A_28))) = multiply(B_30,C_29) ),
    inference(superposition,[status(thm),theory(equality)],[c_220,c_8]) ).

tff(c_136,plain,
    ! [A_15,B_16,B_17,C_18] : ( multiply(A_15,multiply(multiply(B_16,multiply(multiply(B_17,C_18),inverse(multiply(A_15,C_18)))),inverse(B_17))) = B_16 ),
    inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).

tff(c_180,plain,
    ! [A_15,B_17,C_18] : ( multiply(A_15,multiply(multiply(B_17,C_18),inverse(B_17))) = multiply(A_15,C_18) ),
    inference(superposition,[status(thm),theory(equality)],[c_75,c_136]) ).

tff(c_510,plain,
    ! [A_28,C_29,C_18] : ( multiply(multiply(A_28,C_29),C_18) = multiply(multiply(A_28,C_18),C_29) ),
    inference(superposition,[status(thm),theory(equality)],[c_497,c_180]) ).

tff(c_124,plain,
    ! [A_13,B_2,B_14] : ( multiply(A_13,multiply(multiply(B_2,multiply(B_14,inverse(A_13))),inverse(B_14))) = B_2 ),
    inference(superposition,[status(thm),theory(equality)],[c_101,c_2]) ).

tff(c_882,plain,
    ! [A_34,B_35,B_36] : ( multiply(A_34,multiply(multiply(B_35,inverse(B_36)),multiply(B_36,inverse(A_34)))) = B_35 ),
    inference(demodulation,[status(thm),theory(equality)],[c_510,c_124]) ).

tff(c_950,plain,
    ! [B_5,A_4] : ( multiply(multiply(B_5,inverse(B_5)),A_4) = A_4 ),
    inference(superposition,[status(thm),theory(equality)],[c_118,c_882]) ).

tff(c_975,plain,
    ! [B_37,A_38] : ( multiply(multiply(B_37,inverse(B_37)),A_38) = A_38 ),
    inference(superposition,[status(thm),theory(equality)],[c_118,c_882]) ).

tff(c_1001,plain,
    ! [B_37,C_18,A_38] : ( multiply(multiply(multiply(B_37,inverse(B_37)),C_18),A_38) = multiply(A_38,C_18) ),
    inference(superposition,[status(thm),theory(equality)],[c_975,c_510]) ).

tff(c_1168,plain,
    ! [C_18,A_38] : ( multiply(C_18,A_38) = multiply(A_38,C_18) ),
    inference(demodulation,[status(thm),theory(equality)],[c_950,c_1001]) ).

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

tff(c_614,plain,
    multiply(multiply(inverse(b2),a2),b2) != a2,
    inference(demodulation,[status(thm),theory(equality)],[c_510,c_4]) ).

tff(c_1189,plain,
    multiply(b2,multiply(a2,inverse(b2))) != a2,
    inference(demodulation,[status(thm),theory(equality)],[c_1168,c_1168,c_614]) ).

tff(c_1193,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_75,c_1189]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP514-1 : TPTP v8.1.2. Released v2.6.0.
% 0.06/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.33  % Computer : n031.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % 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:27:45 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 3.64/1.89  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.64/1.89  
% 3.64/1.89  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.64/1.92  
% 3.64/1.92  Inference rules
% 3.64/1.92  ----------------------
% 3.64/1.92  #Ref     : 0
% 3.64/1.92  #Sup     : 311
% 3.64/1.92  #Fact    : 0
% 3.64/1.92  #Define  : 0
% 3.64/1.92  #Split   : 0
% 3.64/1.92  #Chain   : 0
% 3.64/1.92  #Close   : 0
% 3.64/1.92  
% 3.64/1.92  Ordering : KBO
% 3.64/1.92  
% 3.64/1.92  Simplification rules
% 3.64/1.92  ----------------------
% 3.64/1.92  #Subsume      : 5
% 3.64/1.92  #Demod        : 103
% 3.64/1.92  #Tautology    : 101
% 3.64/1.92  #SimpNegUnit  : 0
% 3.64/1.92  #BackRed      : 4
% 3.64/1.92  
% 3.64/1.92  #Partial instantiations: 0
% 3.64/1.92  #Strategies tried      : 1
% 3.64/1.92  
% 3.64/1.92  Timing (in seconds)
% 3.64/1.92  ----------------------
% 3.64/1.92  Preprocessing        : 0.35
% 3.64/1.92  Parsing              : 0.18
% 3.64/1.92  CNF conversion       : 0.02
% 3.64/1.92  Main loop            : 0.53
% 3.64/1.92  Inferencing          : 0.22
% 3.64/1.92  Reduction            : 0.17
% 3.64/1.92  Demodulation         : 0.14
% 3.64/1.92  BG Simplification    : 0.03
% 3.64/1.92  Subsumption          : 0.08
% 3.64/1.92  Abstraction          : 0.04
% 3.64/1.92  MUC search           : 0.00
% 3.64/1.92  Cooper               : 0.00
% 3.64/1.92  Total                : 0.92
% 3.64/1.92  Index Insertion      : 0.00
% 3.64/1.92  Index Deletion       : 0.00
% 3.64/1.92  Index Matching       : 0.00
% 3.64/1.92  BG Taut test         : 0.00
%------------------------------------------------------------------------------