↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP176-2 : TPTP v9.0.0. Bugfixed v1.2.1.
% 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:25:27 PM UTC 2025

% Result   : Unsatisfiable 2.68s 1.55s
% Output   : CNFRefutation 2.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    8 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :    8 (   7 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    :    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    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   12 (  12   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > d > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

tff(f_119,axiom,
    multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
    file(unknown,unknown) ).

tff(c_28,plain,
    ! [Y_28,X_30,Z_29] : ( least_upper_bound(multiply(Y_28,X_30),multiply(Z_29,X_30)) = multiply(least_upper_bound(Y_28,Z_29),X_30) ),
    inference(cnfTransformation,[status(thm)],[f_111]) ).

tff(c_24,plain,
    ! [X_22,Y_23,Z_24] : ( least_upper_bound(multiply(X_22,Y_23),multiply(X_22,Z_24)) = multiply(X_22,least_upper_bound(Y_23,Z_24)) ),
    inference(cnfTransformation,[status(thm)],[f_107]) ).

tff(c_34,plain,
    least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))) != multiply(c,multiply(least_upper_bound(a,b),d)),
    inference(cnfTransformation,[status(thm)],[f_119]) ).

tff(c_35,plain,
    multiply(c,least_upper_bound(multiply(a,d),multiply(b,d))) != multiply(c,multiply(least_upper_bound(a,b),d)),
    inference(demodulation,[status(thm),theory(equality)],[c_24,c_34]) ).

tff(c_37,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_28,c_35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GRP176-2 : TPTP v9.0.0. Bugfixed v1.2.1.
% 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.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Mon Apr  7 21:31:19 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.68/1.55  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.68/1.55  
% 2.68/1.55  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------