↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP522-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/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 : n027.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 3.57s 2.02s
% Output   : CNFRefutation 3.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   27 (  27 unt;   0 typ;   0 def)
%            Number of atoms       :   27 (  26 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    6 (   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   :   54 (  54   !;   0   ?;   0   :)

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

%Foreground sorts:

%Background operators:

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

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_28,axiom,
    ! [A,B] : ( inverse(A) = divide(divide(B,B),A) ),
    file(unknown,unknown) ).

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

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

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

tff(c_6,plain,
    ! [B_8,A_7] : ( divide(divide(B_8,B_8),A_7) = inverse(A_7) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

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

tff(c_9,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_106,plain,
    ! [A_17,B_18,C_19] : ( divide(A_17,divide(B_18,divide(C_19,divide(A_17,B_18)))) = C_19 ),
    inference(cnfTransformation,[status(thm)],[f_24]) ).

tff(c_123,plain,
    ! [B_18,C_19,B_8] : ( inverse(divide(B_18,divide(C_19,divide(divide(B_8,B_8),B_18)))) = C_19 ),
    inference(superposition,[status(thm),theory(equality)],[c_106,c_6]) ).

tff(c_168,plain,
    ! [B_18,C_19] : ( inverse(divide(B_18,multiply(C_19,B_18))) = C_19 ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_123]) ).

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

tff(c_711,plain,
    ! [B_33,C_34,A_35] : ( divide(B_33,divide(divide(C_34,divide(A_35,B_33)),C_34)) = A_35 ),
    inference(superposition,[status(thm),theory(equality)],[c_106,c_2]) ).

tff(c_911,plain,
    ! [B_38,A_39] : ( divide(B_38,inverse(divide(A_39,B_38))) = A_39 ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_711]) ).

tff(c_1006,plain,
    ! [C_40,B_41] : ( divide(multiply(C_40,B_41),C_40) = B_41 ),
    inference(superposition,[status(thm),theory(equality)],[c_168,c_911]) ).

tff(c_27,plain,
    ! [A_11,B_12] : ( divide(A_11,inverse(B_12)) = multiply(A_11,B_12) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).

tff(c_34,plain,
    ! [B_12,A_7] : ( divide(multiply(inverse(B_12),B_12),A_7) = inverse(A_7) ),
    inference(superposition,[status(thm),theory(equality)],[c_27,c_6]) ).

tff(c_1026,plain,
    ! [B_41] : ( inverse(inverse(B_41)) = B_41 ),
    inference(superposition,[status(thm),theory(equality)],[c_1006,c_34]) ).

tff(c_45,plain,
    ! [B_8,B_12] : ( multiply(divide(B_8,B_8),B_12) = inverse(inverse(B_12)) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_27]) ).

tff(c_157,plain,
    ! [B_8,A_17,B_18] : ( divide(B_8,B_8) = divide(A_17,divide(B_18,inverse(divide(A_17,B_18)))) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_106]) ).

tff(c_267,plain,
    ! [B_24,A_25,B_26] : ( divide(B_24,B_24) = divide(A_25,multiply(B_26,divide(A_25,B_26))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_157]) ).

tff(c_175,plain,
    ! [B_8,A_17,B_18] : ( divide(B_8,B_8) = divide(A_17,multiply(B_18,divide(A_17,B_18))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_157]) ).

tff(c_385,plain,
    ! [B_28,B_27] : ( divide(B_28,B_28) = divide(B_27,B_27) ),
    inference(superposition,[status(thm),theory(equality)],[c_267,c_175]) ).

tff(c_512,plain,
    ! [B_29,B_30] : ( multiply(inverse(B_29),B_29) = divide(B_30,B_30) ),
    inference(superposition,[status(thm),theory(equality)],[c_385,c_9]) ).

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

tff(c_561,plain,
    ! [B_30] : ( multiply(divide(B_30,B_30),a2) != a2 ),
    inference(superposition,[status(thm),theory(equality)],[c_512,c_8]) ).

tff(c_593,plain,
    inverse(inverse(a2)) != a2,
    inference(demodulation,[status(thm),theory(equality)],[c_45,c_561]) ).

tff(c_1066,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1026,c_593]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.15  % Problem  : GRP522-1 : TPTP v9.0.0. Released v2.6.0.
% 0.14/0.16  % 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.17/0.37  % Computer : n027.cluster.edu
% 0.17/0.37  % Model    : x86_64 x86_64
% 0.17/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37  % Memory   : 8042.1875MB
% 0.17/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37  % CPULimit : 300
% 0.17/0.37  % WCLimit  : 300
% 0.17/0.37  % DateTime : Mon Apr  7 21:54:21 EDT 2025
% 0.17/0.37  % CPUTime  : 
% 3.57/2.02  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.57/2.03  
% 3.57/2.03  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------