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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP487-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 : n002.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:21 EDT 2023

% Result   : Unsatisfiable 3.46s 1.95s
% Output   : CNFRefutation 3.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   43 (  38 unt;   5 typ;   0 def)
%            Number of atoms       :   38 (  37 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   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  :    5 (   3   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   46 (;  46   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > double_divide > #nlpp > inverse > identity > a1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_31,axiom,
    multiply(inverse(a1),a1) != identity,
    file(unknown,unknown) ).

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

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

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

tff(c_28,plain,
    ! [B_10,A_11] : ( double_divide(double_divide(B_10,A_11),identity) = multiply(A_11,B_10) ),
    inference(cnfTransformation,[status(thm)],[f_25]) ).

tff(c_52,plain,
    ! [A_7] : ( multiply(inverse(A_7),A_7) = double_divide(identity,identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_28]) ).

tff(c_57,plain,
    ! [A_7] : ( multiply(inverse(A_7),A_7) = inverse(identity) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_52]) ).

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

tff(c_58,plain,
    inverse(identity) != identity,
    inference(demodulation,[status(thm),theory(equality)],[c_57,c_10]) ).

tff(c_46,plain,
    ! [A_6] : ( double_divide(inverse(A_6),identity) = multiply(identity,A_6) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_28]) ).

tff(c_49,plain,
    ! [B_10,A_11] : ( inverse(double_divide(B_10,A_11)) = multiply(A_11,B_10) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_28]) ).

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

tff(c_66,plain,
    ! [A_13,B_14,C_15] : ( double_divide(A_13,inverse(double_divide(double_divide(identity,double_divide(inverse(A_13),double_divide(B_14,C_15))),B_14))) = C_15 ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_6,c_2]) ).

tff(c_91,plain,
    ! [A_13,A_6] : ( double_divide(A_13,inverse(double_divide(double_divide(identity,double_divide(inverse(A_13),inverse(A_6))),A_6))) = identity ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_66]) ).

tff(c_699,plain,
    ! [A_38,A_39] : ( double_divide(A_38,multiply(A_39,double_divide(identity,double_divide(inverse(A_38),inverse(A_39))))) = identity ),
    inference(demodulation,[status(thm),theory(equality)],[c_49,c_91]) ).

tff(c_760,plain,
    ! [A_38] : ( double_divide(A_38,multiply(inverse(A_38),double_divide(identity,identity))) = identity ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_699]) ).

tff(c_769,plain,
    ! [A_40] : ( double_divide(A_40,multiply(inverse(A_40),inverse(identity))) = identity ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_760]) ).

tff(c_805,plain,
    double_divide(inverse(identity),inverse(identity)) = identity,
    inference(superposition,[status(thm),theory(equality)],[c_57,c_769]) ).

tff(c_104,plain,
    ! [B_16,A_17] : ( inverse(double_divide(B_16,A_17)) = multiply(A_17,B_16) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_28]) ).

tff(c_122,plain,
    ! [A_6] : ( inverse(inverse(A_6)) = multiply(identity,A_6) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_104]) ).

tff(c_98,plain,
    ! [A_13,A_7] : ( double_divide(A_13,inverse(double_divide(double_divide(identity,double_divide(inverse(A_13),identity)),A_7))) = inverse(A_7) ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_66]) ).

tff(c_102,plain,
    ! [A_13,A_7] : ( double_divide(A_13,inverse(double_divide(double_divide(identity,inverse(inverse(A_13))),A_7))) = inverse(A_7) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_98]) ).

tff(c_347,plain,
    ! [A_27,A_28] : ( double_divide(A_27,multiply(A_28,double_divide(identity,multiply(identity,A_27)))) = inverse(A_28) ),
    inference(demodulation,[status(thm),theory(equality)],[c_122,c_49,c_102]) ).

tff(c_387,plain,
    ! [A_27] : ( inverse(inverse(double_divide(identity,multiply(identity,A_27)))) = double_divide(A_27,inverse(identity)) ),
    inference(superposition,[status(thm),theory(equality)],[c_57,c_347]) ).

