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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP524-1 : TPTP v8.1.2. Bugfixed v2.7.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 : 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:26 EDT 2023

% Result   : Unsatisfiable 3.38s 1.98s
% Output   : CNFRefutation 3.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   33 (  28 unt;   5 typ;   0 def)
%            Number of atoms       :   28 (  27 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    6 (   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   :   61 (;  61   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_31,axiom,
    multiply(a,b) != multiply(b,a),
    file(unknown,unknown) ).

tff(c_6,plain,
    ! [B_8,A_7] : ( divide(divide(B_8,B_8),A_7) = inverse(A_7) ),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

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

tff(c_9,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_106,plain,
    ! [A_17,B_18,C_19] : ( divide(A_17,divide(B_18,divide(C_19,divide(A_17,B_18)))) = C_19 ),
    inference(cnfTransformation,[status(thm)],[f_25]) ).

tff(c_123,plain,
    ! [B_18,C_19,B_8] : ( inverse(divide(B_18,divide(C_19,divide(divide(B_8,B_8),B_18)))) = C_19 ),
    inference(superposition,[status(thm),theory(equality)],[c_106,c_6]) ).

tff(c_168,plain,
    ! [B_18,C_19] : ( inverse(divide(B_18,multiply(C_19,B_18))) = C_19 ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_123]) ).

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

tff(c_708,plain,
    ! [B_33,C_34,A_35] : ( divide(B_33,divide(divide(C_34,divide(A_35,B_33)),C_34)) = A_35 ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_106]) ).

tff(c_908,plain,
    ! [B_38,A_39] : ( divide(B_38,inverse(divide(A_39,B_38))) = A_39 ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_708]) ).

tff(c_972,plain,
    ! [C_19,B_18] : ( divide(multiply(C_19,B_18),C_19) = B_18 ),
    inference(superposition,[status(thm),theory(equality)],[c_168,c_908]) ).

tff(c_157,plain,
    ! [B_8,A_17,B_18] : ( divide(B_8,B_8) = divide(A_17,divide(B_18,inverse(divide(A_17,B_18)))) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_106]) ).

tff(c_267,plain,
    ! [B_24,A_25,B_26] : ( divide(B_24,B_24) = divide(A_25,multiply(B_26,divide(A_25,B_26))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_157]) ).

tff(c_175,plain,
    ! [B_8,A_17,B_18] : ( divide(B_8,B_8) = divide(A_17,multiply(B_18,divide(A_17,B_18))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_157]) ).

tff(c_385,plain,
    ! [B_28,B_27] : ( divide(B_28,B_28) = divide(B_27,B_27) ),
    inference(superposition,[status(thm),theory(equality)],[c_267,c_175]) ).

tff(c_455,plain,
    ! [B_8,B_28] : ( inverse(divide(B_8,B_8)) = divide(B_28,B_28) ),
    inference(superposition,[status(thm),theory(equality)],[c_385,c_6]) ).

tff(c_1162,plain,
    ! [B_45,B_46] : ( divide(B_45,divide(B_46,B_46)) = B_45 ),
    inference(superposition,[status(thm),theory(equality)],[c_455,c_908]) ).

tff(c_1388,plain,
    ! [B_49,B_50] : ( divide(B_49,divide(B_49,B_50)) = B_50 ),
    inference(superposition,[status(thm),theory(equality)],[c_1162,c_2]) ).

tff(c_272,plain,
    ! [B_8,B_24] : ( divide(B_8,B_8) = divide(B_24,B_24) ),
    inference(superposition,[status(thm),theory(equality)],[c_267,c_175]) ).

tff(c_772,plain,
    ! [B_33,B_8,A_35] : ( divide(B_33,divide(divide(B_8,B_8),divide(A_35,B_33))) = A_35 ),
    inference(superposition,[status(thm),theory(equality)],[c_272,c_708]) ).

tff(c_848,plain,
    ! [B_33,A_35] : ( multiply(B_33,divide(A_35,B_33)) = A_35 ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_772]) ).

tff(c_1524,plain,
    ! [B_51,B_52] : ( multiply(divide(B_51,B_52),B_52) = B_51 ),
    inference(superposition,[status(thm),theory(equality)],[c_1388,c_848]) ).

tff(c_1561,plain,
    ! [C_19,B_18] : ( multiply(C_19,B_18) = multiply(B_18,C_19) ),
    inference(superposition,[status(thm),theory(equality)],[c_972,c_1524]) ).

tff(c_8,plain,
    multiply(b,a) != multiply(a,b),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_1704,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1561,c_8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : GRP524-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.00/0.10  % 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.10/0.30  % Computer : n031.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 300
% 0.10/0.30  % DateTime : Thu Aug  3 22:24:14 EDT 2023
% 0.10/0.30  % CPUTime  : 
% 3.38/1.98  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.38/1.98  
% 3.38/1.98  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.38/2.01  
% 3.38/2.01  Inference rules
% 3.38/2.01  ----------------------
% 3.38/2.01  #Ref     : 0
% 3.38/2.01  #Sup     : 458
% 3.38/2.01  #Fact    : 0
% 3.38/2.01  #Define  : 0
% 3.38/2.01  #Split   : 0
% 3.38/2.01  #Chain   : 0
% 3.38/2.01  #Close   : 0
% 3.38/2.01  
% 3.38/2.01  Ordering : KBO
% 3.38/2.01  
% 3.38/2.01  Simplification rules
% 3.38/2.01  ----------------------
% 3.38/2.01  #Subsume      : 54
% 3.38/2.01  #Demod        : 153
% 3.38/2.01  #Tautology    : 139
% 3.38/2.01  #SimpNegUnit  : 0
% 3.38/2.01  #BackRed      : 4
% 3.38/2.01  
% 3.38/2.01  #Partial instantiations: 0
% 3.38/2.01  #Strategies tried      : 1
% 3.38/2.01  
% 3.38/2.01  Timing (in seconds)
% 3.38/2.01  ----------------------
% 3.38/2.01  Preprocessing        : 0.40
% 3.38/2.01  Parsing              : 0.20
% 3.38/2.01  CNF conversion       : 0.02
% 3.38/2.01  Main loop            : 0.53
% 3.38/2.01  Inferencing          : 0.20
% 3.38/2.01  Reduction            : 0.17
% 3.38/2.01  Demodulation         : 0.13
% 3.38/2.01  BG Simplification    : 0.03
% 3.38/2.01  Subsumption          : 0.09
% 3.38/2.02  Abstraction          : 0.03
% 3.38/2.02  MUC search           : 0.00
% 3.38/2.02  Cooper               : 0.00
% 3.38/2.02  Total                : 0.98
% 3.38/2.02  Index Insertion      : 0.00
% 3.38/2.02  Index Deletion       : 0.00
% 3.38/2.02  Index Matching       : 0.00
% 3.38/2.02  BG Taut test         : 0.00
%------------------------------------------------------------------------------