↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP518-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 : n014.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:25 PM UTC 2025

% Result   : Unsatisfiable 2.72s 1.67s
% Output   : CNFRefutation 2.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   11 (  10 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   22 (  22   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > #nlpp > inverse > b2 > a2

%Foreground sorts:

%Background operators:

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

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

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

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

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

tff(f_25,axiom,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file(unknown,unknown) ).

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

tff(c_5,plain,
    ! [A_4,B_5,C_6] : ( multiply(A_4,multiply(multiply(inverse(multiply(A_4,B_5)),C_6),B_5)) = C_6 ),
    inference(cnfTransformation,[status(thm)],[f_23]) ).

tff(c_28,plain,
    ! [A_7,C_8,C_9,B_10] : ( multiply(A_7,multiply(multiply(inverse(C_8),C_9),multiply(multiply(inverse(multiply(A_7,B_10)),C_8),B_10))) = C_9 ),
    inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).

tff(c_78,plain,
    ! [C_3,C_9] : ( multiply(multiply(inverse(C_3),C_9),C_3) = C_9 ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).

tff(c_81,plain,
    ! [C_11,C_12] : ( multiply(multiply(inverse(C_11),C_12),C_11) = C_12 ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).

tff(c_104,plain,
    ! [C_13,C_14,C_15] : ( multiply(multiply(inverse(C_13),C_14),multiply(multiply(inverse(C_14),C_15),C_13)) = C_15 ),
    inference(superposition,[status(thm),theory(equality)],[c_81,c_2]) ).

tff(c_129,plain,
    ! [C_3,C_9] : ( multiply(multiply(inverse(C_3),C_3),C_9) = C_9 ),
    inference(superposition,[status(thm),theory(equality)],[c_78,c_104]) ).

tff(c_4,plain,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    inference(cnfTransformation,[status(thm)],[f_25]) ).

tff(c_223,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_129,c_4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP518-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 : n014.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:54:04 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 2.72/1.67  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.72/1.67  
% 2.72/1.67  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------