↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP680-1 : TPTP v9.0.0. Released v4.0.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 : n005.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:57 PM UTC 2025

% Result   : Unsatisfiable 4.84s 2.25s
% Output   : CNFRefutation 4.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (  19 unt;   0 typ;   0 def)
%            Number of atoms       :   19 (  18 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    :    5 (   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    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   25 (  25   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > i > unit > op_c > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(ld,type,
    ld: ( $i * $i ) > $i ).

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

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

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

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

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

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

tff(f_26,axiom,
    ! [A,B] : ( mult(A,ld(A,B)) = B ),
    file(unknown,unknown) ).

tff(f_40,axiom,
    ! [A,B] : ( mult(i(A),mult(A,B)) = B ),
    file(unknown,unknown) ).

tff(f_34,axiom,
    ! [A] : ( mult(A,unit) = A ),
    file(unknown,unknown) ).

tff(f_42,axiom,
    ! [A] : ( mult(op_c,A) = mult(A,op_c) ),
    file(unknown,unknown) ).

tff(f_38,axiom,
    ! [A,B,C] : ( mult(A,mult(B,mult(A,C))) = mult(mult(A,mult(B,A)),C) ),
    file(unknown,unknown) ).

tff(f_44,axiom,
    mult(i(op_c),a) != mult(a,i(op_c)),
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [A_1,B_2] : ( mult(A_1,ld(A_1,B_2)) = B_2 ),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_324,plain,
    ! [A_35,B_36] : ( mult(i(A_35),mult(A_35,B_36)) = B_36 ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_354,plain,
    ! [A_1,B_2] : ( mult(i(A_1),B_2) = ld(A_1,B_2) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_324]) ).

tff(c_10,plain,
    ! [A_9] : ( mult(A_9,unit) = A_9 ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_360,plain,
    ! [A_9] : ( mult(i(A_9),A_9) = unit ),
    inference(superposition,[status(thm),theory(equality)],[c_10,c_324]) ).

tff(c_18,plain,
    ! [A_16] : ( mult(op_c,A_16) = mult(A_16,op_c) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_486,plain,
    ! [A_40,B_41,C_42] : ( mult(mult(A_40,mult(B_41,A_40)),C_42) = mult(A_40,mult(B_41,mult(A_40,C_42))) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_3432,plain,
    ! [A_92,B_93] : ( mult(op_c,mult(A_92,mult(B_93,A_92))) = mult(A_92,mult(B_93,mult(A_92,op_c))) ),
    inference(superposition,[status(thm),theory(equality)],[c_18,c_486]) ).

tff(c_3609,plain,
    ! [B_93] : ( mult(op_c,mult(i(op_c),mult(B_93,i(op_c)))) = mult(i(op_c),mult(B_93,unit)) ),
    inference(superposition,[status(thm),theory(equality)],[c_360,c_3432]) ).

tff(c_3685,plain,
    ! [B_93] : ( mult(B_93,i(op_c)) = ld(op_c,B_93) ),
    inference(demodulation,[status(thm),theory(equality)],[c_354,c_2,c_354,c_10,c_3609]) ).

tff(c_20,plain,
    mult(i(op_c),a) != mult(a,i(op_c)),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_1587,plain,
    mult(a,i(op_c)) != ld(op_c,a),
    inference(demodulation,[status(thm),theory(equality)],[c_354,c_20]) ).

tff(c_3696,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_3685,c_1587]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP680-1 : TPTP v9.0.0. Released v4.0.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 : n005.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 22:25:12 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 4.84/2.25  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.84/2.26  
% 4.84/2.26  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------