TSTP Solution File: SWC101+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC101+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n005.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 : Sun May 5 09:58:50 EDT 2024
% Result : Theorem 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 10
% Syntax : Number of formulae : 53 ( 16 unt; 0 def)
% Number of atoms : 389 ( 164 equ)
% Maximal formula atoms : 40 ( 7 avg)
% Number of connectives : 538 ( 202 ~; 161 |; 151 &)
% ( 4 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 123 ( 77 !; 46 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1850,plain,
$false,
inference(trivial_inequality_removal,[],[f1849]) ).
fof(f1849,plain,
nil != nil,
inference(superposition,[],[f1616,f1618]) ).
fof(f1618,plain,
nil = sK19,
inference(backward_demodulation,[],[f379,f1617]) ).
fof(f1617,plain,
nil = sK21,
inference(trivial_inequality_removal,[],[f1569]) ).
fof(f1569,plain,
( nil != nil
| nil = sK21 ),
inference(backward_demodulation,[],[f385,f1564]) ).
fof(f1564,plain,
nil = sK20,
inference(resolution,[],[f1563,f396]) ).
fof(f396,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f1563,plain,
( ~ ssList(nil)
| nil = sK20 ),
inference(resolution,[],[f1562,f377]) ).
fof(f377,plain,
ssList(sK20),
inference(cnf_transformation,[],[f255]) ).
fof(f255,plain,
( ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( nil != sK18
| nil != sK19 )
& ( nil != sK20
| nil = sK21 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK20
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != sK22
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK20)
& sK21 = app(sK20,sK22)
& ssList(sK22)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22])],[f99,f254,f253,f252,f251,f250]) ).
fof(f250,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X0
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,sK18)
| ~ neq(sK18,nil) )
& ( nil != sK18
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,sK18)
| ~ neq(sK18,nil) )
& ( nil != sK18
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( nil != sK18
| nil != sK19 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( nil != sK18
| nil != sK19 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( nil != sK18
| nil != sK19 )
& ( nil != sK20
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK20
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK20)
& app(sK20,X4) = X3
& ssList(X4) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( nil != sK18
| nil != sK19 )
& ( nil != sK20
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK20
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK20)
& app(sK20,X4) = X3
& ssList(X4) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( nil != sK18
| nil != sK19 )
& ( nil != sK20
| nil = sK21 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK20
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK20)
& app(sK20,X4) = sK21
& ssList(X4) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK20
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK20)
& app(sK20,X4) = sK21
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK20
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != sK22
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK20)
& sK21 = app(sK20,sK22)
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X0
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X0
| nil != X1 )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ( nil = X0
& nil = X1 )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ( nil = X0
& nil = X1 )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f1562,plain,
( ~ ssList(sK20)
| ~ ssList(nil)
| nil = sK20 ),
inference(resolution,[],[f1561,f643]) ).
fof(f643,plain,
ssList(sK19),
inference(forward_demodulation,[],[f378,f379]) ).
fof(f378,plain,
ssList(sK21),
inference(cnf_transformation,[],[f255]) ).
fof(f1561,plain,
( ~ ssList(sK19)
| ~ ssList(sK20)
| ~ ssList(nil)
| nil = sK20 ),
inference(resolution,[],[f1546,f381]) ).
fof(f381,plain,
ssList(sK22),
inference(cnf_transformation,[],[f255]) ).
fof(f1546,plain,
( ~ ssList(sK22)
| ~ ssList(sK20)
| ~ ssList(sK19)
| ~ ssList(nil)
| nil = sK20 ),
inference(duplicate_literal_removal,[],[f1540]) ).
fof(f1540,plain,
( ~ ssList(sK22)
| ~ ssList(sK20)
| ~ ssList(sK19)
| ~ ssList(nil)
| ~ ssList(sK20)
| nil = sK20 ),
inference(resolution,[],[f1528,f966]) ).
fof(f966,plain,
( ~ frontsegP(sK19,sK20)
| ~ ssList(nil)
| ~ ssList(sK20)
| nil = sK20 ),
inference(resolution,[],[f576,f640]) ).
fof(f640,plain,
( ~ neq(sK20,nil)
| ~ frontsegP(sK19,sK20) ),
inference(forward_demodulation,[],[f639,f380]) ).
fof(f380,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f255]) ).
fof(f639,plain,
( ~ frontsegP(sK19,sK20)
| ~ neq(sK18,nil) ),
inference(forward_demodulation,[],[f387,f380]) ).
fof(f387,plain,
( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) ),
inference(cnf_transformation,[],[f255]) ).
fof(f576,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f356]) ).
fof(f356,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f198]) ).
fof(f198,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f1528,plain,
( frontsegP(sK19,sK20)
| ~ ssList(sK22)
| ~ ssList(sK20)
| ~ ssList(sK19) ),
inference(superposition,[],[f629,f642]) ).
fof(f642,plain,
sK19 = app(sK20,sK22),
inference(forward_demodulation,[],[f382,f379]) ).
fof(f382,plain,
sK21 = app(sK20,sK22),
inference(cnf_transformation,[],[f255]) ).
fof(f629,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f586]) ).
fof(f586,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f369]) ).
fof(f369,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK67(X0,X1)) = X0
& ssList(sK67(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK67])],[f367,f368]) ).
fof(f368,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK67(X0,X1)) = X0
& ssList(sK67(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f367,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f366]) ).
fof(f366,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f201]) ).
fof(f201,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
fof(f385,plain,
( nil != sK20
| nil = sK21 ),
inference(cnf_transformation,[],[f255]) ).
fof(f379,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f255]) ).
fof(f1616,plain,
nil != sK19,
inference(trivial_inequality_removal,[],[f1571]) ).
fof(f1571,plain,
( nil != nil
| nil != sK19 ),
inference(backward_demodulation,[],[f641,f1564]) ).
fof(f641,plain,
( nil != sK20
| nil != sK19 ),
inference(forward_demodulation,[],[f386,f380]) ).
fof(f386,plain,
( nil != sK18
| nil != sK19 ),
inference(cnf_transformation,[],[f255]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC101+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n005.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 : Fri May 3 20:30:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % (1179)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36 % (1183)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.19/0.36 % (1182)WARNING: value z3 for option sas not known
% 0.19/0.37 % (1180)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.19/0.37 % (1181)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.19/0.37 % (1182)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.19/0.37 % (1184)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.19/0.37 % (1185)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.19/0.37 % (1186)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.19/0.37 TRYING [1]
% 0.19/0.37 TRYING [2]
% 0.19/0.38 TRYING [3]
% 0.19/0.38 TRYING [1]
% 0.19/0.38 TRYING [2]
% 0.19/0.40 TRYING [3]
% 0.19/0.41 TRYING [4]
% 0.19/0.41 TRYING [1]
% 0.19/0.41 TRYING [2]
% 0.19/0.42 % (1185)First to succeed.
% 0.19/0.42 % (1185)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1179"
% 0.19/0.42 % (1185)Refutation found. Thanks to Tanya!
% 0.19/0.42 % SZS status Theorem for theBenchmark
% 0.19/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.43 % (1185)------------------------------
% 0.19/0.43 % (1185)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.19/0.43 % (1185)Termination reason: Refutation
% 0.19/0.43
% 0.19/0.43 % (1185)Memory used [KB]: 2189
% 0.19/0.43 % (1185)Time elapsed: 0.059 s
% 0.19/0.43 % (1185)Instructions burned: 104 (million)
% 0.19/0.43 % (1179)Success in time 0.079 s
%------------------------------------------------------------------------------