↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRP034-4 : TPTP v9.0.0. Released v1.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 : n013.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:24:50 PM UTC 2025

% Result   : Unsatisfiable 3.20s 2.29s
% Output   : CNFRefutation 3.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   24 (  14   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   14 (  14   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ product > subgroup_member > multiply > #nlpp > inverse > identity > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(a,type,
    a: $i ).

tff(product,type,
    product: ( $i * $i * $i ) > $o ).

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

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

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

tff(subgroup_member,type,
    subgroup_member: $i > $o ).

tff(f_65,axiom,
    subgroup_member(a),
    file(unknown,unknown) ).

tff(f_31,axiom,
    ! [X] : product(X,inverse(X),identity),
    file(unknown,unknown) ).

tff(f_64,axiom,
    ! [A,B,C] :
      ( ~ subgroup_member(A)
      | ~ subgroup_member(B)
      | ~ product(B,inverse(A),C)
      | subgroup_member(C) ),
    file(unknown,unknown) ).

tff(f_27,axiom,
    ! [X] : product(identity,X,X),
    file(unknown,unknown) ).

tff(f_67,axiom,
    ~ subgroup_member(inverse(a)),
    file(unknown,unknown) ).

tff(c_16,plain,
    subgroup_member(a),
    inference(cnfTransformation,[status(thm)],[f_65]) ).

tff(c_8,plain,
    ! [X_5] : product(X_5,inverse(X_5),identity),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_23,plain,
    ! [C_26,B_27,A_28] :
      ( subgroup_member(C_26)
      | ~ product(B_27,inverse(A_28),C_26)
      | ~ subgroup_member(B_27)
      | ~ subgroup_member(A_28) ),
    inference(cnfTransformation,[status(thm)],[f_64]) ).

tff(c_36,plain,
    ! [X_5] :
      ( subgroup_member(identity)
      | ~ subgroup_member(X_5) ),
    inference(resolution,[status(thm)],[c_8,c_23]) ).

tff(c_38,plain,
    ! [X_5] : ~ subgroup_member(X_5),
    inference(splitLeft,[status(thm)],[c_36]) ).

tff(c_41,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_38,c_16]) ).

tff(c_42,plain,
    subgroup_member(identity),
    inference(splitRight,[status(thm)],[c_36]) ).

tff(c_4,plain,
    ! [X_3] : product(identity,X_3,X_3),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_37,plain,
    ! [A_28] :
      ( subgroup_member(inverse(A_28))
      | ~ subgroup_member(identity)
      | ~ subgroup_member(A_28) ),
    inference(resolution,[status(thm)],[c_4,c_23]) ).

tff(c_58,plain,
    ! [A_35] :
      ( subgroup_member(inverse(A_35))
      | ~ subgroup_member(A_35) ),
    inference(demodulation,[status(thm),theory(equality)],[c_42,c_37]) ).

tff(c_18,plain,
    ~ subgroup_member(inverse(a)),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_61,plain,
    ~ subgroup_member(a),
    inference(resolution,[status(thm)],[c_58,c_18]) ).

tff(c_65,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_61]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.10  % Problem  : GRP034-4 : TPTP v9.0.0. Released v1.0.0.
% 0.04/0.11  % 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.09/0.31  % Computer : n013.cluster.edu
% 0.09/0.31  % Model    : x86_64 x86_64
% 0.09/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31  % Memory   : 8042.1875MB
% 0.09/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31  % CPULimit : 300
% 0.09/0.31  % WCLimit  : 300
% 0.09/0.31  % DateTime : Mon Apr  7 21:12:47 EDT 2025
% 0.09/0.32  % CPUTime  : 
% 3.20/2.29  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.32/2.30  
% 3.32/2.30  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------