↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP679-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 : n020.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 5.36s 2.43s
% Output   : CNFRefutation 5.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% 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 :    4 (   4   ~;   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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (  24   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > 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(op_c,type,
    op_c: $i ).

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

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

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_32,axiom,
    ! [A,B] : ( rd(mult(A,B),B) = A ),
    file(unknown,unknown) ).

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

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

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

tff(c_520,plain,
    ! [A_37,B_38,C_39] : ( mult(mult(A_37,mult(B_38,A_37)),C_39) = mult(A_37,mult(B_38,mult(A_37,C_39))) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

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

tff(c_4792,plain,
    ! [A_89,B_90,C_91] : ( rd(mult(A_89,mult(B_90,mult(A_89,C_91))),C_91) = mult(A_89,mult(B_90,A_89)) ),
    inference(superposition,[status(thm),theory(equality)],[c_520,c_8]) ).

tff(c_225,plain,
    ! [A_29] : ( mult(op_c,A_29) = mult(A_29,op_c) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_244,plain,
    ! [A_29] : ( rd(mult(op_c,A_29),op_c) = A_29 ),
    inference(superposition,[status(thm),theory(equality)],[c_225,c_8]) ).

tff(c_4803,plain,
    ! [B_90] : ( mult(op_c,mult(B_90,op_c)) = mult(B_90,mult(op_c,op_c)) ),
    inference(superposition,[status(thm),theory(equality)],[c_4792,c_244]) ).

tff(c_16,plain,
    ! [A_14] : ( mult(op_c,A_14) = mult(A_14,op_c) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_12,plain,
    ! [A_10] : ( mult(unit,A_10) = A_10 ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_599,plain,
    ! [A_10,C_39] : ( mult(A_10,mult(unit,mult(A_10,C_39))) = mult(mult(A_10,A_10),C_39) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_520]) ).

tff(c_613,plain,
    ! [A_10,C_39] : ( mult(mult(A_10,A_10),C_39) = mult(A_10,mult(A_10,C_39)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_599]) ).

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

tff(c_714,plain,
    mult(op_c,mult(op_c,a)) != mult(a,mult(op_c,op_c)),
    inference(demodulation,[status(thm),theory(equality)],[c_613,c_18]) ).

tff(c_715,plain,
    mult(op_c,mult(a,op_c)) != mult(a,mult(op_c,op_c)),
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_714]) ).

tff(c_4989,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_4803,c_715]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP679-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 : n020.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:34 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 5.36/2.43  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.75/2.44  
% 5.75/2.44  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------