↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP490-1 : TPTP v9.0.0. Released v2.6.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 : n028.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:21 PM UTC 2025

% Result   : Unsatisfiable 3.27s 1.90s
% Output   : CNFRefutation 3.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   35 (  35 unt;   0 typ;   0 def)
%            Number of atoms       :   35 (  34 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  :    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   :   40 (  40   !;   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(double_divide(identity,A),double_divide(identity,double_divide(double_divide(double_divide(A,B),identity),double_divide(C,B)))) = 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_172,plain,
    ! [A_19] : ( double_divide(inverse(A_19),identity) = multiply(identity,A_19) ),
    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_178,plain,
    ! [A_19] : ( multiply(identity,inverse(A_19)) = inverse(multiply(identity,A_19)) ),
    inference(superposition,[status(thm),theory(equality)],[c_172,c_49]) ).

tff(c_123,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_141,plain,
    ! [A_6] : ( inverse(inverse(A_6)) = multiply(identity,A_6) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_123]) ).

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

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

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

tff(c_120,plain,
    ! [A_13,A_6] : ( double_divide(double_divide(identity,A_13),double_divide(identity,double_divide(inverse(inverse(A_13)),inverse(A_6)))) = A_6 ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_103]) ).

tff(c_509,plain,
    ! [A_32,A_33] : ( double_divide(double_divide(identity,A_32),double_divide(identity,double_divide(multiply(identity,A_32),inverse(A_33)))) = A_33 ),
    inference(demodulation,[status(thm),theory(equality)],[c_141,c_120]) ).

tff(c_554,plain,
    ! [A_32] : ( double_divide(double_divide(identity,A_32),double_divide(identity,identity)) = multiply(identity,A_32) ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_509]) ).

tff(c_592,plain,
    ! [A_34] : ( double_divide(double_divide(identity,A_34),inverse(identity)) = multiply(identity,A_34) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_554]) ).

tff(c_624,plain,
    multiply(identity,inverse(identity)) = double_divide(identity,inverse(identity)),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_592]) ).

tff(c_629,plain,
    inverse(multiply(identity,identity)) = identity,
    inference(demodulation,[status(thm),theory(equality)],[c_178,c_8,c_624]) ).

tff(c_620,plain,
    double_divide(inverse(identity),inverse(identity)) = multiply(identity,identity),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_592]) ).

tff(c_731,plain,
    multiply(inverse(identity),inverse(identity)) = inverse(multiply(identity,identity)),
    inference(superposition,[status(thm),theory(equality)],[c_620,c_49]) ).

tff(c_738,plain,
    multiply(inverse(identity),inverse(identity)) = identity,
    inference(demodulation,[status(thm),theory(equality)],[c_629,c_731]) ).

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

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

tff(c_423,plain,
    ! [A_13,A_7] : ( double_divide(double_divide(identity,A_13),double_divide(identity,inverse(multiply(inverse(A_7),A_13)))) = A_7 ),
    inference(demodulation,[status(thm),theory(equality)],[c_49,c_121]) ).

tff(c_744,plain,
    double_divide(double_divide(identity,inverse(identity)),double_divide(identity,inverse(identity))) = identity,
    inference(superposition,[status(thm),theory(equality)],[c_738,c_423]) ).

tff(c_753,plain,
    inverse(identity) = identity,
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_8,c_8,c_744]) ).

tff(c_755,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_58,c_753]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP490-1 : TPTP v9.0.0. Released v2.6.0.
% 0.06/0.13  % 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.13/0.34  % Computer : n028.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:52:49 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.27/1.90  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.27/1.90  
% 3.27/1.90  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------