TSTP Solution File: PRO014+2 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : PRO014+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n016.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 : Thu Aug 31 13:06:08 EDT 2023

% Result   : Theorem 0.52s 0.60s
% Output   : CNFRefutation 0.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   45
% Syntax   : Number of formulae    :   85 (  13 unt;  41 typ;   0 def)
%            Number of atoms       :  214 (   0 equ)
%            Maximal formula atoms :   36 (   4 avg)
%            Number of connectives :  272 ( 102   ~; 115   |;  49   &)
%                                         (   1 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   65 (  34   >;  31   *;   0   +;   0  <<)
%            Number of predicates  :   18 (  17 usr;   1 prp; 0-3 aty)
%            Number of functors    :   24 (  24 usr;   7 con; 0-3 aty)
%            Number of variables   :   74 (   0 sgn;  30   !;  11   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    min_precedes: ( $i * $i * $i ) > $o ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(decl_44,type,
    esk1_3: ( $i * $i * $i ) > $i ).

tff(decl_45,type,
    esk2_2: ( $i * $i ) > $i ).

tff(decl_46,type,
    esk3_2: ( $i * $i ) > $i ).

tff(decl_47,type,
    esk4_2: ( $i * $i ) > $i ).

tff(decl_48,type,
    esk5_2: ( $i * $i ) > $i ).

tff(decl_49,type,
    esk6_2: ( $i * $i ) > $i ).

tff(decl_50,type,
    esk7_1: $i > $i ).

tff(decl_51,type,
    esk8_2: ( $i * $i ) > $i ).

tff(decl_52,type,
    esk9_3: ( $i * $i * $i ) > $i ).

tff(decl_53,type,
    esk10_2: ( $i * $i ) > $i ).

tff(decl_54,type,
    esk11_3: ( $i * $i * $i ) > $i ).

tff(decl_55,type,
    esk12_3: ( $i * $i * $i ) > $i ).

tff(decl_56,type,
    esk13_2: ( $i * $i ) > $i ).

tff(decl_57,type,
    esk14_2: ( $i * $i ) > $i ).

tff(decl_58,type,
    esk15_1: $i > $i ).

tff(decl_59,type,
    esk16_1: $i > $i ).

tff(decl_60,type,
    esk17_1: $i > $i ).

tff(decl_61,type,
    esk18_0: $i ).

tff(decl_62,type,
    esk19_0: $i ).

fof(sos_32,axiom,
    ! [X96,X97] :
      ( ( occurrence_of(X97,tptp0)
        & subactivity_occurrence(X96,X97)
        & arboreal(X96)
        & ~ leaf_occ(X96,X97) )
     => ? [X98,X99,X100] :
          ( occurrence_of(X98,tptp3)
          & next_subocc(X96,X98,tptp0)
          & occurrence_of(X99,tptp4)
          & next_subocc(X98,X99,tptp0)
          & ( occurrence_of(X100,tptp2)
            | occurrence_of(X100,tptp1) )
          & next_subocc(X99,X100,tptp0)
          & leaf(X100,tptp0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).

fof(goals,conjecture,
    ! [X101,X102] :
      ( ( occurrence_of(X102,tptp0)
        & subactivity_occurrence(X101,X102)
        & arboreal(X101)
        & ~ leaf_occ(X101,X102) )
     => ? [X103,X104] :
          ( occurrence_of(X103,tptp3)
          & next_subocc(X101,X103,tptp0)
          & ( occurrence_of(X104,tptp2)
            | occurrence_of(X104,tptp1) )
          & min_precedes(X103,X104,tptp0)
          & leaf(X104,tptp0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(sos_04,axiom,
    ! [X16,X17,X18] :
      ( next_subocc(X16,X17,X18)
    <=> ( min_precedes(X16,X17,X18)
        & ~ ? [X19] :
              ( min_precedes(X16,X19,X18)
              & min_precedes(X19,X17,X18) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).

fof(sos,axiom,
    ! [X1,X2,X3,X4] :
      ( ( min_precedes(X1,X2,X4)
        & min_precedes(X2,X3,X4) )
     => min_precedes(X1,X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).

fof(c_0_4,plain,
    ! [X96,X97] :
      ( ( occurrence_of(X97,tptp0)
        & subactivity_occurrence(X96,X97)
        & arboreal(X96)
        & ~ leaf_occ(X96,X97) )
     => ? [X98,X99,X100] :
          ( occurrence_of(X98,tptp3)
          & next_subocc(X96,X98,tptp0)
          & occurrence_of(X99,tptp4)
          & next_subocc(X98,X99,tptp0)
          & ( occurrence_of(X100,tptp2)
            | occurrence_of(X100,tptp1) )
          & next_subocc(X99,X100,tptp0)
          & leaf(X100,tptp0) ) ),
    inference(fof_simplification,[status(thm)],[sos_32]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X101,X102] :
        ( ( occurrence_of(X102,tptp0)
          & subactivity_occurrence(X101,X102)
          & arboreal(X101)
          & ~ leaf_occ(X101,X102) )
       => ? [X103,X104] :
            ( occurrence_of(X103,tptp3)
            & next_subocc(X101,X103,tptp0)
            & ( occurrence_of(X104,tptp2)
              | occurrence_of(X104,tptp1) )
            & min_precedes(X103,X104,tptp0)
            & leaf(X104,tptp0) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).

fof(c_0_6,plain,
    ! [X217,X218] :
      ( ( occurrence_of(esk15_1(X217),tptp3)
        | ~ occurrence_of(X218,tptp0)
        | ~ subactivity_occurrence(X217,X218)
        | ~ arboreal(X217)
        | leaf_occ(X217,X218) )
      & ( next_subocc(X217,esk15_1(X217),tptp0)
        | ~ occurrence_of(X218,tptp0)
        | ~ subactivity_occurrence(X217,X218)
        | ~ arboreal(X217)
        | leaf_occ(X217,X218) )
      & ( occurrence_of(esk16_1(X217),tptp4)
        | ~ occurrence_of(X218,tptp0)
        | ~ subactivity_occurrence(X217,X218)
        | ~ arboreal(X217)
        | leaf_occ(X217,X218) )
      & ( next_subocc(esk15_1(X217),esk16_1(X217),tptp0)
        | ~ occurrence_of(X218,tptp0)
        | ~ subactivity_occurrence(X217,X218)
        | ~ arboreal(X217)
        | leaf_occ(X217,X218) )
      & ( occurrence_of(esk17_1(X217),tptp2)
        | occurrence_of(esk17_1(X217),tptp1)
        | ~ occurrence_of(X218,tptp0)
        | ~ subactivity_occurrence(X217,X218)
        | ~ arboreal(X217)
        | leaf_occ(X217,X218) )
      & ( next_subocc(esk16_1(X217),esk17_1(X217),tptp0)
        | ~ occurrence_of(X218,tptp0)
        | ~ subactivity_occurrence(X217,X218)
        | ~ arboreal(X217)
        | leaf_occ(X217,X218) )
      & ( leaf(esk17_1(X217),tptp0)
        | ~ occurrence_of(X218,tptp0)
        | ~ subactivity_occurrence(X217,X218)
        | ~ arboreal(X217)
        | leaf_occ(X217,X218) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).

fof(c_0_7,negated_conjecture,
    ! [X224,X225] :
      ( occurrence_of(esk19_0,tptp0)
      & subactivity_occurrence(esk18_0,esk19_0)
      & arboreal(esk18_0)
      & ~ leaf_occ(esk18_0,esk19_0)
      & ( ~ occurrence_of(X225,tptp2)
        | ~ occurrence_of(X224,tptp3)
        | ~ next_subocc(esk18_0,X224,tptp0)
        | ~ min_precedes(X224,X225,tptp0)
        | ~ leaf(X225,tptp0) )
      & ( ~ occurrence_of(X225,tptp1)
        | ~ occurrence_of(X224,tptp3)
        | ~ next_subocc(esk18_0,X224,tptp0)
        | ~ min_precedes(X224,X225,tptp0)
        | ~ leaf(X225,tptp0) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).

cnf(c_0_8,plain,
    ( next_subocc(esk16_1(X1),esk17_1(X1),tptp0)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    occurrence_of(esk19_0,tptp0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,plain,
    ( leaf(esk17_1(X1),tptp0)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_11,plain,
    ! [X120,X121,X122,X123,X124,X125,X126] :
      ( ( min_precedes(X120,X121,X122)
        | ~ next_subocc(X120,X121,X122) )
      & ( ~ min_precedes(X120,X123,X122)
        | ~ min_precedes(X123,X121,X122)
        | ~ next_subocc(X120,X121,X122) )
      & ( min_precedes(X124,esk1_3(X124,X125,X126),X126)
        | ~ min_precedes(X124,X125,X126)
        | next_subocc(X124,X125,X126) )
      & ( min_precedes(esk1_3(X124,X125,X126),X125,X126)
        | ~ min_precedes(X124,X125,X126)
        | next_subocc(X124,X125,X126) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_04])])])])])]) ).

cnf(c_0_12,negated_conjecture,
    ( next_subocc(esk16_1(X1),esk17_1(X1),tptp0)
    | leaf_occ(X1,esk19_0)
    | ~ subactivity_occurrence(X1,esk19_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    subactivity_occurrence(esk18_0,esk19_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_14,negated_conjecture,
    arboreal(esk18_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_15,negated_conjecture,
    ~ leaf_occ(esk18_0,esk19_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_16,plain,
    ( next_subocc(esk15_1(X1),esk16_1(X1),tptp0)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_17,negated_conjecture,
    ( leaf(esk17_1(X1),tptp0)
    | leaf_occ(X1,esk19_0)
    | ~ subactivity_occurrence(X1,esk19_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_9]) ).

cnf(c_0_18,plain,
    ( occurrence_of(esk17_1(X1),tptp2)
    | occurrence_of(esk17_1(X1),tptp1)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_19,plain,
    ! [X105,X106,X107,X108] :
      ( ~ min_precedes(X105,X106,X108)
      | ~ min_precedes(X106,X107,X108)
      | min_precedes(X105,X107,X108) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])]) ).

cnf(c_0_20,plain,
    ( min_precedes(X1,X2,X3)
    | ~ next_subocc(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_21,negated_conjecture,
    next_subocc(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    ( next_subocc(esk15_1(X1),esk16_1(X1),tptp0)
    | leaf_occ(X1,esk19_0)
    | ~ subactivity_occurrence(X1,esk19_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_9]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ occurrence_of(X1,tptp1)
    | ~ occurrence_of(X2,tptp3)
    | ~ next_subocc(esk18_0,X2,tptp0)
    | ~ min_precedes(X2,X1,tptp0)
    | ~ leaf(X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_24,negated_conjecture,
    leaf(esk17_1(esk18_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_14])]),c_0_15]) ).

cnf(c_0_25,negated_conjecture,
    ( leaf_occ(X1,esk19_0)
    | occurrence_of(esk17_1(X1),tptp1)
    | occurrence_of(esk17_1(X1),tptp2)
    | ~ subactivity_occurrence(X1,esk19_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_9]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ occurrence_of(X1,tptp2)
    | ~ occurrence_of(X2,tptp3)
    | ~ next_subocc(esk18_0,X2,tptp0)
    | ~ min_precedes(X2,X1,tptp0)
    | ~ leaf(X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_27,plain,
    ( occurrence_of(esk15_1(X1),tptp3)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_28,plain,
    ( next_subocc(X1,esk15_1(X1),tptp0)
    | leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0)
    | ~ subactivity_occurrence(X1,X2)
    | ~ arboreal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_29,plain,
    ( min_precedes(X1,X4,X3)
    | ~ min_precedes(X1,X2,X3)
    | ~ min_precedes(X2,X4,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_30,negated_conjecture,
    min_precedes(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_31,negated_conjecture,
    next_subocc(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_14])]),c_0_15]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ next_subocc(esk18_0,X1,tptp0)
    | ~ occurrence_of(esk17_1(esk18_0),tptp1)
    | ~ occurrence_of(X1,tptp3)
    | ~ min_precedes(X1,esk17_1(esk18_0),tptp0) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_33,negated_conjecture,
    ( occurrence_of(esk17_1(esk18_0),tptp2)
    | occurrence_of(esk17_1(esk18_0),tptp1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_13]),c_0_14])]),c_0_15]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ next_subocc(esk18_0,X1,tptp0)
    | ~ occurrence_of(esk17_1(esk18_0),tptp2)
    | ~ occurrence_of(X1,tptp3)
    | ~ min_precedes(X1,esk17_1(esk18_0),tptp0) ),
    inference(spm,[status(thm)],[c_0_26,c_0_24]) ).

cnf(c_0_35,negated_conjecture,
    ( leaf_occ(X1,esk19_0)
    | occurrence_of(esk15_1(X1),tptp3)
    | ~ subactivity_occurrence(X1,esk19_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_9]) ).

cnf(c_0_36,negated_conjecture,
    ( next_subocc(X1,esk15_1(X1),tptp0)
    | leaf_occ(X1,esk19_0)
    | ~ subactivity_occurrence(X1,esk19_0)
    | ~ arboreal(X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_9]) ).

cnf(c_0_37,negated_conjecture,
    ( min_precedes(X1,esk17_1(esk18_0),tptp0)
    | ~ min_precedes(X1,esk16_1(esk18_0),tptp0) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_38,negated_conjecture,
    min_precedes(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
    inference(spm,[status(thm)],[c_0_20,c_0_31]) ).

cnf(c_0_39,negated_conjecture,
    ( ~ next_subocc(esk18_0,X1,tptp0)
    | ~ occurrence_of(X1,tptp3)
    | ~ min_precedes(X1,esk17_1(esk18_0),tptp0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).

cnf(c_0_40,negated_conjecture,
    occurrence_of(esk15_1(esk18_0),tptp3),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_13]),c_0_14])]),c_0_15]) ).

cnf(c_0_41,negated_conjecture,
    next_subocc(esk18_0,esk15_1(esk18_0),tptp0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_13]),c_0_14])]),c_0_15]) ).

cnf(c_0_42,negated_conjecture,
    min_precedes(esk15_1(esk18_0),esk17_1(esk18_0),tptp0),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : PRO014+2 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n016.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 Aug 28 19:43:00 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 0.52/0.60  % Version  : CSE_E---1.5
% 0.52/0.60  % Problem  : theBenchmark.p
% 0.52/0.60  % Proof found
% 0.52/0.60  % SZS status Theorem for theBenchmark.p
% 0.52/0.60  % SZS output start Proof
% See solution above
% 0.52/0.60  % Total time : 0.032000 s
% 0.52/0.60  % SZS output end Proof
% 0.52/0.60  % Total time : 0.036000 s
%------------------------------------------------------------------------------