↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP540-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 : 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 : Wed Apr  9 06:26:28 PM UTC 2025

% Result   : Unsatisfiable 3.21s 1.86s
% Output   : CNFRefutation 3.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   39 (  39 unt;   0 typ;   0 def)
%            Number of atoms       :   39 (  38 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    :    4 (   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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   62 (  62   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > identity > 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(identity,type,
    identity: $i ).

tff(f_30,axiom,
    ! [A] : ( identity = divide(A,A) ),
    file(unknown,unknown) ).

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,B),divide(divide(A,C),B)) = C ),
    file(unknown,unknown) ).

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

tff(c_8,plain,
    ! [A_9] : ( divide(A_9,A_9) = identity ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

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_11,plain,
    ! [A_7] : ( divide(identity,A_7) = inverse(A_7) ),
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_6]) ).

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_12,plain,
    ! [A_4,B_5] : ( divide(A_4,inverse(B_5)) = multiply(A_4,B_5) ),
    inference(demodulation,[status(thm),theory(equality)],[c_11,c_8,c_4]) ).

tff(c_85,plain,
    ! [A_15,B_16,C_17] : ( divide(divide(A_15,B_16),divide(divide(A_15,C_17),B_16)) = C_17 ),
    inference(cnfTransformation,[status(thm)],[f_24]) ).

tff(c_131,plain,
    ! [A_9,B_16] : ( divide(divide(A_9,B_16),divide(identity,B_16)) = A_9 ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_85]) ).

tff(c_168,plain,
    ! [A_19,B_20] : ( multiply(divide(A_19,B_20),B_20) = A_19 ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_11,c_131]) ).

tff(c_186,plain,
    ! [A_9] : ( multiply(identity,A_9) = A_9 ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_168]) ).

tff(c_20,plain,
    ! [A_11] : ( divide(identity,A_11) = inverse(A_11) ),
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_6]) ).

tff(c_27,plain,
    inverse(identity) = identity,
    inference(superposition,[status(thm),theory(equality)],[c_20,c_8]) ).

tff(c_42,plain,
    ! [A_12,B_13] : ( divide(A_12,inverse(B_13)) = multiply(A_12,B_13) ),
    inference(demodulation,[status(thm),theory(equality)],[c_11,c_8,c_4]) ).

tff(c_254,plain,
    ! [A_24] : ( multiply(A_24,identity) = divide(A_24,identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_27,c_42]) ).

tff(c_142,plain,
    ! [A_9,B_16] : ( multiply(divide(A_9,B_16),B_16) = A_9 ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_11,c_131]) ).

tff(c_291,plain,
    ! [A_25] : ( divide(divide(A_25,identity),identity) = A_25 ),
    inference(superposition,[status(thm),theory(equality)],[c_254,c_142]) ).

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

tff(c_332,plain,
    ! [A_26] : ( divide(divide(A_26,identity),A_26) = identity ),
    inference(superposition,[status(thm),theory(equality)],[c_291,c_2]) ).

tff(c_349,plain,
    ! [A_26] : ( multiply(identity,A_26) = divide(A_26,identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_332,c_142]) ).

tff(c_392,plain,
    ! [A_26] : ( divide(A_26,identity) = A_26 ),
    inference(demodulation,[status(thm),theory(equality)],[c_186,c_349]) ).

tff(c_404,plain,
    ! [A_27] : ( divide(A_27,identity) = A_27 ),
    inference(demodulation,[status(thm),theory(equality)],[c_186,c_349]) ).

tff(c_420,plain,
    ! [A_1,C_3] : ( divide(divide(A_1,identity),divide(A_1,C_3)) = C_3 ),
    inference(superposition,[status(thm),theory(equality)],[c_404,c_2]) ).

tff(c_545,plain,
    ! [A_31,C_32] : ( divide(A_31,divide(A_31,C_32)) = C_32 ),
    inference(demodulation,[status(thm),theory(equality)],[c_392,c_420]) ).

tff(c_562,plain,
    ! [C_32,A_31] : ( multiply(C_32,divide(A_31,C_32)) = A_31 ),
    inference(superposition,[status(thm),theory(equality)],[c_545,c_142]) ).

tff(c_63,plain,
    ! [B_13] : ( inverse(inverse(B_13)) = multiply(identity,B_13) ),
    inference(superposition,[status(thm),theory(equality)],[c_11,c_42]) ).

tff(c_190,plain,
    ! [B_13] : ( inverse(inverse(B_13)) = B_13 ),
    inference(demodulation,[status(thm),theory(equality)],[c_186,c_63]) ).

tff(c_125,plain,
    ! [B_16,A_7] : ( divide(divide(identity,B_16),divide(inverse(A_7),B_16)) = A_7 ),
    inference(superposition,[status(thm),theory(equality)],[c_11,c_85]) ).

tff(c_491,plain,
    ! [B_29,A_30] : ( divide(inverse(B_29),divide(inverse(A_30),B_29)) = A_30 ),
    inference(demodulation,[status(thm),theory(equality)],[c_11,c_125]) ).

tff(c_526,plain,
    ! [B_5,A_30] : ( divide(inverse(inverse(B_5)),multiply(inverse(A_30),B_5)) = A_30 ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_491]) ).

tff(c_775,plain,
    ! [B_38,A_39] : ( divide(B_38,multiply(inverse(A_39),B_38)) = A_39 ),
    inference(demodulation,[status(thm),theory(equality)],[c_190,c_526]) ).

tff(c_812,plain,
    ! [A_31,A_39] : ( divide(divide(A_31,inverse(A_39)),A_31) = A_39 ),
    inference(superposition,[status(thm),theory(equality)],[c_562,c_775]) ).

tff(c_843,plain,
    ! [A_40,A_41] : ( divide(multiply(A_40,A_41),A_40) = A_41 ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_812]) ).

tff(c_859,plain,
    ! [A_41,A_40] : ( multiply(A_41,A_40) = multiply(A_40,A_41) ),
    inference(superposition,[status(thm),theory(equality)],[c_843,c_142]) ).

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

tff(c_998,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_859,c_10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GRP540-1 : TPTP v9.0.0. Bugfixed v2.7.0.
% 0.12/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.34  % Computer : n031.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % 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 : Mon Apr  7 21:55:22 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.21/1.86  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.21/1.86  
% 3.21/1.86  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------