↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP195-1 : TPTP v9.0.0. Released v2.2.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 : n019.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:25:32 PM UTC 2025

% Result   : Unsatisfiable 8.45s 3.24s
% Output   : CNFRefutation 8.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :   14 (  13 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    8 (   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    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   28 (  28   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > #nlpp > b > a

%Foreground sorts:

%Background operators:

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

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

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

tff(f_53,axiom,
    ! [X,Y] : ( multiply(X,multiply(Y,Y)) = multiply(Y,multiply(Y,X)) ),
    file(unknown,unknown) ).

tff(f_48,axiom,
    ! [X,Y,Z] : ( multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ),
    file(unknown,unknown) ).

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

tff(c_4,plain,
    ! [Y_5,X_4] : ( multiply(Y_5,multiply(Y_5,X_4)) = multiply(X_4,multiply(Y_5,Y_5)) ),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_38,plain,
    ! [X_8,Y_9,Z_10] : ( multiply(multiply(X_8,Y_9),Z_10) = multiply(X_8,multiply(Y_9,Z_10)) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_59,plain,
    ! [Y_5,X_8,Y_9] : ( multiply(Y_5,multiply(Y_5,multiply(X_8,Y_9))) = multiply(X_8,multiply(Y_9,multiply(Y_5,Y_5))) ),
    inference(superposition,[status(thm),theory(equality)],[c_38,c_4]) ).

tff(c_220,plain,
    ! [Y_13,X_14,Y_15] : ( multiply(Y_13,multiply(Y_13,multiply(X_14,Y_15))) = multiply(X_14,multiply(Y_15,multiply(Y_13,Y_13))) ),
    inference(superposition,[status(thm),theory(equality)],[c_38,c_4]) ).

tff(c_420,plain,
    ! [Y_5,X_14,X_4] : ( multiply(Y_5,multiply(Y_5,multiply(X_14,X_4))) = multiply(X_14,multiply(Y_5,multiply(Y_5,X_4))) ),
    inference(superposition,[status(thm),theory(equality)],[c_4,c_220]) ).

tff(c_2,plain,
    ! [X_1,Y_2,Z_3] : ( multiply(multiply(X_1,Y_2),Z_3) = multiply(X_1,multiply(Y_2,Z_3)) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_79,plain,
    ! [X_8,Y_9,X_4] : ( multiply(X_8,multiply(Y_9,multiply(multiply(X_8,Y_9),X_4))) = multiply(X_4,multiply(multiply(X_8,Y_9),multiply(X_8,Y_9))) ),
    inference(superposition,[status(thm),theory(equality)],[c_4,c_38]) ).

tff(c_89,plain,
    ! [X_8,Y_9,X_4] : ( multiply(X_8,multiply(Y_9,multiply(X_8,multiply(Y_9,X_4)))) = multiply(X_4,multiply(X_8,multiply(Y_9,multiply(X_8,Y_9)))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_79]) ).

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

tff(c_5068,plain,
    multiply(a,multiply(b,multiply(a,multiply(a,multiply(b,multiply(a,multiply(b,b))))))) != multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))),
    inference(demodulation,[status(thm),theory(equality)],[c_89,c_6]) ).

tff(c_5071,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_59,c_420,c_5068]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP195-1 : TPTP v9.0.0. Released v2.2.0.
% 0.07/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 : n019.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:35:17 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 8.45/3.24  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.45/3.24  
% 8.45/3.24  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------