↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : PRO010+3 : 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/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 : n029.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 08:24:11 PM UTC 2025

% Result   : Theorem 5.73s 2.27s
% Output   : CNFRefutation 5.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   31 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   71 (   6 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   66 (  26   ~;  21   |;  11   &)
%                                         (   1 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 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  :   19 (  17 usr;   1 prp; 0-3 aty)
%            Number of functors    :   27 (  27 usr;   6 con; 0-4 aty)
%            Number of variables   :   42 (  35   !;   7   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ next_subocc > min_precedes > subactivity_occurrence > subactivity > root_occ > root > precedes > occurrence_of > leaf_occ > leaf > earlier > atocc > legal > atomic > arboreal > activity_occurrence > activity > #nlpp > tptp4 > tptp3 > tptp2 > tptp1 > tptp0 > #skF_11 > #skF_22 > #skF_6 > #skF_20 > #skF_18 > #skF_13 > #skF_19 > #skF_1 > #skF_14 > #skF_12 > #skF_5 > #skF_2 > #skF_17 > #skF_3 > #skF_8 > #skF_7 > #skF_16 > #skF_21 > #skF_9 > #skF_15 > #skF_4 > #skF_10

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_11',type,
    '#skF_11': ( $i * $i ) > $i ).

tff('#skF_22',type,
    '#skF_22': ( $i * $i ) > $i ).

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

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

tff('#skF_6',type,
    '#skF_6': ( $i * $i ) > $i ).

tff('#skF_20',type,
    '#skF_20': $i ).

tff('#skF_18',type,
    '#skF_18': $i > $i ).

tff('#skF_13',type,
    '#skF_13': ( $i * $i * $i * $i ) > $i ).

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

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

tff('#skF_19',type,
    '#skF_19': $i > $i ).

tff('#skF_1',type,
    '#skF_1': $i > $i ).

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

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

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

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

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

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

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

tff('#skF_14',type,
    '#skF_14': ( $i * $i ) > $i ).

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

tff('#skF_12',type,
    '#skF_12': ( $i * $i ) > $i ).

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

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

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

tff('#skF_5',type,
    '#skF_5': ( $i * $i * $i ) > $i ).

tff('#skF_2',type,
    '#skF_2': ( $i * $i * $i ) > $i ).

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

tff('#skF_17',type,
    '#skF_17': $i > $i ).

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

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

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

tff('#skF_3',type,
    '#skF_3': ( $i * $i * $i ) > $i ).

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

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

tff('#skF_8',type,
    '#skF_8': ( $i * $i * $i ) > $i ).

tff('#skF_7',type,
    '#skF_7': ( $i * $i ) > $i ).

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

tff('#skF_16',type,
    '#skF_16': ( $i * $i ) > $i ).

tff('#skF_21',type,
    '#skF_21': ( $i * $i ) > $i ).

tff('#skF_9',type,
    '#skF_9': ( $i * $i ) > $i ).

tff('#skF_15',type,
    '#skF_15': ( $i * $i ) > $i ).

tff('#skF_4',type,
    '#skF_4': ( $i * $i ) > $i ).

tff('#skF_10',type,
    '#skF_10': ( $i * $i * $i ) > $i ).

tff(f_494,negated_conjecture,
    ~ ! [X165] :
        ( occurrence_of(X165,tptp0)
       => ? [X166,X167] :
            ( leaf_occ(X167,X165)
            & ( occurrence_of(X167,tptp1)
             => ~ ? [X168] :
                    ( occurrence_of(X168,tptp2)
                    & min_precedes(X166,X168,tptp0) ) )
            & ( occurrence_of(X167,tptp2)
             => ~ ? [X169] :
                    ( occurrence_of(X169,tptp1)
                    & min_precedes(X166,X169,tptp0) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

tff(f_453,axiom,
    ! [X161] :
      ( occurrence_of(X161,tptp0)
     => ? [X162,X163,X164] :
          ( occurrence_of(X162,tptp3)
          & root_occ(X162,X161)
          & occurrence_of(X163,tptp4)
          & next_subocc(X162,X163,tptp0)
          & ( occurrence_of(X164,tptp1)
            | occurrence_of(X164,tptp2) )
          & next_subocc(X163,X164,tptp0)
          & leaf_occ(X164,X161) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_49) ).

tff(f_472,axiom,
    tptp1 != tptp2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_61) ).

tff(f_404,axiom,
    ! [X148,X149,X150] :
      ( min_precedes(X148,X149,X150)
     => arboreal(X148) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_46) ).

tff(f_43,axiom,
    ! [X4,X5,X6] :
      ( ( occurrence_of(X4,X5)
        & occurrence_of(X4,X6) )
     => ( X5 = X6 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).

tff(f_456,axiom,
    ~ atomic(tptp0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_51) ).

tff(f_74,axiom,
    ! [X16,X17] :
      ( occurrence_of(X16,X17)
     => ( arboreal(X16)
      <=> atomic(X17) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).

tff(c_204,plain,
    occurrence_of('#skF_20',tptp0),
    inference(cnfTransformation,[status(thm)],[f_494]) ).

tff(c_166,plain,
    ! [X161_176] :
      ( leaf_occ('#skF_19'(X161_176),X161_176)
      | ~ occurrence_of(X161_176,tptp0) ),
    inference(cnfTransformation,[status(thm)],[f_453]) ).

tff(c_202,plain,
    tptp2 != tptp1,
    inference(cnfTransformation,[status(thm)],[f_472]) ).

tff(c_414,plain,
    ! [X166_263,X167_264] :
      ( min_precedes(X166_263,'#skF_21'(X166_263,X167_264),tptp0)
      | occurrence_of(X167_264,tptp2)
      | ~ leaf_occ(X167_264,'#skF_20') ),
    inference(cnfTransformation,[status(thm)],[f_494]) ).

tff(c_160,plain,
    ! [X148_163,X149_164,X150_165] :
      ( arboreal(X148_163)
      | ~ min_precedes(X148_163,X149_164,X150_165) ),
    inference(cnfTransformation,[status(thm)],[f_404]) ).

tff(c_434,plain,
    ! [X166_263,X167_264] :
      ( arboreal(X166_263)
      | occurrence_of(X167_264,tptp2)
      | ~ leaf_occ(X167_264,'#skF_20') ),
    inference(resolution,[status(thm)],[c_414,c_160]) ).

tff(c_869,plain,
    ! [X167_264] :
      ( occurrence_of(X167_264,tptp2)
      | ~ leaf_occ(X167_264,'#skF_20') ),
    inference(splitLeft,[status(thm)],[c_434]) ).

tff(c_332,plain,
    ! [X167_253,X166_254] :
      ( occurrence_of(X167_253,tptp1)
      | min_precedes(X166_254,'#skF_22'(X166_254,X167_253),tptp0)
      | ~ leaf_occ(X167_253,'#skF_20') ),
    inference(cnfTransformation,[status(thm)],[f_494]) ).

tff(c_352,plain,
    ! [X166_254,X167_253] :
      ( arboreal(X166_254)
      | occurrence_of(X167_253,tptp1)
      | ~ leaf_occ(X167_253,'#skF_20') ),
    inference(resolution,[status(thm)],[c_332,c_160]) ).

tff(c_818,plain,
    ! [X167_325] :
      ( occurrence_of(X167_325,tptp1)
      | ~ leaf_occ(X167_325,'#skF_20') ),
    inference(splitLeft,[status(thm)],[c_352]) ).

tff(c_10,plain,
    ! [X6_7,X5_6,X4_5] :
      ( ( X6_7 = X5_6 )
      | ~ occurrence_of(X4_5,X6_7)
      | ~ occurrence_of(X4_5,X5_6) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_950,plain,
    ! [X5_334,X167_335] :
      ( ( tptp1 = X5_334 )
      | ~ occurrence_of(X167_335,X5_334)
      | ~ leaf_occ(X167_335,'#skF_20') ),
    inference(resolution,[status(thm)],[c_818,c_10]) ).

tff(c_953,plain,
    ! [X167_264] :
      ( ( tptp2 = tptp1 )
      | ~ leaf_occ(X167_264,'#skF_20') ),
    inference(resolution,[status(thm)],[c_869,c_950]) ).

tff(c_999,plain,
    ! [X167_336] : ~ leaf_occ(X167_336,'#skF_20'),
    inference(negUnitSimplification,[status(thm)],[c_202,c_953]) ).

tff(c_1003,plain,
    ~ occurrence_of('#skF_20',tptp0),
    inference(resolution,[status(thm)],[c_166,c_999]) ).

tff(c_1007,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_204,c_1003]) ).

tff(c_1008,plain,
    ! [X166_263] : arboreal(X166_263),
    inference(splitRight,[status(thm)],[c_434]) ).

tff(c_182,plain,
    ~ atomic(tptp0),
    inference(cnfTransformation,[status(thm)],[f_456]) ).

tff(c_378,plain,
    ! [X17_261,X16_262] :
      ( atomic(X17_261)
      | ~ arboreal(X16_262)
      | ~ occurrence_of(X16_262,X17_261) ),
    inference(cnfTransformation,[status(thm)],[f_74]) ).

tff(c_399,plain,
    ( atomic(tptp0)
    | ~ arboreal('#skF_20') ),
    inference(resolution,[status(thm)],[c_204,c_378]) ).

tff(c_413,plain,
    ~ arboreal('#skF_20'),
    inference(negUnitSimplification,[status(thm)],[c_182,c_399]) ).

tff(c_1025,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1008,c_413]) ).

tff(c_1026,plain,
    ! [X166_254] : arboreal(X166_254),
    inference(splitRight,[status(thm)],[c_352]) ).

tff(c_1041,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1026,c_413]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : PRO010+3 : TPTP v9.0.0. Released v4.0.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.14/0.33  % Computer : n029.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 300
% 0.14/0.33  % DateTime : Tue Apr  8 16:59:19 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 5.73/2.27  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.73/2.28  
% 5.73/2.28  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------