tff(c_393,plain,
    ! [A_27] : ( inverse(multiply(multiply(identity,A_27),identity)) = double_divide(A_27,inverse(identity)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_49,c_387]) ).

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

tff(c_468,plain,
    ! [A_31,C_32] : ( double_divide(A_31,inverse(multiply(double_divide(inverse(A_31),double_divide(identity,C_32)),identity))) = C_32 ),
    inference(superposition,[status(thm),theory(equality)],[c_4,c_66]) ).

tff(c_515,plain,
    ! [A_31] : ( double_divide(A_31,inverse(multiply(double_divide(inverse(A_31),identity),identity))) = inverse(identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_468]) ).

tff(c_519,plain,
    ! [A_31] : ( double_divide(A_31,inverse(multiply(multiply(identity,A_31),identity))) = inverse(identity) ),
    inference(demodulation,[status(thm),theory(equality)],[c_122,c_6,c_515]) ).

tff(c_556,plain,
    ! [A_31] : ( double_divide(A_31,double_divide(A_31,inverse(identity))) = inverse(identity) ),
    inference(demodulation,[status(thm),theory(equality)],[c_393,c_519]) ).

tff(c_819,plain,
    double_divide(inverse(identity),identity) = inverse(identity),
    inference(superposition,[status(thm),theory(equality)],[c_805,c_556]) ).

tff(c_869,plain,
    multiply(identity,identity) = inverse(identity),
    inference(superposition,[status(thm),theory(equality)],[c_46,c_819]) ).

tff(c_938,plain,
    inverse(multiply(inverse(identity),identity)) = double_divide(identity,inverse(identity)),
    inference(superposition,[status(thm),theory(equality)],[c_869,c_393]) ).

tff(c_956,plain,
    inverse(identity) = identity,
    inference(demodulation,[status(thm),theory(equality)],[c_869,c_122,c_57,c_8,c_938]) ).

tff(c_958,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_58,c_956]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : GRP487-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.15  % 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.15/0.36  % Computer : n002.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 22:30:31 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 3.46/1.95  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.46/1.96  
% 3.46/1.96  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.46/2.02  
% 3.46/2.02  Inference rules
% 3.46/2.02  ----------------------
% 3.46/2.02  #Ref     : 0
% 3.46/2.02  #Sup     : 255
% 3.46/2.02  #Fact    : 0
% 3.46/2.02  #Define  : 0
% 3.46/2.02  #Split   : 0
% 3.46/2.02  #Chain   : 0
% 3.46/2.02  #Close   : 0
% 3.46/2.02  
% 3.46/2.02  Ordering : KBO
% 3.46/2.02  
% 3.46/2.02  Simplification rules
% 3.46/2.02  ----------------------
% 3.46/2.02  #Subsume      : 0
% 3.46/2.02  #Demod        : 186
% 3.46/2.02  #Tautology    : 117
% 3.46/2.02  #SimpNegUnit  : 1
% 3.46/2.02  #BackRed      : 4
% 3.46/2.02  
% 3.46/2.02  #Partial instantiations: 0
% 3.46/2.02  #Strategies tried      : 1
% 3.46/2.02  
% 3.46/2.02  Timing (in seconds)
% 3.46/2.02  ----------------------
% 3.46/2.02  Preprocessing        : 0.42
% 3.46/2.02  Parsing              : 0.22
% 3.46/2.02  CNF conversion       : 0.02
% 3.46/2.02  Main loop            : 0.48
% 3.46/2.02  Inferencing          : 0.18
% 3.46/2.02  Reduction            : 0.16
% 3.46/2.03  Demodulation         : 0.12
% 3.46/2.03  BG Simplification    : 0.02
% 3.46/2.03  Subsumption          : 0.08
% 3.46/2.03  Abstraction          : 0.03
% 3.46/2.03  MUC search           : 0.00
% 3.46/2.03  Cooper               : 0.00
% 3.46/2.03  Total                : 0.98
% 3.46/2.03  Index Insertion      : 0.00
% 3.46/2.03  Index Deletion       : 0.00
% 3.46/2.03  Index Matching       : 0.00
% 3.46/2.03  BG Taut test         : 0.00
%------------------------------------------------------------------------------