↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP656-10 : TPTP v9.0.0. Released v8.1.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 : n022.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:52 PM UTC 2025

% Result   : Unsatisfiable 4.42s 2.11s
% Output   : CNFRefutation 4.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   24 (  24 unt;   0 typ;   0 def)
%            Number of atoms       :   24 (  23 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    :    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    :    6 (   6 usr;   0 con; 1-2 aty)
%            Number of variables   :   50 (  50   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ tuple > rd > mult > ld > #nlpp > x1_2 > x1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

tff(f_36,axiom,
    ! [X0] : ( tuple(mult(X0,x1(X0)),mult(x1_2(X0),X0)) != tuple(x1(X0),x1_2(X0)) ),
    file(unknown,unknown) ).

tff(c_4,plain,
    ! [A_3,B_4] : ( ld(A_3,mult(A_3,B_4)) = B_4 ),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_6,plain,
    ! [A_5,B_6] : ( mult(rd(A_5,B_6),B_6) = A_5 ),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_88,plain,
    ! [A_23,B_24,C_25] : ( mult(mult(A_23,mult(B_24,C_25)),A_23) = mult(mult(A_23,B_24),mult(C_25,A_23)) ),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_8,plain,
    ! [A_7,B_8] : ( rd(mult(A_7,B_8),B_8) = A_7 ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_262,plain,
    ! [A_35,B_36,C_37] : ( rd(mult(mult(A_35,B_36),mult(C_37,A_35)),A_35) = mult(A_35,mult(B_36,C_37)) ),
    inference(superposition,[status(thm),theory(equality)],[c_88,c_8]) ).

tff(c_1204,plain,
    ! [B_66,B_67,A_68] : ( rd(mult(mult(B_66,B_67),A_68),B_66) = mult(B_66,mult(B_67,rd(A_68,B_66))) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_262]) ).

tff(c_1318,plain,
    ! [B_69,B_70] : ( mult(B_69,mult(B_70,rd(B_69,B_69))) = mult(B_69,B_70) ),
    inference(superposition,[status(thm),theory(equality)],[c_1204,c_8]) ).

tff(c_1417,plain,
    ! [B_70,B_69] : ( mult(B_70,rd(B_69,B_69)) = ld(B_69,mult(B_69,B_70)) ),
    inference(superposition,[status(thm),theory(equality)],[c_1318,c_4]) ).

tff(c_1459,plain,
    ! [B_70,B_69] : ( mult(B_70,rd(B_69,B_69)) = B_70 ),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_1417]) ).

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

tff(c_1463,plain,
    ! [B_71,B_72] : ( mult(B_71,rd(B_72,B_72)) = B_71 ),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_1417]) ).

tff(c_320,plain,
    ! [A_38,B_39,C_40] : ( ld(mult(A_38,mult(B_39,C_40)),mult(mult(A_38,B_39),mult(C_40,A_38))) = A_38 ),
    inference(superposition,[status(thm),theory(equality)],[c_88,c_4]) ).

tff(c_384,plain,
    ! [A_1,B_2,C_40] : ( ld(mult(A_1,mult(ld(A_1,B_2),C_40)),mult(B_2,mult(C_40,A_1))) = A_1 ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_320]) ).

tff(c_1480,plain,
    ! [A_1,B_2,B_72] : ( ld(mult(A_1,ld(A_1,B_2)),mult(B_2,mult(rd(B_72,B_72),A_1))) = A_1 ),
    inference(superposition,[status(thm),theory(equality)],[c_1463,c_384]) ).

tff(c_1613,plain,
    ! [B_73,A_74] : ( mult(rd(B_73,B_73),A_74) = A_74 ),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_2,c_1480]) ).

tff(c_12,plain,
    ! [X0_12] : ( tuple(mult(X0_12,x1(X0_12)),mult(x1_2(X0_12),X0_12)) != tuple(x1(X0_12),x1_2(X0_12)) ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_1720,plain,
    ! [B_73] : ( tuple(x1(rd(B_73,B_73)),mult(x1_2(rd(B_73,B_73)),rd(B_73,B_73))) != tuple(x1(rd(B_73,B_73)),x1_2(rd(B_73,B_73))) ),
    inference(superposition,[status(thm),theory(equality)],[c_1613,c_12]) ).

tff(c_1793,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1459,c_1720]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP656-10 : TPTP v9.0.0. Released v8.1.0.
% 0.03/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.14/0.34  % Computer : n022.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Mon Apr  7 22:20:05 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 4.42/2.11  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.56/2.12  
% 4.56/2.12  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------