↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP532-1 : TPTP v9.0.0. Bugfixed v2.7.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 : n032.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 : Wed Apr  9 06:26:27 PM UTC 2025

% Result   : Unsatisfiable 2.98s 1.84s
% Output   : CNFRefutation 3.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   32 (  32 unt;   0 typ;   0 def)
%            Number of atoms       :   32 (  31 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    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   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   :   65 (  65   !;   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_28,axiom,
    ! [A,B] : ( inverse(A) = divide(divide(B,B),A) ),
    file(unknown,unknown) ).

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

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

tff(f_30,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_28]) ).

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_26]) ).

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(divide(A_17,divide(B_18,C_19)),divide(A_17,B_18)) = C_19 ),
    inference(cnfTransformation,[status(thm)],[f_24]) ).

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

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

tff(c_253,plain,
    ! [B_25,C_26] : ( multiply(inverse(divide(B_25,C_26)),B_25) = C_26 ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_157]) ).

tff(c_279,plain,
    ! [C_27,B_28] : ( multiply(C_27,divide(B_28,C_27)) = B_28 ),
    inference(superposition,[status(thm),theory(equality)],[c_122,c_253]) ).

tff(c_173,plain,
    ! [B_20,C_21] : ( inverse(divide(divide(B_20,C_21),B_20)) = C_21 ),
    inference(superposition,[status(thm),theory(equality)],[c_106,c_6]) ).

tff(c_202,plain,
    ! [A_7] : ( inverse(inverse(A_7)) = A_7 ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_173]) ).

tff(c_27,plain,
    ! [A_11,B_12] : ( divide(A_11,inverse(B_12)) = multiply(A_11,B_12) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).

tff(c_45,plain,
    ! [B_8,B_12] : ( multiply(divide(B_8,B_8),B_12) = inverse(inverse(B_12)) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_27]) ).

tff(c_206,plain,
    ! [B_8,B_12] : ( multiply(divide(B_8,B_8),B_12) = B_12 ),
    inference(demodulation,[status(thm),theory(equality)],[c_202,c_45]) ).

tff(c_358,plain,
    ! [B_31,B_32] : ( divide(B_31,divide(B_32,B_32)) = B_31 ),
    inference(superposition,[status(thm),theory(equality)],[c_279,c_206]) ).

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

tff(c_395,plain,
    ! [B_31,B_32,C_3] : ( divide(divide(B_31,divide(divide(B_32,B_32),C_3)),B_31) = C_3 ),
    inference(superposition,[status(thm),theory(equality)],[c_358,c_2]) ).

tff(c_453,plain,
    ! [B_31,C_3] : ( divide(multiply(B_31,C_3),B_31) = C_3 ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_395]) ).

tff(c_286,plain,
    ! [B_28,B_8] : ( divide(B_28,divide(B_8,B_8)) = B_28 ),
    inference(superposition,[status(thm),theory(equality)],[c_279,c_206]) ).

tff(c_274,plain,
    ! [A_7,B_8] : ( multiply(inverse(inverse(A_7)),divide(B_8,B_8)) = A_7 ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_253]) ).

tff(c_308,plain,
    ! [A_29,B_30] : ( multiply(A_29,divide(B_30,B_30)) = A_29 ),
    inference(demodulation,[status(thm),theory(equality)],[c_202,c_274]) ).

tff(c_461,plain,
    ! [B_34,B_33] : ( divide(B_34,B_34) = divide(B_33,B_33) ),
    inference(superposition,[status(thm),theory(equality)],[c_308,c_206]) ).

tff(c_520,plain,
    ! [A_1,B_33,B_34] : ( divide(divide(A_1,divide(B_33,B_33)),divide(A_1,B_34)) = B_34 ),
    inference(superposition,[status(thm),theory(equality)],[c_461,c_2]) ).

tff(c_616,plain,
    ! [A_35,B_36] : ( divide(A_35,divide(A_35,B_36)) = B_36 ),
    inference(demodulation,[status(thm),theory(equality)],[c_286,c_520]) ).

tff(c_262,plain,
    ! [C_19,B_18] : ( multiply(C_19,divide(B_18,C_19)) = B_18 ),
    inference(superposition,[status(thm),theory(equality)],[c_122,c_253]) ).

tff(c_773,plain,
    ! [A_39,B_40] : ( multiply(divide(A_39,B_40),B_40) = A_39 ),
    inference(superposition,[status(thm),theory(equality)],[c_616,c_262]) ).

tff(c_793,plain,
    ! [C_3,B_31] : ( multiply(C_3,B_31) = multiply(B_31,C_3) ),
    inference(superposition,[status(thm),theory(equality)],[c_453,c_773]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.09  % Problem  : GRP532-1 : TPTP v9.0.0. Bugfixed v2.7.0.
% 0.06/0.10  % 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.10/0.28  % Computer : n032.cluster.edu
% 0.10/0.28  % Model    : x86_64 x86_64
% 0.10/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28  % Memory   : 8042.1875MB
% 0.10/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28  % CPULimit : 300
% 0.10/0.28  % WCLimit  : 300
% 0.10/0.28  % DateTime : Mon Apr  7 21:54:46 EDT 2025
% 0.10/0.28  % CPUTime  : 
% 2.98/1.84  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.98/1.84  
% 2.98/1.84  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------