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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP519-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 : n006.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 4.55s 2.09s
% Output   : CNFRefutation 4.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   30 (  25 unt;   5 typ;   0 def)
%            Number of atoms       :   25 (  24 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 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   :   55 (;  55   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > #nlpp > inverse > c3 > b3 > a3

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_25,axiom,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file(unknown,unknown) ).

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

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

tff(c_28,plain,
    ! [A_7,C_8,C_9,B_10] : ( multiply(A_7,multiply(multiply(inverse(C_8),C_9),multiply(multiply(inverse(multiply(A_7,B_10)),C_8),B_10))) = C_9 ),
    inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).

tff(c_78,plain,
    ! [C_3,C_9] : ( multiply(multiply(inverse(C_3),C_9),C_3) = C_9 ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).

tff(c_81,plain,
    ! [C_11,C_12] : ( multiply(multiply(inverse(C_11),C_12),C_11) = C_12 ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).

tff(c_104,plain,
    ! [C_13,C_14,C_15] : ( multiply(multiply(inverse(C_13),C_14),multiply(multiply(inverse(C_14),C_15),C_13)) = C_15 ),
    inference(superposition,[status(thm),theory(equality)],[c_81,c_2]) ).

tff(c_129,plain,
    ! [C_3,C_9] : ( multiply(multiply(inverse(C_3),C_3),C_9) = C_9 ),
    inference(superposition,[status(thm),theory(equality)],[c_78,c_104]) ).

tff(c_157,plain,
    ! [A_16,B_17,B_18,C_19] : ( multiply(multiply(inverse(multiply(inverse(multiply(A_16,B_17)),B_18)),C_19),B_18) = multiply(A_16,multiply(C_19,B_17)) ),
    inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).

tff(c_311,plain,
    ! [A_22,B_23,C_24] : ( multiply(inverse(multiply(A_22,B_23)),multiply(A_22,multiply(C_24,B_23))) = C_24 ),
    inference(superposition,[status(thm),theory(equality)],[c_157,c_2]) ).

tff(c_376,plain,
    ! [C_9,C_3,C_24] : ( multiply(inverse(C_9),multiply(multiply(inverse(C_3),C_3),multiply(C_24,C_9))) = C_24 ),
    inference(superposition,[status(thm),theory(equality)],[c_129,c_311]) ).

tff(c_445,plain,
    ! [C_25,C_26] : ( multiply(inverse(C_25),multiply(C_26,C_25)) = C_26 ),
    inference(demodulation,[status(thm),theory(equality)],[c_129,c_376]) ).

tff(c_548,plain,
    ! [C_27,C_28] : ( multiply(inverse(multiply(inverse(C_27),C_27)),C_28) = C_28 ),
    inference(superposition,[status(thm),theory(equality)],[c_445,c_2]) ).

tff(c_440,plain,
    ! [C_9,C_24] : ( multiply(inverse(C_9),multiply(C_24,C_9)) = C_24 ),
    inference(demodulation,[status(thm),theory(equality)],[c_129,c_376]) ).

tff(c_562,plain,
    ! [C_24,C_27] : ( multiply(C_24,multiply(inverse(C_27),C_27)) = C_24 ),
    inference(superposition,[status(thm),theory(equality)],[c_548,c_440]) ).

tff(c_665,plain,
    ! [C_29,C_30] : ( multiply(C_29,multiply(inverse(C_30),C_30)) = C_29 ),
    inference(superposition,[status(thm),theory(equality)],[c_548,c_440]) ).

tff(c_178,plain,
    ! [A_16,B_17,C_19] : ( multiply(inverse(multiply(A_16,B_17)),multiply(A_16,multiply(C_19,B_17))) = C_19 ),
    inference(superposition,[status(thm),theory(equality)],[c_157,c_2]) ).

tff(c_690,plain,
    ! [C_29,C_19,C_30] : ( multiply(inverse(C_29),multiply(C_29,multiply(C_19,multiply(inverse(C_30),C_30)))) = C_19 ),
    inference(superposition,[status(thm),theory(equality)],[c_665,c_178]) ).

tff(c_829,plain,
    ! [C_31,C_32] : ( multiply(inverse(C_31),multiply(C_31,C_32)) = C_32 ),
    inference(demodulation,[status(thm),theory(equality)],[c_562,c_690]) ).

tff(c_879,plain,
    ! [C_32,C_31] : ( multiply(C_32,C_31) = multiply(C_31,C_32) ),
    inference(superposition,[status(thm),theory(equality)],[c_829,c_78]) ).

tff(c_501,plain,
    ! [C_26,A_1,B_2] : ( multiply(C_26,multiply(A_1,B_2)) = multiply(A_1,multiply(C_26,B_2)) ),
    inference(superposition,[status(thm),theory(equality)],[c_445,c_2]) ).

tff(c_4,plain,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    inference(cnfTransformation,[status(thm)],[f_25]) ).

tff(c_1011,plain,
    multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
    inference(demodulation,[status(thm),theory(equality)],[c_879,c_4]) ).

tff(c_2520,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_879,c_501,c_1011]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GRP519-1 : TPTP v8.1.2. Released v2.6.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.15/0.36  % Computer : n006.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 21:51:44 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 4.55/2.09  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.55/2.10  
% 4.55/2.10  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.55/2.13  
% 4.55/2.13  Inference rules
% 4.55/2.13  ----------------------
% 4.55/2.13  #Ref     : 0
% 4.55/2.13  #Sup     : 633
% 4.55/2.13  #Fact    : 0
% 4.55/2.13  #Define  : 0
% 4.55/2.13  #Split   : 0
% 4.55/2.13  #Chain   : 0
% 4.55/2.13  #Close   : 0
% 4.55/2.13  
% 4.55/2.13  Ordering : KBO
% 4.55/2.13  
% 4.55/2.13  Simplification rules
% 4.55/2.13  ----------------------
% 4.55/2.13  #Subsume      : 9
% 4.55/2.13  #Demod        : 313
% 4.55/2.13  #Tautology    : 231
% 4.55/2.13  #SimpNegUnit  : 0
% 4.55/2.13  #BackRed      : 6
% 4.55/2.13  
% 4.55/2.13  #Partial instantiations: 0
% 4.55/2.13  #Strategies tried      : 1
% 4.55/2.13  
% 4.55/2.13  Timing (in seconds)
% 4.55/2.13  ----------------------
% 4.55/2.13  Preprocessing        : 0.37
% 4.55/2.13  Parsing              : 0.20
% 4.55/2.13  CNF conversion       : 0.02
% 4.55/2.13  Main loop            : 0.70
% 4.55/2.13  Inferencing          : 0.26
% 4.55/2.13  Reduction            : 0.25
% 4.55/2.13  Demodulation         : 0.21
% 4.55/2.13  BG Simplification    : 0.04
% 4.55/2.13  Subsumption          : 0.10
% 4.55/2.13  Abstraction          : 0.04
% 4.55/2.13  MUC search           : 0.00
% 4.55/2.13  Cooper               : 0.00
% 4.55/2.13  Total                : 1.11
% 4.55/2.13  Index Insertion      : 0.00
% 4.55/2.13  Index Deletion       : 0.00
% 4.55/2.13  Index Matching       : 0.00
% 4.55/2.13  BG Taut test         : 0.00
%------------------------------------------------------------------------------