↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : COM009-2 : TPTP v9.0.0. Released v3.2.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 : n006.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 05:50:34 PM UTC 2025

% Result   : Unsatisfiable 2.50s 1.61s
% Output   : CNFRefutation 2.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (   9 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   14 (   8   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 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 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    8 (   8   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ c_UNITY_Oall__total > c_UNITY_Ototalize > #nlpp > v_F > t_a

%Foreground sorts:

%Background operators:

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

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

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

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

tff(f_30,axiom,
    ( ( c_UNITY_Ototalize(v_F,t_a) != v_F )
    | ~ c_UNITY_Oall__total(v_F,t_a) ),
    file(unknown,unknown) ).

tff(f_33,axiom,
    ( c_UNITY_Oall__total(v_F,t_a)
    | ( c_UNITY_Ototalize(v_F,t_a) = v_F ) ),
    file(unknown,unknown) ).

tff(f_38,axiom,
    ! [V_F,T_a] :
      ( ~ c_UNITY_Oall__total(V_F,T_a)
      | ( c_UNITY_Ototalize(V_F,T_a) = V_F ) ),
    file(unknown,unknown) ).

tff(f_40,axiom,
    ! [V_F,T_a] : c_UNITY_Oall__total(c_UNITY_Ototalize(V_F,T_a),T_a),
    file(unknown,unknown) ).

tff(c_2,plain,
    ( ~ c_UNITY_Oall__total(v_F,t_a)
    | ( c_UNITY_Ototalize(v_F,t_a) != v_F ) ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_10,plain,
    c_UNITY_Ototalize(v_F,t_a) != v_F,
    inference(splitLeft,[status(thm)],[c_2]) ).

tff(c_4,plain,
    ( ( c_UNITY_Ototalize(v_F,t_a) = v_F )
    | c_UNITY_Oall__total(v_F,t_a) ),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_11,plain,
    c_UNITY_Oall__total(v_F,t_a),
    inference(negUnitSimplification,[status(thm)],[c_10,c_4]) ).

tff(c_12,plain,
    ! [V_F_7,T_a_8] :
      ( ( c_UNITY_Ototalize(V_F_7,T_a_8) = V_F_7 )
      | ~ c_UNITY_Oall__total(V_F_7,T_a_8) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_15,plain,
    c_UNITY_Ototalize(v_F,t_a) = v_F,
    inference(resolution,[status(thm)],[c_11,c_12]) ).

tff(c_22,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_10,c_15]) ).

tff(c_23,plain,
    ~ c_UNITY_Oall__total(v_F,t_a),
    inference(splitRight,[status(thm)],[c_2]) ).

tff(c_24,plain,
    c_UNITY_Ototalize(v_F,t_a) = v_F,
    inference(splitRight,[status(thm)],[c_2]) ).

tff(c_8,plain,
    ! [V_F_3,T_a_4] : c_UNITY_Oall__total(c_UNITY_Ototalize(V_F_3,T_a_4),T_a_4),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_28,plain,
    c_UNITY_Oall__total(v_F,t_a),
    inference(superposition,[status(thm),theory(equality)],[c_24,c_8]) ).

tff(c_32,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_23,c_28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : COM009-2 : TPTP v9.0.0. Released v3.2.0.
% 0.06/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.12/0.34  % Computer : n006.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Mon Apr  7 16:11:08 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.50/1.61  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.50/1.61  
% 2.50/1.61  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------