↑ Up

Beagle---0.9.52.UNS-CRf.s

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

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

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

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_31,axiom,
    multiply(identity,a2) != a2,
    file(unknown,unknown) ).

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

tff(c_4,plain,
    ! [A_4,B_5] : ( divide(A_4,divide(identity,B_5)) = multiply(A_4,B_5) ),
    inference(cnfTransformation,[status(thm)],[f_25]) ).

tff(c_42,plain,
    ! [A_10,B_11] : ( divide(A_10,inverse(B_11)) = multiply(A_10,B_11) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).

tff(c_63,plain,
    ! [B_11] : ( inverse(inverse(B_11)) = multiply(identity,B_11) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_42]) ).

tff(c_20,plain,
    ! [A_9] : ( divide(identity,A_9) = inverse(A_9) ),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

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

tff(c_27,plain,
    inverse(identity) = identity,
    inference(superposition,[status(thm),theory(equality)],[c_20,c_8]) ).

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

tff(c_183,plain,
    ! [A_17,B_18,C_19] : ( divide(inverse(divide(A_17,divide(B_18,divide(inverse(A_17),C_19)))),C_19) = B_18 ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_6,c_8,c_2]) ).

tff(c_498,plain,
    ! [A_27,B_28] : ( divide(inverse(divide(A_27,divide(B_28,identity))),inverse(A_27)) = B_28 ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_183]) ).

tff(c_558,plain,
    ! [B_28] : ( divide(inverse(identity),inverse(divide(B_28,identity))) = B_28 ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_498]) ).

tff(c_567,plain,
    ! [B_28] : ( multiply(identity,divide(B_28,identity)) = B_28 ),
    inference(demodulation,[status(thm),theory(equality)],[c_63,c_6,c_27,c_558]) ).

tff(c_59,plain,
    ! [A_10] : ( multiply(A_10,identity) = divide(A_10,identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_27,c_42]) ).

tff(c_11,plain,
    ! [A_4,B_5] : ( divide(A_4,inverse(B_5)) = multiply(A_4,B_5) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).

tff(c_229,plain,
    ! [B_18,C_19] : ( divide(inverse(inverse(divide(B_18,divide(inverse(identity),C_19)))),C_19) = B_18 ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_183]) ).

tff(c_244,plain,
    ! [B_18,C_19] : ( divide(multiply(identity,multiply(B_18,C_19)),C_19) = B_18 ),
    inference(demodulation,[status(thm),theory(equality)],[c_63,c_11,c_6,c_27,c_229]) ).

tff(c_569,plain,
    ! [B_29] : ( multiply(identity,divide(B_29,identity)) = B_29 ),
    inference(demodulation,[status(thm),theory(equality)],[c_63,c_6,c_27,c_558]) ).

tff(c_585,plain,
    ! [B_18] : ( multiply(identity,multiply(B_18,identity)) = multiply(identity,B_18) ),
    inference(superposition,[status(thm),theory(equality)],[c_244,c_569]) ).

tff(c_601,plain,
    ! [B_18] : ( multiply(identity,B_18) = B_18 ),
    inference(demodulation,[status(thm),theory(equality)],[c_567,c_59,c_585]) ).

tff(c_10,plain,
    multiply(identity,a2) != a2,
    inference(cnfTransformation,[status(thm)],[f_31]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP455-1 : TPTP v9.0.0. Released v2.6.0.
% 0.03/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.12/0.32  % Computer : n012.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Mon Apr  7 21:50:45 EDT 2025
% 0.12/0.32  % CPUTime  : 
% 2.85/1.75  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.85/1.75  
% 2.85/1.75  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------