TSTP Solution File: COM013+4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : COM013+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n004.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 Aug 30 18:36:18 EDT 2023
% Result : Theorem 0.18s 0.63s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 32
% Syntax : Number of formulae : 64 ( 9 unt; 27 typ; 0 def)
% Number of atoms : 266 ( 14 equ)
% Maximal formula atoms : 50 ( 7 avg)
% Number of connectives : 359 ( 130 ~; 152 |; 59 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 44 ( 25 >; 19 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 2 con; 0-4 aty)
% Number of variables : 76 ( 1 sgn; 32 !; 14 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
aElement0: $i > $o ).
tff(decl_23,type,
aRewritingSystem0: $i > $o ).
tff(decl_24,type,
aReductOfIn0: ( $i * $i * $i ) > $o ).
tff(decl_25,type,
iLess0: ( $i * $i ) > $o ).
tff(decl_26,type,
sdtmndtplgtdt0: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
sdtmndtasgtdt0: ( $i * $i * $i ) > $o ).
tff(decl_28,type,
isConfluent0: $i > $o ).
tff(decl_29,type,
isLocallyConfluent0: $i > $o ).
tff(decl_30,type,
isTerminating0: $i > $o ).
tff(decl_31,type,
aNormalFormOfIn0: ( $i * $i * $i ) > $o ).
tff(decl_32,type,
xR: $i ).
tff(decl_33,type,
esk1_3: ( $i * $i * $i ) > $i ).
tff(decl_34,type,
esk2_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_35,type,
esk3_1: $i > $i ).
tff(decl_36,type,
esk4_1: $i > $i ).
tff(decl_37,type,
esk5_1: $i > $i ).
tff(decl_38,type,
esk6_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_39,type,
esk7_1: $i > $i ).
tff(decl_40,type,
esk8_1: $i > $i ).
tff(decl_41,type,
esk9_1: $i > $i ).
tff(decl_42,type,
esk10_1: $i > $i ).
tff(decl_43,type,
esk11_1: $i > $i ).
tff(decl_44,type,
esk12_3: ( $i * $i * $i ) > $i ).
tff(decl_45,type,
esk13_0: $i ).
tff(decl_46,type,
esk14_1: $i > $i ).
tff(decl_47,type,
esk15_1: $i > $i ).
tff(decl_48,type,
esk16_1: $i > $i ).
fof(m__,conjecture,
! [X1] :
( aElement0(X1)
=> ( ! [X2] :
( aElement0(X2)
=> ( iLess0(X2,X1)
=> ? [X3] :
( aElement0(X3)
& ( X2 = X3
| ( ( aReductOfIn0(X3,X2,xR)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X2,xR)
& sdtmndtplgtdt0(X4,xR,X3) ) )
& sdtmndtplgtdt0(X2,xR,X3) ) )
& sdtmndtasgtdt0(X2,xR,X3)
& ~ ? [X4] : aReductOfIn0(X4,X3,xR)
& aNormalFormOfIn0(X3,X2,xR) ) ) )
=> ? [X2] :
( ( aElement0(X2)
& ( X1 = X2
| aReductOfIn0(X2,X1,xR)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X1,xR)
& sdtmndtplgtdt0(X3,xR,X2) )
| sdtmndtplgtdt0(X1,xR,X2)
| sdtmndtasgtdt0(X1,xR,X2) )
& ~ ? [X3] : aReductOfIn0(X3,X2,xR) )
| aNormalFormOfIn0(X2,X1,xR) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mTCDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtplgtdt0(X1,X2,X3)
<=> ( aReductOfIn0(X3,X1,X2)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,X2)
& sdtmndtplgtdt0(X4,X2,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCDef) ).
fof(mReduct,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aRewritingSystem0(X2) )
=> ! [X3] :
( aReductOfIn0(X3,X1,X2)
=> aElement0(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mReduct) ).
fof(m__587,hypothesis,
( aRewritingSystem0(xR)
& ! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( ( aReductOfIn0(X2,X1,xR)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X1,xR)
& sdtmndtplgtdt0(X3,xR,X2) )
| sdtmndtplgtdt0(X1,xR,X2) )
=> iLess0(X2,X1) ) )
& isTerminating0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__587) ).
fof(mTermin,axiom,
! [X1] :
( aRewritingSystem0(X1)
=> ( isTerminating0(X1)
<=> ! [X2,X3] :
( ( aElement0(X2)
& aElement0(X3) )
=> ( sdtmndtplgtdt0(X2,X1,X3)
=> iLess0(X3,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTermin) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( aElement0(X1)
=> ( ! [X2] :
( aElement0(X2)
=> ( iLess0(X2,X1)
=> ? [X3] :
( aElement0(X3)
& ( X2 = X3
| ( ( aReductOfIn0(X3,X2,xR)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X2,xR)
& sdtmndtplgtdt0(X4,xR,X3) ) )
& sdtmndtplgtdt0(X2,xR,X3) ) )
& sdtmndtasgtdt0(X2,xR,X3)
& ~ ? [X4] : aReductOfIn0(X4,X3,xR)
& aNormalFormOfIn0(X3,X2,xR) ) ) )
=> ? [X2] :
( ( aElement0(X2)
& ( X1 = X2
| aReductOfIn0(X2,X1,xR)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X1,xR)
& sdtmndtplgtdt0(X3,xR,X2) )
| sdtmndtplgtdt0(X1,xR,X2)
| sdtmndtasgtdt0(X1,xR,X2) )
& ~ ? [X3] : aReductOfIn0(X3,X2,xR) )
| aNormalFormOfIn0(X2,X1,xR) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X9,X10,X11,X13] :
( ( aElement0(esk1_3(X9,X10,X11))
| aReductOfIn0(X11,X9,X10)
| ~ sdtmndtplgtdt0(X9,X10,X11)
| ~ aElement0(X9)
| ~ aRewritingSystem0(X10)
| ~ aElement0(X11) )
& ( aReductOfIn0(esk1_3(X9,X10,X11),X9,X10)
| aReductOfIn0(X11,X9,X10)
| ~ sdtmndtplgtdt0(X9,X10,X11)
| ~ aElement0(X9)
| ~ aRewritingSystem0(X10)
| ~ aElement0(X11) )
& ( sdtmndtplgtdt0(esk1_3(X9,X10,X11),X10,X11)
| aReductOfIn0(X11,X9,X10)
| ~ sdtmndtplgtdt0(X9,X10,X11)
| ~ aElement0(X9)
| ~ aRewritingSystem0(X10)
| ~ aElement0(X11) )
& ( ~ aReductOfIn0(X11,X9,X10)
| sdtmndtplgtdt0(X9,X10,X11)
| ~ aElement0(X9)
| ~ aRewritingSystem0(X10)
| ~ aElement0(X11) )
& ( ~ aElement0(X13)
| ~ aReductOfIn0(X13,X9,X10)
| ~ sdtmndtplgtdt0(X13,X10,X11)
| sdtmndtplgtdt0(X9,X10,X11)
| ~ aElement0(X9)
| ~ aRewritingSystem0(X10)
| ~ aElement0(X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCDef])])])])]) ).
fof(c_0_7,plain,
! [X6,X7,X8] :
( ~ aElement0(X6)
| ~ aRewritingSystem0(X7)
| ~ aReductOfIn0(X8,X6,X7)
| aElement0(X8) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mReduct])])]) ).
fof(c_0_8,negated_conjecture,
! [X58,X61,X62,X63] :
( aElement0(esk13_0)
& ( aElement0(esk14_1(X58))
| ~ iLess0(X58,esk13_0)
| ~ aElement0(X58) )
& ( aElement0(esk15_1(X58))
| aReductOfIn0(esk14_1(X58),X58,xR)
| X58 = esk14_1(X58)
| ~ iLess0(X58,esk13_0)
| ~ aElement0(X58) )
& ( aReductOfIn0(esk15_1(X58),X58,xR)
| aReductOfIn0(esk14_1(X58),X58,xR)
| X58 = esk14_1(X58)
| ~ iLess0(X58,esk13_0)
| ~ aElement0(X58) )
& ( sdtmndtplgtdt0(esk15_1(X58),xR,esk14_1(X58))
| aReductOfIn0(esk14_1(X58),X58,xR)
| X58 = esk14_1(X58)
| ~ iLess0(X58,esk13_0)
| ~ aElement0(X58) )
& ( sdtmndtplgtdt0(X58,xR,esk14_1(X58))
| X58 = esk14_1(X58)
| ~ iLess0(X58,esk13_0)
| ~ aElement0(X58) )
& ( sdtmndtasgtdt0(X58,xR,esk14_1(X58))
| ~ iLess0(X58,esk13_0)
| ~ aElement0(X58) )
& ( ~ aReductOfIn0(X61,esk14_1(X58),xR)
| ~ iLess0(X58,esk13_0)
| ~ aElement0(X58) )
& ( aNormalFormOfIn0(esk14_1(X58),X58,xR)
| ~ iLess0(X58,esk13_0)
| ~ aElement0(X58) )
& ( esk13_0 != X62
| ~ aElement0(X62)
| aReductOfIn0(esk16_1(X62),X62,xR) )
& ( ~ aReductOfIn0(X62,esk13_0,xR)
| ~ aElement0(X62)
| aReductOfIn0(esk16_1(X62),X62,xR) )
& ( ~ aElement0(X63)
| ~ aReductOfIn0(X63,esk13_0,xR)
| ~ sdtmndtplgtdt0(X63,xR,X62)
| ~ aElement0(X62)
| aReductOfIn0(esk16_1(X62),X62,xR) )
& ( ~ sdtmndtplgtdt0(esk13_0,xR,X62)
| ~ aElement0(X62)
| aReductOfIn0(esk16_1(X62),X62,xR) )
& ( ~ sdtmndtasgtdt0(esk13_0,xR,X62)
| ~ aElement0(X62)
| aReductOfIn0(esk16_1(X62),X62,xR) )
& ~ aNormalFormOfIn0(X62,esk13_0,xR) ),
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_9,plain,
( sdtmndtplgtdt0(X2,X3,X1)
| ~ aReductOfIn0(X1,X2,X3)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( aElement0(X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( aReductOfIn0(esk16_1(X1),X1,xR)
| esk13_0 != X1
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
aElement0(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,hypothesis,
! [X54,X55,X56] :
( aRewritingSystem0(xR)
& ( ~ aReductOfIn0(X55,X54,xR)
| iLess0(X55,X54)
| ~ aElement0(X54)
| ~ aElement0(X55) )
& ( ~ aElement0(X56)
| ~ aReductOfIn0(X56,X54,xR)
| ~ sdtmndtplgtdt0(X56,xR,X55)
| iLess0(X55,X54)
| ~ aElement0(X54)
| ~ aElement0(X55) )
& ( ~ sdtmndtplgtdt0(X54,xR,X55)
| iLess0(X55,X54)
| ~ aElement0(X54)
| ~ aElement0(X55) )
& isTerminating0(xR) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__587])])])]) ).
cnf(c_0_14,plain,
( sdtmndtplgtdt0(X2,X3,X4)
| ~ aElement0(X1)
| ~ aReductOfIn0(X1,X2,X3)
| ~ sdtmndtplgtdt0(X1,X3,X4)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_15,plain,
! [X43,X44,X45] :
( ( ~ isTerminating0(X43)
| ~ aElement0(X44)
| ~ aElement0(X45)
| ~ sdtmndtplgtdt0(X44,X43,X45)
| iLess0(X45,X44)
| ~ aRewritingSystem0(X43) )
& ( aElement0(esk10_1(X43))
| isTerminating0(X43)
| ~ aRewritingSystem0(X43) )
& ( aElement0(esk11_1(X43))
| isTerminating0(X43)
| ~ aRewritingSystem0(X43) )
& ( sdtmndtplgtdt0(esk10_1(X43),X43,esk11_1(X43))
| isTerminating0(X43)
| ~ aRewritingSystem0(X43) )
& ( ~ iLess0(esk11_1(X43),esk10_1(X43))
| isTerminating0(X43)
| ~ aRewritingSystem0(X43) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTermin])])])])]) ).
cnf(c_0_16,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
aReductOfIn0(esk16_1(esk13_0),esk13_0,xR),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_11]),c_0_12])]) ).
cnf(c_0_18,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ sdtmndtplgtdt0(X4,X2,X3)
| ~ aReductOfIn0(X4,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_20,plain,
( iLess0(X3,X2)
| ~ isTerminating0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X2,X1,X3)
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
sdtmndtplgtdt0(esk13_0,xR,esk16_1(esk13_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_12])]) ).
cnf(c_0_22,hypothesis,
isTerminating0(xR),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
aElement0(esk16_1(esk13_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_18]),c_0_12])]) ).
cnf(c_0_24,negated_conjecture,
( ~ aReductOfIn0(X1,esk14_1(X2),xR)
| ~ iLess0(X2,esk13_0)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
( aReductOfIn0(esk16_1(X1),X1,xR)
| ~ sdtmndtplgtdt0(esk13_0,xR,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
( aElement0(esk14_1(X1))
| ~ iLess0(X1,esk13_0)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
( sdtmndtplgtdt0(esk13_0,xR,X1)
| ~ sdtmndtplgtdt0(esk16_1(esk13_0),xR,X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_18]),c_0_12])]) ).
cnf(c_0_28,negated_conjecture,
( sdtmndtplgtdt0(X1,xR,esk14_1(X1))
| X1 = esk14_1(X1)
| ~ iLess0(X1,esk13_0)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
iLess0(esk16_1(esk13_0),esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_18]),c_0_23]),c_0_12])]) ).
cnf(c_0_30,negated_conjecture,
( ~ sdtmndtplgtdt0(esk13_0,xR,esk14_1(X1))
| ~ iLess0(X1,esk13_0)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( esk14_1(esk16_1(esk13_0)) = esk16_1(esk13_0)
| sdtmndtplgtdt0(esk13_0,xR,esk14_1(esk16_1(esk13_0)))
| ~ aElement0(esk14_1(esk16_1(esk13_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_23])]) ).
cnf(c_0_32,negated_conjecture,
( aReductOfIn0(esk16_1(X1),X1,xR)
| ~ aReductOfIn0(X1,esk13_0,xR)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,negated_conjecture,
( esk14_1(esk16_1(esk13_0)) = esk16_1(esk13_0)
| ~ aElement0(esk14_1(esk16_1(esk13_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29]),c_0_23])]) ).
cnf(c_0_34,negated_conjecture,
( ~ iLess0(X1,esk13_0)
| ~ aReductOfIn0(esk14_1(X1),esk13_0,xR)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_32]),c_0_26]) ).
cnf(c_0_35,negated_conjecture,
esk14_1(esk16_1(esk13_0)) = esk16_1(esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_26]),c_0_29]),c_0_23])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_29]),c_0_17]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : COM013+4 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.11/0.31 % Computer : n004.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Aug 29 12:42:37 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.18/0.60 start to proof: theBenchmark
% 0.18/0.63 % Version : CSE_E---1.5
% 0.18/0.63 % Problem : theBenchmark.p
% 0.18/0.63 % Proof found
% 0.18/0.63 % SZS status Theorem for theBenchmark.p
% 0.18/0.63 % SZS output start Proof
% See solution above
% 0.18/0.63 % Total time : 0.021000 s
% 0.18/0.63 % SZS output end Proof
% 0.18/0.63 % Total time : 0.025000 s
%------------------------------------------------------------------------------