↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GRA001-1 : 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/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 : n017.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:23:18 PM UTC 2025

% Result   : Unsatisfiable 2.45s 1.58s
% Output   : CNFRefutation 2.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   49 (  21 unt;   0 typ;   0 def)
%            Number of atoms       :   93 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   87 (  43   ~;  44   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   6 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ #nlpp > e > d > c > b > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(e,type,
    e: $o ).

tff(c,type,
    c: $o ).

tff(d,type,
    d: $o ).

tff(b,type,
    b: $o ).

tff(a,type,
    a: $o ).

tff(f_54,axiom,
    ( ~ a
    | ~ b ),
    file(unknown,unknown) ).

tff(f_49,axiom,
    ( a
    | b ),
    file(unknown,unknown) ).

tff(f_120,axiom,
    ( ~ d
    | e ),
    file(unknown,unknown) ).

tff(f_68,axiom,
    ( a
    | ~ c
    | d ),
    file(unknown,unknown) ).

tff(f_116,axiom,
    ( d
    | ~ e ),
    file(unknown,unknown) ).

tff(f_102,axiom,
    ( ~ b
    | c
    | e ),
    file(unknown,unknown) ).

tff(f_96,axiom,
    ( b
    | ~ c
    | e ),
    file(unknown,unknown) ).

tff(f_74,axiom,
    ( ~ a
    | c
    | d ),
    file(unknown,unknown) ).

tff(f_110,axiom,
    ( ~ b
    | ~ c
    | ~ e ),
    file(unknown,unknown) ).

tff(f_62,axiom,
    ( a
    | c
    | ~ d ),
    file(unknown,unknown) ).

tff(f_82,axiom,
    ( ~ a
    | ~ c
    | ~ d ),
    file(unknown,unknown) ).

tff(f_90,axiom,
    ( b
    | c
    | ~ e ),
    file(unknown,unknown) ).

tff(c_4,plain,
    ( ~ b
    | ~ a ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_53,plain,
    ~ a,
    inference(splitLeft,[status(thm)],[c_4]) ).

tff(c_2,plain,
    ( b
    | a ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_56,plain,
    b,
    inference(negUnitSimplification,[status(thm)],[c_53,c_2]) ).

tff(c_26,plain,
    ~ a,
    inference(splitLeft,[status(thm)],[c_4]) ).

tff(c_24,plain,
    ( e
    | ~ d ),
    inference(cnfTransformation,[status(thm)],[f_120]) ).

tff(c_25,plain,
    ~ d,
    inference(splitLeft,[status(thm)],[c_24]) ).

tff(c_8,plain,
    ( d
    | ~ c
    | a ),
    inference(cnfTransformation,[status(thm)],[f_68]) ).

tff(c_30,plain,
    ~ c,
    inference(negUnitSimplification,[status(thm)],[c_26,c_25,c_8]) ).

tff(c_22,plain,
    ( ~ e
    | d ),
    inference(cnfTransformation,[status(thm)],[f_116]) ).

tff(c_27,plain,
    ~ e,
    inference(negUnitSimplification,[status(thm)],[c_25,c_22]) ).

tff(c_28,plain,
    b,
    inference(negUnitSimplification,[status(thm)],[c_26,c_2]) ).

tff(c_18,plain,
    ( e
    | c
    | ~ b ),
    inference(cnfTransformation,[status(thm)],[f_102]) ).

tff(c_38,plain,
    ( e
    | c ),
    inference(demodulation,[status(thm),theory(equality)],[c_28,c_18]) ).

tff(c_39,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_30,c_27,c_38]) ).

tff(c_40,plain,
    ~ b,
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_44,plain,
    ~ e,
    inference(negUnitSimplification,[status(thm)],[c_25,c_22]) ).

tff(c_16,plain,
    ( e
    | ~ c
    | b ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_47,plain,
    ~ c,
    inference(negUnitSimplification,[status(thm)],[c_40,c_44,c_16]) ).

tff(c_41,plain,
    a,
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_10,plain,
    ( d
    | c
    | ~ a ),
    inference(cnfTransformation,[status(thm)],[f_74]) ).

tff(c_49,plain,
    ( d
    | c ),
    inference(demodulation,[status(thm),theory(equality)],[c_41,c_10]) ).

tff(c_50,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_47,c_25,c_49]) ).

tff(c_51,plain,
    e,
    inference(splitRight,[status(thm)],[c_24]) ).

tff(c_20,plain,
    ( ~ e
    | ~ c
    | ~ b ),
    inference(cnfTransformation,[status(thm)],[f_110]) ).

tff(c_58,plain,
    ~ c,
    inference(demodulation,[status(thm),theory(equality)],[c_56,c_51,c_20]) ).

tff(c_52,plain,
    d,
    inference(splitRight,[status(thm)],[c_24]) ).

tff(c_6,plain,
    ( ~ d
    | c
    | a ),
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_70,plain,
    ( c
    | a ),
    inference(demodulation,[status(thm),theory(equality)],[c_52,c_6]) ).

tff(c_71,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_53,c_58,c_70]) ).

tff(c_72,plain,
    ~ b,
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_73,plain,
    a,
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_12,plain,
    ( ~ d
    | ~ c
    | ~ a ),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_86,plain,
    ~ c,
    inference(demodulation,[status(thm),theory(equality)],[c_73,c_52,c_12]) ).

tff(c_14,plain,
    ( ~ e
    | c
    | b ),
    inference(cnfTransformation,[status(thm)],[f_90]) ).

tff(c_90,plain,
    ( c
    | b ),
    inference(demodulation,[status(thm),theory(equality)],[c_51,c_14]) ).

tff(c_91,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_72,c_86,c_90]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRA001-1 : TPTP v9.0.0. Released v1.0.0.
% 0.03/0.12  % 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.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Mon Apr  7 20:48:55 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.45/1.58  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.45/1.59  
% 2.45/1.59  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------