↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP665+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 : n007.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:55 PM UTC 2025

% Result   : Theorem 5.51s 2.85s
% Output   : CNFRefutation 5.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   34 (  30 unt;   0 typ;   0 def)
%            Number of atoms       :   41 (  38 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   23 (  16   ~;   5   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   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    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :   46 (  46   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > unit > op_c > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

tff('#skF_5',type,
    '#skF_5': $i ).

tff('#skF_6',type,
    '#skF_6': $i ).

tff('#skF_2',type,
    '#skF_2': $i ).

tff('#skF_3',type,
    '#skF_3': $i ).

tff('#skF_1',type,
    '#skF_1': $i ).

tff('#skF_4',type,
    '#skF_4': $i ).

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

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

tff(f_44,axiom,
    ! [A] : ( mult(op_c,A) = mult(A,op_c) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).

tff(f_34,axiom,
    ! [B,A] : ( rd(mult(A,B),B) = A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).

tff(f_40,axiom,
    ! [C,B,A] : ( mult(A,mult(B,C)) = mult(rd(mult(A,B),A),mult(A,C)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).

tff(f_30,axiom,
    ! [B,A] : ( ld(A,mult(A,B)) = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).

tff(f_42,axiom,
    ! [C,B,A] : ( mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).

tff(f_51,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( mult(op_c,mult(X0,X1)) = mult(mult(op_c,X0),X1) )
        & ( mult(mult(X0,op_c),X1) = mult(X0,mult(op_c,X1)) )
        & ( mult(mult(X0,X1),op_c) = mult(X0,mult(X1,op_c)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

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

tff(c_8,plain,
    ! [A_8,B_7] : ( rd(mult(A_8,B_7),B_7) = A_8 ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_1188,plain,
    ! [A_60,B_61,C_62] : ( mult(rd(mult(A_60,B_61),A_60),mult(A_60,C_62)) = mult(A_60,mult(B_61,C_62)) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_1233,plain,
    ! [A_17,C_62] : ( mult(rd(mult(A_17,op_c),op_c),mult(op_c,C_62)) = mult(op_c,mult(A_17,C_62)) ),
    inference(superposition,[status(thm),theory(equality)],[c_18,c_1188]) ).

tff(c_1272,plain,
    ! [A_17,C_62] : ( mult(op_c,mult(A_17,C_62)) = mult(A_17,mult(op_c,C_62)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_1233]) ).

tff(c_4,plain,
    ! [A_4,B_3] : ( ld(A_4,mult(A_4,B_3)) = B_3 ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_2314,plain,
    ! [A_83,C_84,B_85] : ( mult(mult(A_83,C_84),ld(C_84,mult(B_85,C_84))) = mult(mult(A_83,B_85),C_84) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_2380,plain,
    ! [A_83,A_17] : ( mult(mult(A_83,A_17),ld(A_17,mult(A_17,op_c))) = mult(mult(A_83,op_c),A_17) ),
    inference(superposition,[status(thm),theory(equality)],[c_18,c_2314]) ).

tff(c_2419,plain,
    ! [A_83,A_17] : ( mult(mult(A_83,op_c),A_17) = mult(op_c,mult(A_83,A_17)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_4,c_2380]) ).

tff(c_1658,plain,
    ! [A_71,C_72,B_73] : ( mult(mult(A_71,C_72),ld(C_72,mult(B_73,C_72))) = mult(mult(A_71,B_73),C_72) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_1718,plain,
    ! [A_71,A_17] : ( mult(mult(A_71,op_c),ld(op_c,mult(op_c,A_17))) = mult(mult(A_71,A_17),op_c) ),
    inference(superposition,[status(thm),theory(equality)],[c_18,c_1658]) ).

tff(c_1764,plain,
    ! [A_71,A_17] : ( mult(mult(A_71,op_c),A_17) = mult(op_c,mult(A_71,A_17)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_4,c_1718]) ).

tff(c_456,plain,
    ! [A_40,B_41,C_42] : ( mult(rd(mult(A_40,B_41),A_40),mult(A_40,C_42)) = mult(A_40,mult(B_41,C_42)) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_489,plain,
    ! [A_17,C_42] : ( mult(rd(mult(op_c,A_17),A_17),mult(A_17,C_42)) = mult(A_17,mult(op_c,C_42)) ),
    inference(superposition,[status(thm),theory(equality)],[c_18,c_456]) ).

tff(c_533,plain,
    ! [A_17,C_42] : ( mult(op_c,mult(A_17,C_42)) = mult(A_17,mult(op_c,C_42)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_489]) ).

tff(c_20,plain,
    ( ( mult(mult(op_c,'#skF_5'),'#skF_6') != mult(op_c,mult('#skF_5','#skF_6')) )
    | ( mult(mult('#skF_3',op_c),'#skF_4') != mult('#skF_3',mult(op_c,'#skF_4')) )
    | ( mult(mult('#skF_1','#skF_2'),op_c) != mult('#skF_1',mult('#skF_2',op_c)) ) ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_21,plain,
    ( ( mult(mult('#skF_5',op_c),'#skF_6') != mult(op_c,mult('#skF_5','#skF_6')) )
    | ( mult(mult('#skF_3',op_c),'#skF_4') != mult('#skF_3',mult('#skF_4',op_c)) )
    | ( mult(op_c,mult('#skF_1','#skF_2')) != mult('#skF_1',mult('#skF_2',op_c)) ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_18,c_18,c_20]) ).

tff(c_170,plain,
    mult(op_c,mult('#skF_1','#skF_2')) != mult('#skF_1',mult('#skF_2',op_c)),
    inference(splitLeft,[status(thm)],[c_21]) ).

tff(c_922,plain,
    mult('#skF_1',mult(op_c,'#skF_2')) != mult('#skF_1',mult('#skF_2',op_c)),
    inference(demodulation,[status(thm),theory(equality)],[c_533,c_170]) ).

tff(c_925,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_922]) ).

tff(c_926,plain,
    ( ( mult(mult('#skF_3',op_c),'#skF_4') != mult('#skF_3',mult('#skF_4',op_c)) )
    | ( mult(mult('#skF_5',op_c),'#skF_6') != mult(op_c,mult('#skF_5','#skF_6')) ) ),
    inference(splitRight,[status(thm)],[c_21]) ).

tff(c_1435,plain,
    mult(mult('#skF_5',op_c),'#skF_6') != mult(op_c,mult('#skF_5','#skF_6')),
    inference(splitLeft,[status(thm)],[c_926]) ).

tff(c_1772,plain,
    mult(mult('#skF_5',op_c),'#skF_6') != mult('#skF_5',mult(op_c,'#skF_6')),
    inference(demodulation,[status(thm),theory(equality)],[c_1272,c_1435]) ).

tff(c_1773,plain,
    mult(mult('#skF_5',op_c),'#skF_6') != mult('#skF_5',mult('#skF_6',op_c)),
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_1772]) ).

tff(c_2160,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_1272,c_1764,c_1773]) ).

tff(c_2161,plain,
    mult(mult('#skF_3',op_c),'#skF_4') != mult('#skF_3',mult('#skF_4',op_c)),
    inference(splitRight,[status(thm)],[c_926]) ).

tff(c_2682,plain,
    mult(op_c,mult('#skF_3','#skF_4')) != mult('#skF_3',mult('#skF_4',op_c)),
    inference(demodulation,[status(thm),theory(equality)],[c_2419,c_2161]) ).

tff(c_2685,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_1272,c_2682]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP665+1 : TPTP v9.0.0. Released v4.0.0.
% 0.11/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 : n007.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 22:22:23 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 5.51/2.85  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.51/2.86  
% 5.51/2.86  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------