↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP533-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/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 : n020.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.44s 1.54s
% Output   : CNFRefutation 2.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   12 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :   12 (  11 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   :   16 (  16   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > identity > b1 > a1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_31,axiom,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file(unknown,unknown) ).

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

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

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

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_53,plain,
    ! [B_13] : ( multiply(inverse(B_13),B_13) = identity ),
    inference(superposition,[status(thm),theory(equality)],[c_42,c_8]) ).

tff(c_10,plain,
    multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GRP533-1 : TPTP v9.0.0. Released v2.6.0.
% 0.10/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.14/0.34  % Computer : n020.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Mon Apr  7 21:55:04 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 2.44/1.54  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.44/1.54  
% 2.44/1.54  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------